A Constructive Proof of Dependent Choice, Compatible with Classical Logic
From MaRDI portal
Recommendations
- Intuitionistic choice and restricted classical logic
- Intuitionistic choice and classical logic
- Choice Principles and Constructive Logics†
- The Independent Choice Logic and Beyond
- A credal extension of independent choice logic
- DEPENDENT CHOICE, PROPERNESS, AND GENERIC ABSOLUTENESS
- Programs from proofs using classical dependent choice
- Determinate logic and the axiom of choice
- scientific article; zbMATH DE number 1342208
- Combinatorial proofs for constructive modal logic
Cited in
(17)- Dependent choice, `quote' and the clock
- The effects of effects on constructivism
- Completeness and decidability results for CTL in constructive type theory
- A classical sequent calculus with dependent types
- On choice rules in dependent type theory
- Classical mathematics for a constructive world
- The Axiom of Choice as Interaction Brief Remarks on the Principle of Dependent Choices in a Dialogical Setting
- On the Strength of Proof-Irrelevant Type Theories
- Delimited control operators prove double-negation shift
- Hybrid realizability for intuitionistic and classical choice
- EM + Ext− + ACint is equivalent to ACext
- ANF preserves dependent types up to extensional equality
- Computability beyond Church-Turing via choice sequences
- A sequent calculus with dependent types for classical arithmetic
- Typed Lambda Calculi and Applications
- Stateful Realizers for Nonstandard Analysis
- Adding Negation to Lambda Mu
This page was built for publication: A Constructive Proof of Dependent Choice, Compatible with Classical Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986812)
