The following pages link to (Q4012886):
Displaying 13 items.
- The computational content of Walras' existence theorem (Q632841) (← links)
- A constructive valuation semantics for classical logic (Q1355127) (← links)
- Uniform Heyting arithmetic (Q1772775) (← links)
- On preserving the computational content of mathematical proofs: toy examples for a formalising strategy (Q2117791) (← links)
- Programs from proofs using classical dependent choice (Q2482844) (← links)
- Exploring the computational content of the infinite pigeonhole principle (Q2882563) (← links)
- Transfinite update procedures for predicative systems of analysis (Q2915671) (← links)
- Classical proofs as programs: How, what and why (Q4594253) (← links)
- A short proof of the strong normalization of classical natural deduction with disjunction (Q4650284) (← links)
- Programs with continuations and linear logic (Q5096236) (← links)
- Classical Extraction in Continuation Models (Q5369478) (← links)
- Exploring Computational Contents of Intuitionist Proofs (Q5463274) (← links)
- Refined program extraction from classical proofs (Q5957850) (← links)