The following pages link to On <i>n</i>-quantifier induction (Q5680103):
Displaying 29 items.
- Provability and interpretability logics with restricted realizations (Q435232) (← links)
- A complexity analysis of functional interpretations (Q557798) (← links)
- A simple proof of Parsons' theorem (Q558443) (← links)
- Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA (Q711565) (← links)
- Corrected upper bounds for free-cut elimination (Q719283) (← links)
- Fragments of arithmetic (Q762484) (← links)
- Primitive recursive selection functions for existential assertions over abstract algebras (Q941429) (← links)
- Fast growing functions based on Ramsey theorems (Q1191932) (← links)
- Theory of proofs (arithmetic and analysis) (Q1260035) (← links)
- On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness (Q1295420) (← links)
- Elementary descent recursion and proof theory (Q1344279) (← links)
- Induction rules, reflection principles, and provably recursive functions (Q1361250) (← links)
- Remarks on Herbrand normal forms and Herbrand realizations (Q1813063) (← links)
- Parameter free induction and provably total computable functions (Q1960416) (← links)
- Things that can and things that cannot be done in PRA (Q1971796) (← links)
- Unprovability results for clause set cycles (Q2084942) (← links)
- On extracting variable Herbrand disjunctions (Q2157604) (← links)
- On axiom schemes for \(T\)-provably \(\Delta_1\) formulas (Q2449854) (← links)
- Bounded functional interpretation (Q2488269) (← links)
- The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\) (Q2565986) (← links)
- Herbrand analyses (Q2641297) (← links)
- Term extraction and Ramsey's theorem for pairs (Q2915896) (← links)
- On the computational content of the Bolzano-Weierstraß Principle (Q3053232) (← links)
- A note on parameter free Π<sub>1</sub> -induction and restricted exponentiation (Q3096079) (← links)
- Verificationism and Classical Realizability (Q3305313) (← links)
- Pa-Beweisbare ∀∃-Formeln (Q3338236) (← links)
- INTERRELATION BETWEEN WEAK FRAGMENTS OF DOUBLE NEGATION SHIFT AND RELATED PRINCIPLES (Q4692078) (← links)
- Axiomatizing Kripke's theory of truth (Q5480633) (← links)
- AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW (Q6140183) (← links)
