Partial types allow the reasoning about partial functions in type theory.
The partial functions of main interest are recursively computed functions, which are commonly assigned types using fixpoint induction. However, fixpoint is valid only on admissible types. Previous work has shown many types to be admissible, but has not shown any dependent products to be admissible. In this paper I present two new tools, predicate-admissibility and monotonicity, for showing types to be admissible. This alleviates difficulties in applying partial types to theorem proving in practice.