Provably recursive functions of constructive and relatively constructive theories

DOI10.1007/s00153-009-0172-0zbMath1197.03050OpenAlexW2091271932MaRDI QIDQ964451

Morteza Moniri

Publication date: 15 April 2010

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-009-0172-0

zbMATH Keywords

forcingHeyting arithmeticnegative translationFriedman's translationintuitionistic bounded arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Metamathematics of constructive systems (03F50) Intuitionistic mathematics (03F55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functional interpretations of feasibly constructive arithmetic
• Constructivism in mathematics. An introduction. Volume II
• Fragments of HA based on \(\Sigma_ 1\)-induction
• Interpreting classical theories in constructive ones
• On the Hierarchy of Intuitionistic Bounded Arithmetic
• Syntactic translations and provably recursive functions
• Provably total functions of intuitionistic bounded arithmetic
• On two questions about feasibly constructive arithmetic
• A generalization of a conservativity theorem for classical versus intuitionistic arithmetic
• Fragments of Heyting arithmetic
• Forcing in Proof Theory
• A new method for establishing conservativity of classical systems over their intuitionistic version
• Comparing Constructive Arithmetical Theories Based on NP-PIND and coNP-PIND
• Existence and feasibility in arithmetic

This page was built for publication: Provably recursive functions of constructive and relatively constructive theories