On the Hierarchy of Intuitionistic Bounded Arithmetic

DOI10.1093/LOGCOM/EXN003zbMATH Open1147.03032OpenAlexW2016116596MaRDI QIDQ3520239FDOQ3520239

Authors: Morteza Moniri 

Publication date: 15 August 2008

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exn003

Recommendations

• scientific article; zbMATH DE number 4066875
• Relating the bounded arithmetic and polynomial time hierarchies
• scientific article; zbMATH DE number 4059391
• Bounded arithmetic and the polynomial hierarchy
• Comparing Constructive Arithmetical Theories Based on NP-PIND and coNP-PIND

zbMATH Keywords

bounded arithmeticintuitionistic logicpolynomial hierarchyKripke model

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Cited In (15)

• On different intuitionistic calculi and embeddings from Int to S4
• Title not available (Why is that?)
• Provably recursive functions of constructive and relatively constructive theories
• Bounded arithmetic in free logic
• An intuitionistic formula hierarchy based on high‐school identities
• The polynomial and linear time hierarchies in V⁰
• A note on uniform density in weak arithmetical theories
• On intuitionistic elementary arithmetic
• Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness
• An Independence Result for Intuitionistic Bounded Arithmetic
• Title not available (Why is that?)
• Bounded arithmetic and the polynomial hierarchy
• Characterizations of interpretability in bounded arithmetic
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On the Hierarchy of Intuitionistic Bounded Arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520239)