Pages that link to "Item:Q2986812"
From MaRDI portal
The following pages link to A Constructive Proof of Dependent Choice, Compatible with Classical Logic (Q2986812):
Displaying 12 items.
- Completeness and decidability results for CTL in constructive type theory (Q287375) (← links)
- Delimited control operators prove double-negation shift (Q450950) (← links)
- Dependent choice, `quote' and the clock (Q1884884) (← links)
- The effects of effects on constructivism (Q2133168) (← links)
- A Classical Sequent Calculus with Dependent Types (Q2988668) (← links)
- The Axiom of Choice as Interaction Brief Remarks on the Principle of Dependent Choices in a Dialogical Setting (Q3295841) (← links)
- EM + Ext<sub>−</sub> + AC<sub>int</sub> is equivalent to AC<sub>ext</sub> (Q4736750) (← links)
- ANF preserves dependent types up to extensional equality (Q5051989) (← links)
- Computability Beyond Church-Turing via Choice Sequences (Q5145297) (← links)
- Typed Lambda Calculi and Applications (Q5704010) (← links)
- Stateful Realizers for Nonstandard Analysis (Q6135755) (← links)
- Adding Negation to Lambda Mu (Q6135761) (← links)