Affiliations: [a] Centro de Matemática, Universidade do Minho, Portugal. [email protected] | [b] Institut de Recherche en Informatique de Toulouse (IRIT), CNRS and University of Toulouse, France. [email protected] | [c] Centro de Matemática, Universidade do Minho, Portugal. [email protected]
Correspondence:
[*]
Address for correspondence: IRIT - Université Paul Sabatier, 118 route de Narbonne, F-31062 Toulouse Cedex 9, France
Abstract: If we consider as “member” of a simple type the outcome of any successful (possibly infinite) run of bottom-up proof search that starts from the type, then several concepts of “finiteness” for simple types are possible: the finiteness of the search space, the finiteness of any member, or the finiteness of the number of finite members (in other words, the inhabitants). In this paper we show that these three concepts are instances of the same parameterized notion of finiteness, and that a single, parameterized proof shows the decidability of all of them. One instance of this result means that termination of proof search is decidable. A separate result is that emptiness is also decidable (where emptiness is absence of “members” as above, not just absence of inhabitants). This fact is an ingredient of the main decidability result, but it also has a different application, the definition of the pruned search space - the one where branches leading to failure are chopped off. We conclude with our version of König’s lemma for simple types: a simple type has an infinite member exactly when the pruned search space is infinite.
