A generalization of a conservativity theorem for classical versus intuitionistic arithmetic
From MaRDI portal
Publication:4458699
Recommendations
- Publication:3478407
- Some conservative extension results on classical and intuitionistic sequent calculi
- A note on the complexity of classical and intuitionistic proofs
- Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness
- A Note on Conservativity Relations among Bounded Arithmetic Theories
- Classical provability of uniform versions and intuitionistic provability
- CONSERVATION THEOREMS ON SEMI-CLASSICAL ARITHMETIC
- An arithmetic interpretation of intuitionistic verification
- An Independence Result for Intuitionistic Bounded Arithmetic
- On a system of intuitionistic analysis equivalent to classical analysis
Cited in
(13)- Combining Classical and Intuitionistic Implications
- Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness
- Proof-theoretic conservations of weak weak intuitionistic constructive set theories
- Refining the arithmetical hierarchy of classical principles
- A semantic approach to conservativity
- Arithmetical conservation results
- Prenex normal form theorems in semi-classical arithmetic
- Interpreting classical theories in constructive ones
- Some intuitionistic equivalents of classical principles for degree 2 formulas
- scientific article; zbMATH DE number 3557755 (Why is no real title available?)
- Non-commutative classical arithmetical sequent calculi are intuitionistic
- Towards an arithmetic theory of consistency enforcement based on preservation of \(\delta\)-constraints
- Provably recursive functions of constructive and relatively constructive theories
This page was built for publication: A generalization of a conservativity theorem for classical versus intuitionistic arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458699)
