Provably recursive functions of constructive and relatively constructive theories

DOI10.1007/S00153-009-0172-0MaRDI QIDQ964451zbMATH OpenOpenAlexFDO

Authors 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

forcingnegative translationHeyting arithmeticFriedman's translationintuitionistic bounded arithmetic

Mathematics Subject Classification ID

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

Recommendations

• Syntactic translations and provably recursive functions
• Fragments of HA based on \(\Sigma_ 1\)-induction
• scientific article; zbMATH DE number 4066875
• scientific article; zbMATH DE number 4099295
• Functional interpretations of feasibly constructive arithmetic

Cites work

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

Cited in

(17)

• Axiomatic recursion theory and the continuous functionals
• On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
• A semantic approach to conservativity
• The lack of definable witnesses and provably recursive functions in intuitionistic set theories
• scientific article; zbMATH DE number 3870631 (Why is no real title available?)
• Computer Aided Systems Theory – EUROCAST 2005
• Interpreting classical theories in constructive ones
• Intuitionistic fixed point theories over Heyting arithmetic
• A proof-theoretical analysis of semiconstructive intermediate theories
• scientific article; zbMATH DE number 4148083 (Why is no real title available?)
• scientific article; zbMATH DE number 3896333 (Why is no real title available?)
• Productive sets and constructively nonpartial-recursive functions
• Induction and inductive definitions in fragments of second order arithmetic
• Fragments of HA based on \(\Sigma_ 1\)-induction
• Inner constructivizability of functional structures
• Proof-theoretical analysis: Weak systems of functions and classes
• scientific article; zbMATH DE number 4099295 (Why is no real title available?)

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

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