Model theory of bounded arithmetic with applications to independence results
From MaRDI portal
Publication:5393641
zbMATH Open1107.03039MaRDI QIDQ5393641FDOQ5393641
Authors: Morteza Moniri
Publication date: 23 October 2006
Recommendations
intuitionistic logicpolynomial hierarchyKripke modelNPcoNPpolynomial inductionmodels for theories of bounded arithmetic
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62)
Cited In (17)
- Existentially Closed Models and Conservation Results in Bounded Arithmetic
- Model-complete theories of bounded unars
- Structure and definability in general bounded arithmetic theories
- Regular cuts in models of bounded arithmetic
- Separations of theories in weak bounded arithmetic
- Structures interpretable in models of bounded arithmetic
- An Independence Result for Intuitionistic Bounded Arithmetic
- On freedom and independence in hypergraphs of models of theories
- Independence results for variants of sharply bounded induction
- On Models Constructed by Means of the Arithmetized Completeness Theorem
- Bounded finite set theory
- New models of bounded induction axioms
- Construction of models of bounded arithmetic by restricted reduced powers
- Models of Bounded Arithmetic Theories and Some Related Complexity Questions
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Remark on Independence Results for Sharply Bounded Arithmetic
This page was built for publication: Model theory of bounded arithmetic with applications to independence results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5393641)