Herbrand analyses
From MaRDI portal
bounded arithmeticpolynomial hierarchysecond-order arithmeticreflection principlePRAprimitive recursive arithmeticrecursive functionalsHerbrand theoremGrzegorczyk hierarchyextractions of relevant functions from proofsHerbrand theoryKalmar elementary classProvably total functionstransformations of proofs
Recommendations
Cites work
- scientific article; zbMATH DE number 4134034 (Why is no real title available?)
- scientific article; zbMATH DE number 3167150 (Why is no real title available?)
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 4139739 (Why is no real title available?)
- scientific article; zbMATH DE number 4148057 (Why is no real title available?)
- scientific article; zbMATH DE number 4160708 (Why is no real title available?)
- scientific article; zbMATH DE number 4025439 (Why is no real title available?)
- scientific article; zbMATH DE number 4033738 (Why is no real title available?)
- scientific article; zbMATH DE number 4033742 (Why is no real title available?)
- scientific article; zbMATH DE number 4059391 (Why is no real title available?)
- scientific article; zbMATH DE number 4099295 (Why is no real title available?)
- scientific article; zbMATH DE number 3497886 (Why is no real title available?)
- scientific article; zbMATH DE number 3578859 (Why is no real title available?)
- A classification of the ordinal recursive functions
- Classes of recursive functions based on Ackermann's function
- Countable algebra and set existence axioms
- Eine Klassifikation der ε0‐Rekursiven Funktionen
- Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
- Fragments of arithmetic
- Herbrand-Analysen zweier Beweise des Satzes von Roth: Polynomiale Anzahlschranken
- Mathematical significance of consistency proofs
- Nested recursion
- On n-quantifier induction
- On the Interpretation of Non-Finitist Proofs--Part I
- On the interpretation of non-finitist proofs–Part II
- On the scheme of induction for bounded arithmetic formulas
- Proof theory. 2nd ed
- Quantifier-free and one-quantifier systems
Cited in
(26)- Local induction and provably total computable functions
- Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization
- Remarks on Herbrand normal forms and Herbrand realizations
- Induction rules, reflection principles, and provably recursive functions
- On the Herbrand content of LK
- Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA
- A simple proof of Parsons' theorem
- Herbrand's theorem and extractive proof theory
- Harrington's conservation theorem redone
- scientific article; zbMATH DE number 1841838 (Why is no real title available?)
- Saturated models of universal theories
- Formalizing forcing arguments in subsystems of second-order arithmetic
- On extracting variable Herbrand disjunctions
- Annual meeting of the Association for Symbolic Logic, Notre Dame, 1993
- On nested simple recursion
- A note on the proof theory of the -calculus
- Herbrand-Analysen zweier Beweise des Satzes von Roth: Polynomiale Anzahlschranken
- Unprovability results for clause set cycles
- On the relationship between ATR0 and
- Theories with self-application and computational complexity.
- An approximate Herbrand's theorem and definable functions in metric structures
- scientific article; zbMATH DE number 440482 (Why is no real title available?)
- Primitive recursive selection functions for existential assertions over abstract algebras
- Unfolding schematic systems
- Effectiveness and provability
- Term rewriting theory for the primitive recursive functions
This page was built for publication: Herbrand analyses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641297)
