| Publication | Date of Publication | Type |
|---|
Theories of proof-theoretic strength \(\psi(\Gamma_{\Omega+1})\)
Concepts of Proof in Mathematics, Philosophy, and Computer Science | 2020-04-03 | Paper |
Unfolding schematic systems
Outstanding Contributions to Logic | 2020-02-05 | Paper |
A flexible type system for the small Veblen ordinal
Archive for Mathematical Logic | 2019-07-04 | Paper |
Katalin Bimbó. Proof Theory: Sequent Calculi and Related Formalisms. CRC Press, Boca Raton, 2014, x + 374 pp.
The Bulletin of Symbolic Logic | 2017-05-26 | Paper |
A note on the theory \(\mathrm{SID}_{<\omega}\) of stratified induction
Mathematical Logic Quarterly | 2014-12-05 | Paper |
Weak theories of truth and explicit mathematics
| 2014-06-24 | Paper |
Realisability in weak systems of explicit mathematics
Mathematical Logic Quarterly | 2011-12-23 | Paper |
Admissible closures of polynomial time computable arithmetic
Archive for Mathematical Logic | 2011-08-16 | Paper |
Weak theories of operations and types
| 2011-03-09 | Paper |
Unfolding finitist arithmetic
The Review of Symbolic Logic | 2011-01-12 | Paper |
Elementary explicit types and polynomial time operations
Mathematical Logic Quarterly | 2009-06-11 | Paper |
Primitive recursive selection functions for existential assertions over abstract algebras
The Journal of Logic and Algebraic Programming | 2008-09-01 | Paper |
On the proof theory of type two functionals based on primitive recursive operations
Mathematical Logic Quarterly | 2006-08-30 | Paper |
Reflections on reflections in explicit mathematics
Annals of Pure and Applied Logic | 2005-09-22 | Paper |
A proof-theoretic characterization of the basic feasible functionals
Theoretical Computer Science | 2005-02-09 | Paper |
Wellordering proofs for metapredicative Mahlo
Journal of Symbolic Logic | 2004-03-17 | Paper |
Theories with self-application and computational complexity.
Information and Computation | 2004-03-14 | Paper |
Intuitionistic Fixed Point Theories for Strictly Positive Operators
| 2004-03-01 | Paper |
scientific article; zbMATH DE number 1870423 (Why is no real title available?)
| 2003-02-18 | Paper |
Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory
The Journal of Symbolic Logic | 2002-12-05 | Paper |
The non-constructive \(\mu\) operator, fixed point theories with ordinals, and the bar rule
Annals of Pure and Applied Logic | 2001-07-16 | Paper |
scientific article; zbMATH DE number 1390282 (Why is no real title available?)
| 2001-06-05 | Paper |
The unfolding of non-finitist arithmetic
Annals of Pure and Applied Logic | 2001-05-02 | Paper |
Fixed point theories and dependent choice
Archive for Mathematical Logic | 2001-03-13 | Paper |
scientific article; zbMATH DE number 1418436 (Why is no real title available?)
| 2000-12-26 | Paper |
scientific article; zbMATH DE number 1420857 (Why is no real title available?)
| 2000-03-22 | Paper |
Bar induction and \(\omega\) model reflection
Annals of Pure and Applied Logic | 1999-09-22 | Paper |
The proof-theoretic analysis of transfinitely iterated fixed point theories
Journal of Symbolic Logic | 1999-09-16 | Paper |
The \(\mu\) quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals
Archive for Mathematical Logic | 1999-09-09 | Paper |
Polynomial time operations in explicit mathematics
Journal of Symbolic Logic | 1997-09-28 | Paper |
Systems of explicit mathematics with non-constructive \(\mu\)-operator and join
Annals of Pure and Applied Logic | 1997-01-06 | Paper |
Some theories with positive induction of ordinal strength φω0
Journal of Symbolic Logic | 1996-12-12 | Paper |
Second order theories with ordinals and elementary comprehension
Archive for Mathematical Logic | 1996-09-22 | Paper |
Partial Applicative Theories and Explicit Substitutions
Journal Of Logic And Computation | 1996-05-09 | Paper |
Totality in applicative theories
Annals of Pure and Applied Logic | 1996-03-05 | Paper |
