Pages that link to "Item:Q1960416"
From MaRDI portal
The following pages link to Parameter free induction and provably total computable functions (Q1960416):
Displaying 16 items.
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- Axiomatizing provable \(n\)-provability (Q1732059) (← links)
- Unprovability results for clause set cycles (Q2084942) (← links)
- Local reflection, definable elements and 1-provability (Q2204378) (← links)
- Induction rules in bounded arithmetic (Q2309507) (← links)
- Local induction and provably total computable functions (Q2453069) (← links)
- On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories (Q2566065) (← links)
- Explicit Provability and Constructive Semantics (Q2732527) (← links)
- 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 (Q3011106) (← links)
- A note on parameter free Π<sub>1</sub> -induction and restricted exponentiation (Q3096079) (← links)
- Proof Theoretic Analysis by Iterated Reflection (Q4637223) (← links)
- Fragments of Arithmetic and true sentences (Q4680381) (← links)
- A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC (Q5044314) (← links)
- AXIOMATIZATION OF PROVABLE n-PROVABILITY (Q5222538) (← links)
- Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories (Q5404169) (← links)
- Coinduction in Flow: The Later Modality in Fibrations (Q5875348) (← links)
