Affiliation:
1. Institute of Computer Science, University of Bern , 3012 Bern, Switzerland
Abstract
AbstractStrict-$\varPi ^{1}_{1}$ reflection is an important principle that is discussed in detail, e.g. in Barwise [ 2]. Whereas Barwise puts his focus on the importance of strict-$\varPi ^{1}_{1}$ formulas for generalized recursion theory and definability theory, we choose a proof-theoretic approach.
Publisher
Oxford University Press (OUP)
Subject
Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science
Reference17 articles.
1. Applications of strict $\varPi ^{1}_{1}$ predicates to infinitary logic;Barwise;The Journal of Symbolic Logic,1969
2. Admissible Sets and Structures;Barwise,1975
3. A new system for proof-theoretic ordinal functions;Buchholz;Annals of Pure and Applied Logic,1986
4. A simplified version of local predicativity;Buchholz,1992
5. Assigning ordinals to proofs in a perspicious way;Buchholz,2002