scientific article; zbMATH DE number 3320380
From MaRDI portal
Publication:5600870
Cited in
(40)- Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
- What can be done with PRA?
- Unprovability of theorems of complexity theory in weak number theories
- Finite investigations of transfinite derivations
- On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
- Induction rules, reflection principles, and provably recursive functions
- Theories with self-application and computational complexity.
- Uniform Heyting arithmetic
- Totality in applicative theories
- Parameter free induction and provably total computable functions
- Things that can and things that cannot be done in PRA
- Not all Kripke models of \(\mathsf{HA}\) are locally \(\mathsf{PA}\)
- The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\)
- Weak and strong versions of effective transfinite recursion
- On the Computational Content of Termination Proofs
- On Relating Theories: Proof-Theoretical Reduction
- Primitive recursion and the chain antichain principle
- Proof theoretic analysis by iterated reflection
- \(\Delta_{2}\) degrees without \(\Sigma_{1}\) induction
- The finitary content of sunny nonexpansive retractions
- The prehistory of the subsystems of second-order arithmetic
- A simple proof of Parsons' theorem
- Neo-Logicism and Its Logic
- On end extensions of models of subsystems of Peano arithmetic
- On uniform weak König's lemma
- Bounded finite set theory
- Intrinsic theories and computational complexity
- AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW
- On nested simple recursion
- Theoretical computer science: computational complexity
- On collection schemes and Gaifman's splitting theorem
- Term rewriting theory for the primitive recursive functions
- Hilbert's program revisited
- Arrow's theorem, ultrafilters, and reverse mathematics
- The Borel complexity of the class of models of first-order theories
- Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA
- Fragments of arithmetic
- Generalizing classical and effective model theory in theories of operations and classes
- Harrington's conservation theorem redone
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5600870)
