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

DOI10.1016/J.APAL.2006.06.002zbMath1114.03030OpenAlexW1964935999MaRDI QIDQ866557

Zofia Adamowicz, Leszek Aleksander Kołodziejczyk

Publication date: 14 February 2007

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.2006.06.002

zbMATH Keywords

bounded arithmeticmaximal modelsconsistency statementsbounded formula hierarchy

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62)

Related Items (1)

A note on the Σ₁collection scheme and fragments of bounded arithmetic

Cites Work

• Preservation theorems and restricted consistency statements in bounded arithmetic
• Existentially closed structures and Gödel's second incompleteness theorem
• Cuts, consistency statements and interpretations
• On maximal theories
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partial collapses of the \(\Sigma _1\) complexity hierarchy in models for fragments of bounded arithmetic