Specifying Peirce's law in classical realizability

DOI10.1017/S0960129514000450zbMath1425.03009OpenAlexW2078059387MaRDI QIDQ2973242

Alexandre Miquel, Mauricio German Guillermo

Publication date: 3 April 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129514000450

Mathematics Subject Classification ID

Applications of game theory (91A80) Other game-theoretic models (91A40) Combinatory logic and lambda calculus (03B40)

Related Items (3)

Classical realizability and arithmetical formulæ ⋮ Implicative algebras: a new foundation for realizability and forcing ⋮ Verificationism and Classical Realizability

Cites Work

• Unnamed Item
• Unnamed Item
• Dependent choice, `quote' and the clock
• A symmetric lambda calculus for classical program extraction
• Classical Program Extraction in the Calculus of Constructions
• On the role of the Baire Category Theorem and Dependent Choice in the foundations of logic
• Proofs of strong normalisation for second order classical natural deduction
• On the interpretation of intuitionistic number theory
• Typed lambda-calculus in classical Zermelo-Fraenkel set theory

This page was built for publication: Specifying Peirce's law in classical realizability