Restricted polynomial induction versus ordinary induction
From MaRDI portal
Publication:4565103
DOI10.4064/FM323-10-2017zbMATH Open1459.03088OpenAlexW2793244145MaRDI QIDQ4565103FDOQ4565103
Authors: Zofia Adamowicz
Publication date: 7 June 2018
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/fm323-10-2017
Recommendations
Cites Work
- Title not available (Why is that?)
- Diophantine induction
- A few questions concerning consistency and conservativeness
- Structure and definability in general bounded arithmetic theories
- Bootstrapping. I
- On induction-free provability
- Existentially closed structures and Gödel's second incompleteness theorem
- A Conservation Result Concerning Bounded Theories and the Collection Axiom
- Well-behaved principles alternative to bounded induction
- On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
- Title not available (Why is that?)
- Lower and upper bounds for the provability of Herbrand consistency in weak arithmetics
- End-extensions of models of weak arithmetic from complexity-theoretic containments
- Existentially closed models in the framework of arithmetic
Cited In (5)
This page was built for publication: Restricted polynomial induction versus ordinary induction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4565103)