Fragments of arithmetic
From MaRDI portal
Publication:762484
DOI10.1016/0168-0072(85)90030-2zbMATH Open0558.03029OpenAlexW2038447110MaRDI QIDQ762484FDOQ762484
Authors: Wilfried Sieg 
Publication date: 1985
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(85)90030-2
Recommendations
First-order arithmetic and fragments (03F30) Second- and higher-order arithmetic and fragments (03F35) Relative consistency and interpretations (03F25)
Cites Work
- Title not available (Why is that?)
- Systems of predicative analysis
- Title not available (Why is that?)
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- Title not available (Why is that?)
- A survey of proof theory
- Grundlagen der Mathematik I
- Title not available (Why is that?)
- On n-quantifier induction
- Note on the fan theorem
- Choice principles, the bar rule and autonomously iterated comprehension schemes in analysis
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- Quantifier-free and one-quantifier systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The optimality of induction as an axiomatization of arithmetic
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (41)
- Fluctuations, effective learnability and metastability in analysis
- Ordinal numbers and the Hilbert basis theorem
- Extensions of the Finitist Point of View
- Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization
- Remarks on Herbrand normal forms and Herbrand realizations
- How to characterize provably total functions by local predicativity
- Fragments of approximate counting
- Induction rules, reflection principles, and provably recursive functions
- Finite left-distributive algebras and embedding algebras
- Bimodal logics for extensions of arithmetical theories
- Majorizing provably recursive functions in fragments of PA
- The Baire category theorem in weak subsystems of second-order arithmetic
- Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA
- Left-distributive embedding algebras
- A simple proof of Parsons' theorem
- On uniform weak König's lemma
- European Summer Meeting of the Association for Symbolic Logic, Paris, 1985
- On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness
- The logic of \(\Pi_ 1\)-conservativity
- Number theory and elementary arithmetic†
- Fragments of Heyting arithmetic
- Predicative foundations of arithmetic
- Harrington's conservation theorem redone
- A note on the \(\Pi_ 2^ 0\)-induction rule
- On mathematical instrumentalism
- Saturated models of universal theories
- Baire categoricity and \(\Sigma_1^0\)-induction
- Formalizing forcing arguments in subsystems of second-order arithmetic
- European Summer Meeting of the Association for Symbolic Logic
- Hilbert's program and the omega-rule
- Some theories with positive induction of ordinal strength φω0
- Which set existence axioms are needed to prove the separable Hahn-Banach theorem?
- Iterated local reflection versus iterated consistency
- Herbrand analyses
- The prehistory of the subsystems of second-order arithmetic
- Theories with self-application and computational complexity.
- Hilbert versus Hindman
- Unfolding finitist arithmetic
- Things that can and things that cannot be done in PRA
- Separation and Weak König's Lemma
- Title not available (Why is that?)
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)
