Refining the arithmetical hierarchy of classical principles
From MaRDI portal
Abstract: We refine the arithmetical hierarchy of various classical principles by finely investigating the derivability relations between these principles over Heyting arithmetic. We mainly investigate some restricted versions of the law of excluded middle, de Morgan's law, the double negation elimination, the collection principle and the constant domain axiom.
Recommendations
- scientific article; zbMATH DE number 2152681
- Prenex normal form theorems in semi-classical arithmetic
- Some intuitionistic equivalents of classical principles for degree 2 formulas
- Interrelation between weak fragments of double negation shift and related principles
- Automata, Languages and Programming
Cites work
- \(\Delta^0_1\) variants of the law of excluded middle and related principles
- A generalization of a conservativity theorem for classical versus intuitionistic arithmetic
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Automata, Languages and Programming
- EXTENDED FRAMES AND SEPARATIONS OF LOGICAL PRINCIPLES
- Fragments of Heyting arithmetic
- scientific article; zbMATH DE number 2247263 (Why is no real title available?)
- Interrelation between weak fragments of double negation shift and related principles
- Logic and structure
- Markov's principle, Church's thesis and Lindelöf's theorem
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- On the disjunctive Markov principle
- Prenex normal form theorems in semi-classical arithmetic
- Ramsey theorem for pairs as a classical principle in intuitionistic arithmetic
- Ramsey's theorem for pairs and \(k\) colors as a sub-classical principle of arithmetic
- Some principles weaker than Markov's principle
- Weihrauch and constructive reducibility between existence statements
Cited in
(11)- Classical arithmetic is quite unnatural
- scientific article; zbMATH DE number 2152681 (Why is no real title available?)
- Prenex normal form theorems in semi-classical arithmetic
- Automata, Languages and Programming
- HARRINGTON’S PRINCIPLE IN HIGHER ORDER ARITHMETIC
- EXTENDED FRAMES AND SEPARATIONS OF LOGICAL PRINCIPLES
- AN ESCAPE FROM VARDANYAN’S THEOREM
- CONSERVATION THEOREMS ON SEMI-CLASSICAL ARITHMETIC
- Local operators in topos theory and separation of semi-classical axioms in intuitionistic arithmetic
- On the hierarchy of linearity axioms
- On the ^0_1-fragments of the Kreisel-Putnam axiom and two variants of the linearity axiom in intuitionistic arithmetic and analysis
This page was built for publication: Refining the arithmetical hierarchy of classical principles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094157)