Fragments of arithmetic
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3831930 (Why is no real title available?)
- scientific article; zbMATH DE number 3924748 (Why is no real title available?)
- scientific article; zbMATH DE number 3689386 (Why is no real title available?)
- scientific article; zbMATH DE number 3745164 (Why is no real title available?)
- scientific article; zbMATH DE number 3497842 (Why is no real title available?)
- scientific article; zbMATH DE number 3536056 (Why is no real title available?)
- scientific article; zbMATH DE number 3578859 (Why is no real title available?)
- scientific article; zbMATH DE number 3320380 (Why is no real title available?)
- scientific article; zbMATH DE number 3355016 (Why is no real title available?)
- A survey of proof theory
- Choice principles, the bar rule and autonomously iterated comprehension schemes in analysis
- Grundlagen der Mathematik I
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- Note on the fan theorem
- On n-quantifier induction
- Quantifier-free and one-quantifier systems
- Systems of predicative analysis
- The optimality of induction as an axiomatization of arithmetic
Cited in
(41)- A simple proof of Parsons' theorem
- Finite left-distributive algebras and embedding algebras
- Fragments of Heyting arithmetic
- Fluctuations, effective learnability and metastability in analysis
- Remarks on Herbrand normal forms and Herbrand realizations
- The Baire category theorem in weak subsystems of second-order arithmetic
- On uniform weak König's lemma
- How to characterize provably total functions by local predicativity
- The logic of \(\Pi_ 1\)-conservativity
- Ordinal numbers and the Hilbert basis theorem
- Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization
- Fragments of approximate counting
- Theories with self-application and computational complexity.
- Induction rules, reflection principles, and provably recursive functions
- Iterated local reflection versus iterated consistency
- European Summer Meeting of the Association for Symbolic Logic, Paris, 1985
- Predicative foundations of arithmetic
- A note on the \(\Pi_ 2^ 0\)-induction rule
- Unfolding finitist arithmetic
- Saturated models of universal theories
- On mathematical instrumentalism
- Hilbert's program and the omega-rule
- European Summer Meeting of the Association for Symbolic Logic
- Baire categoricity and \(\Sigma_1^0\)-induction
- Harrington's conservation theorem redone
- On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness
- Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA
- Which set existence axioms are needed to prove the separable Hahn-Banach theorem?
- Separation and Weak König's Lemma
- Bimodal logics for extensions of arithmetical theories
- Herbrand analyses
- Hilbert versus Hindman
- Things that can and things that cannot be done in PRA
- Left-distributive embedding algebras
- Number theory and elementary arithmetic†
- Some theories with positive induction of ordinal strength φω0
- The prehistory of the subsystems of second-order arithmetic
- Formalizing forcing arguments in subsystems of second-order arithmetic
- scientific article; zbMATH DE number 440479 (Why is no real title available?)
- Majorizing provably recursive functions in fragments of PA
- Extensions of the Finitist Point of View
This page was built for publication: Fragments of arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762484)
