The following pages link to Herbrand analyses (Q2641297):
Displaying 19 items.
- 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)
- Primitive recursive selection functions for existential assertions over abstract algebras (Q941429) (← links)
- Harrington's conservation theorem redone (Q948908) (← links)
- Induction rules, reflection principles, and provably recursive functions (Q1361250) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Remarks on Herbrand normal forms and Herbrand realizations (Q1813063) (← links)
- Saturated models of universal theories (Q1861531) (← links)
- A note on the proof theory of the \(\lambda \Pi\)-calculus (Q1891931) (← links)
- Unprovability results for clause set cycles (Q2084942) (← links)
- Local induction and provably total computable functions (Q2453069) (← links)
- Formalizing forcing arguments in subsystems of second-order arithmetic (Q2563983) (← links)
- Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization (Q4032661) (← links)
- Annual meeting of the Association for Symbolic Logic, Notre Dame, 1993 (Q4302362) (← links)
- Effectiveness and provability (Q4318898) (← links)
- Unfolding Schematic Systems (Q5214786) (← links)
- On the relationship between <i>ATR</i><sub>0</sub> and (Q5687314) (← links)
