The following pages link to (Q5600870):
Displaying 28 items.
- Primitive recursion and the chain antichain principle (Q435242) (← links)
- \(\Delta_{2}\) degrees without \(\Sigma_{1}\) induction (Q466117) (← links)
- A simple proof of Parsons' theorem (Q558443) (← links)
- On nested simple recursion (Q634775) (← links)
- Term rewriting theory for the primitive recursive functions (Q674412) (← links)
- Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA (Q711565) (← links)
- Fragments of arithmetic (Q762484) (← links)
- Generalizing classical and effective model theory in theories of operations and classes (Q810008) (← links)
- Harrington's conservation theorem redone (Q948908) (← links)
- Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction (Q1082338) (← links)
- What can be done with PRA? (Q1147134) (← links)
- Unprovability of theorems of complexity theory in weak number theories (Q1162506) (← links)
- Finite investigations of transfinite derivations (Q1254248) (← links)
- On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness (Q1295420) (← links)
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I (Q1314542) (← links)
- Induction rules, reflection principles, and provably recursive functions (Q1361250) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Uniform Heyting arithmetic (Q1772775) (← links)
- Totality in applicative theories (Q1896484) (← links)
- Parameter free induction and provably total computable functions (Q1960416) (← links)
- Things that can and things that cannot be done in PRA (Q1971796) (← links)
- Not all Kripke models of \(\mathsf{HA}\) are locally \(\mathsf{PA}\) (Q2074812) (← links)
- The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\) (Q2565986) (← links)
- Weak and strong versions of effective transfinite recursion (Q2683778) (← links)
- On the Computational Content of Termination Proofs (Q3195706) (← links)
- On Relating Theories: Proof-Theoretical Reduction (Q3305638) (← links)
- Bounded finite set theory (Q6047677) (← links)
- AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW (Q6140183) (← links)
