Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Shoenfield (1967)
Mathematical logic
Polynomiale Anzahlschranken (1989)
Herbrand-Analysen zweier Beweise des Satzes von Roth: Polynomiale AnzahlschrankenJournal of Symbolic Logic, 54
H. Schwichtenberg (1977)
Proof Theory: Some Applications of Cut-EliminationStudies in logic and the foundations of mathematics, 90
W. Sieg (1985)
Fragments of arithmeticAnn. Pure Appl. Log., 28
G. Kreisel (1982)
Finiteness Theorems in Arithmetic: An Application of Herbrand's Theorem For Σ2 - FormulasStudies in logic and the foundations of mathematics, 107
C. Parsons (1970)
Intuitionism and Proof Theory
H. Schwichtenberg (1977)
Handbook of mathematical Logic
G. Kreisel (1951)
On the interpretation of non-finitist proofs—Part IJournal of Symbolic Logic, 16
G. Kreisel, A. Levy (1968)
Reflection principles and their use for establishing the complexity of axiomatic systemsZ. Math. Logik Grundlagen Math., 14
W. Tait (1965)
Infinitely Long Terms of Transfinite TypeStudies in logic and the foundations of mathematics, 40
M. Beeson (1979)
Goodman’s theorem and beyondPacific Journal of Mathematics, 84
W. Sieg (1991)
Herbrand analysesArch. Math. Logic, 30
N. Goodman (1976)
The theory of the Gödel functionalsJournal of Symbolic Logic, 41
S. Kleene, M. Beeson (1952)
Introduction to Metamathematics
C. Parsons (1971)
On a number-theoretic choice schema II (abstract)J. Symb. Logic, 36
C. Parsons (1972)
On n-quantifier inductionJournal of Symbolic Logic, 37
W.W. Tait (1965)
Formal systems and recursive functions
C. Parsons (1970)
On a Number Theoretic Choice Schema and its Relation to InductionStudies in logic and the foundations of mathematics, 60
H. Luckhardt (1973)
Extensional Gödel Functional Interpretation
A. Troelstra (1973)
Metamathematical investigation of intuitionistic arithmetic and analysis
G. Kreisel, A. Levy (1968)
Reflection Principles and Their Use for Establishing the Complexity of Axiomatic SystemsMathematical Logic Quarterly, 14
H. Luckhardt (1973)
Extensional Godel functional interpretation;: A consistency proof of classical analysis
N. Goodman (1978)
Relativized realizability in intuitionistic arithmetic of all finite typesJournal of Symbolic Logic, 43
C. Parsons (1962)
Notice of a meeting of the Association for Symbolic LogicJournal of Symbolic Logic, 27
G. Kreisel (1982)
Proc. of the Herbrand symposium (Marseille, 1981)
G. Kreisel (1952)
On the concepts of completeness and interpretation of formal systemsFundamenta Mathematicae, 39
LetA H be the Herbrand normal form ofA andA H,D a Herbrand realization ofA H. We show (i) There is an example of an (open) theory ℐ+ with function parameters such that for someA not containing function parameters[Figure not available: see fulltext.] (ii) Similar for first order theories ℐ+ if the index functions used in definingA H are permitted to occur in instances of non-logical axiom schemata of ℐ, i.e. for suitable ℐ,A[Figure not available: see fulltext.] (iii) In fact, in (1) we can take for ℐ+ the fragment (Σ 1 0 -IA)+ of second order arithmetic with induction restricted toΣ 1 0 -formulas, and in (2) we can take for ℐ the fragment (Σ 1 0,b -IA) of first order arithmetic with induction restricted to formulas VxA(x) whereA contains only bounded quantifiers. (iv) On the other hand, $$PA^2 \vdash A^H \Rightarrow PA \vdash A,$$ wherePA 2 is the extension of first order arithmeticPA obtained by adding quantifiers for functions andA∈ℒ(PA). This generalizes to extensional arithmetic in the language of all finite types but not to sentencesA with positively occurring existential quantifiers for functions.
Archive for Mathematical Logic – Springer Journals
Published: Mar 23, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.