Theories of Finite Type Related to Mathematical Practice

Publisher Summary This chapter deals with the systems of second order, including a number that was selected for study only on syntactic grounds. The present exposition differs by concentrating on finite-type theories that directly reflect logical features of practice and in which everyday mathematics is readily developed. The chapter also presents closure conditions on universes of sets and functions. The elementary closure conditions lead to finite-type structures. Further, closure conditions include quantification functionals for each domain that is regarded as fixed (or definite) and recursion functionals for natural numbers. A number of finite-type theories based on these closure conditions are also presented in the chapter followed by recursion-theoretic models for finite-type theories.

[1]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[2]  Paul Lorenzen,et al.  Ma und Integral in der konstruktiven Analysis , 1951 .

[3]  W. A. Howard,et al.  Functional interpretation of bar induction by bar recursion , 1968 .

[4]  Solomon Feferman,et al.  Systems of predicative analysis, II: Representations of ordinals , 1968, Journal of Symbolic Logic.

[5]  Harvey Martin Friedman.  Subsystems of set theory and analysis , 1967 .

[6]  Solomon Feferman,et al.  Incompleteness along paths in progressions of theories , 1962, Journal of Symbolic Logic.

[7]  Georg Kreisel,et al.  A survey of proof theory , 1968, Journal of Symbolic Logic.

[8]  S. C. Kleene,et al.  Quantification of number-theoretic functions , 1960 .

[9]  Harvey M. Friedman.  Bar Induction and $\Pi^1_1-CA^1$ , 1969 .

[10]  D. Prawitz.  Ideas and Results in Proof Theory , 1971 .

[11]  E. Specker.  Ramsey's Theorem does not Hold in Recursive Set Theory , 1971 .

[12]  William A. Howard,et al.  A system of abstract constructive ordinals , 1972, Journal of Symbolic Logic.

[13]  Jon Barwise,et al.  On recursively saturated models of arithmetic , 1975 .

[14]  J. R. Shoenfield,et al.  A hierarchy based on a type two object , 1968 .

[15]  Wilfried Buchholz,et al.  Normalfunktionen und Konstruktive Systeme von Ordinalzahlen , 1975 .

[16]  W. Tait.  Infinitely Long Terms of Transfinite Type , 1965 .

[17]  Harvey M. Friedman,et al.  Higher set theory and mathematical practice , 1971 .

[18]  H. Friedman.  Axiomatic Recursive Function Theory , 1971 .

[19]  Jane Bridge,et al.  A simplification of the Bachmann method for generating large countable ordinals , 1975, Journal of Symbolic Logic.

[20]  William W. Tait,et al.  Normal derivability in classical logic , 1968 .

[21]  R. O. Gandy.  General recursive functionals of finite type and hierarchies of functions , 1967 .

[22]  S. Feferman.  Formal Theories for Transfinite Iterations of Generalized Inductive Definitions and Some Subsystems of Analysis , 1970 .

[23]  Solomon Feferman,et al.  Impredicativity of the existence of the largest divisible subgroup of an Abelian p-group , 1975 .

[24]  Jeffery I. Zucker.  Iterated inductive definitions, trees and ordinals , 1973 .

[25]  J. Girard.  Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des Types , 1971 .

[26]  Joseph Harrison,et al.  Recursive pseudo-well-orderings , 1968 .

[27]  G. Kreisel,et al.  The Axiom of Choice and the Class of Hyperarithmetic Functions , 1962 .

[28]  John R. Steel,et al.  Forcing with tagged trees , 1978 .

[29]  S. C. Kleene,et al.  Recursive functionals and quantifiers of finite types. II , 1959 .

[30]  Andrzej Grzegorczyk.  Elementarily definable analysis , 1955 .

[31]  Georg Kreisel,et al.  Reflection Principles and Their Use for Establishing the Complexity of Axiomatic Systems , 1968 .