19 results
TRUNCATION AND SEMI-DECIDABILITY NOTIONS IN APPLICATIVE THEORIES
-
- Journal:
- The Journal of Symbolic Logic / Volume 83 / Issue 3 / September 2018
- Published online by Cambridge University Press:
- 23 October 2018, pp. 967-990
- Print publication:
- September 2018
-
- Article
- Export citation
ABOUT SOME FIXED POINT AXIOMS AND RELATED PRINCIPLES IN KRIPKE–PLATEK ENVIRONMENTS
-
- Journal:
- The Journal of Symbolic Logic / Volume 83 / Issue 2 / June 2018
- Published online by Cambridge University Press:
- 01 August 2018, pp. 642-668
- Print publication:
- June 2018
-
- Article
- Export citation
RELATIVIZING OPERATIONAL SET THEORY
-
- Journal:
- Bulletin of Symbolic Logic / Volume 22 / Issue 3 / September 2016
- Published online by Cambridge University Press:
- 10 October 2016, pp. 332-352
- Print publication:
- September 2016
-
- Article
- Export citation
EXPLICIT MATHEMATICS AND OPERATIONAL SET THEORY: SOME ONTOLOGICAL COMPARISONS
-
- Journal:
- Bulletin of Symbolic Logic / Volume 20 / Issue 3 / September 2014
- Published online by Cambridge University Press:
- 24 October 2014, pp. 275-292
- Print publication:
- September 2014
-
- Article
- Export citation
Preface
-
- Journal:
- Mathematical Structures in Computer Science / Volume 2 / Issue 2 / June 1992
- Published online by Cambridge University Press:
- 04 March 2009, p. 109
-
- Article
- Export citation
The Denjoy type of argument for quasiperiodically forced circle diffeomorphisms
-
- Journal:
- Ergodic Theory and Dynamical Systems / Volume 26 / Issue 2 / April 2006
- Published online by Cambridge University Press:
- 17 March 2006, pp. 447-465
- Print publication:
- April 2006
-
- Article
- Export citation
Metapredicative and explicit Mahlo: a proof-theoretic perspective
- from ARTICLES
-
-
- Book:
- Logic Colloquium 2000
- Published online:
- 27 June 2017
- Print publication:
- 02 March 2005, pp 272-293
-
- Chapter
- Export citation
Recursion by optimization: on the complexity of bidirectional optimality theory
-
- Journal:
- Natural Language Engineering / Volume 9 / Issue 1 / March 2003
- Published online by Cambridge University Press:
- 04 June 2003, pp. 21-38
-
- Article
- Export citation
The proof-theoretic analysis of the Suslin operator in applicative theories
- from PART III - APPLICATIVE AND SELF-APPLICATIVE THEORIES
-
-
- Book:
- Reflections on the Foundations of Mathematics
- Published online:
- 31 March 2017
- Print publication:
- 02 March 2002, pp 270-292
-
- Chapter
- Export citation
First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo
-
- Journal:
- The Journal of Symbolic Logic / Volume 66 / Issue 3 / September 2001
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1073-1089
- Print publication:
- September 2001
-
- Article
- Export citation
Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory
-
- Journal:
- The Journal of Symbolic Logic / Volume 66 / Issue 2 / June 2001
- Published online by Cambridge University Press:
- 12 March 2014, pp. 935-958
- Print publication:
- June 2001
-
- Article
- Export citation
The proof-theoretic analysis of transfinitely iterated fixed point theories
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 1 / March 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 53-67
- Print publication:
- March 1999
-
- Article
- Export citation
Power types in explicit mathematics?
-
- Journal:
- The Journal of Symbolic Logic / Volume 62 / Issue 4 / December 1997
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1142-1146
- Print publication:
- December 1997
-
- Article
- Export citation
Some theories with positive induction of ordinal strength φω0
-
- Journal:
- The Journal of Symbolic Logic / Volume 61 / Issue 3 / September 1996
- Published online by Cambridge University Press:
- 12 March 2014, pp. 818-842
- Print publication:
- September 1996
-
- Article
- Export citation
About some symmetries of negation
-
- Journal:
- The Journal of Symbolic Logic / Volume 59 / Issue 2 / June 1994
- Published online by Cambridge University Press:
- 12 March 2014, pp. 473-485
- Print publication:
- June 1994
-
- Article
- Export citation
About the proof-theoretic ordinals of weak fixed point theories
-
- Journal:
- The Journal of Symbolic Logic / Volume 57 / Issue 3 / September 1992
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1108-1119
- Print publication:
- September 1992
-
- Article
- Export citation
Wilfried Buchholz and Kurt Schütte. Proof theory of impredicative subsystems of analysis. Studies in proof theory. Bibliopolis, Naples1988, 122 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 56 / Issue 1 / March 1991
- Published online by Cambridge University Press:
- 12 March 2014, pp. 332-333
- Print publication:
- March 1991
-
- Article
- Export citation
A boundedness theorem in ID1(W)
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 4 / December 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 942-947
- Print publication:
- December 1986
-
- Article
- Export citation
The strength of admissibility without foundation
-
- Journal:
- The Journal of Symbolic Logic / Volume 49 / Issue 3 / September 1984
- Published online by Cambridge University Press:
- 12 March 2014, pp. 867-879
- Print publication:
- September 1984
-
- Article
- Export citation