Preservation theorems and restricted consistency statements in bounded arithmetic

DOI10.1016/j.apal.2003.11.003zbMath1060.03080OpenAlexW2005184534MaRDI QIDQ598285

Arnold Beckmann

Publication date: 6 August 2004

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2003.11.003

zbMATH Keywords

Bounded arithmeticPreservation theoremsRestricted consistency

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Relative consistency and interpretations (03F25)

Related Items

Partial collapses of the \(\Sigma _1\) complexity hierarchy in models for fragments of bounded arithmetic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A contribution to the end-extension problem and the \(\Pi_ 1\) conservativeness problem
• On the scheme of induction for bounded arithmetic formulas
• Bounded arithmetic and truth definition
• Structure and definability in general bounded arithmetic theories
• On induction-free provability
• Dynamic ordinal analysis
• Relating the bounded arithmetic and polynomial time hierarchies
• Existentially closed structures and Gödel's second incompleteness theorem
• A Conservation Result Concerning Bounded Theories and the Collection Axiom
• A note on bounded arithmetic
• Quantified propositional calculi and fragments of bounded arithmetic
• Proving consistency of equational theories in bounded arithmetic
• Existence and feasibility in arithmetic
• Notes on polynomially bounded arithmetic

This page was built for publication: Preservation theorems and restricted consistency statements in bounded arithmetic