Realizability for Peano arithmetic with winning conditions in HON games

DOI10.1007/978-3-642-38946-7_8MaRDI QIDQ5300895zbMATH OpenOpenAlexFDO

Authors Valentin Blot

Publication date 28 June 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38946-7_8

Mathematics Subject Classification ID

Logic in computer science (03B70) First-order arithmetic and fragments (03F30) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Semantics in the theory of computing (68Q55) Applications of game theory (91A80)

Recommendations

• Realizability for Peano arithmetic with winning conditions in HON games
• Specifying Peirce's law in classical realizability
• Classical realizability and arithmetical formulæ
• Learning based realizability for HA + EM1 and 1-backtracking games: soundness and completeness
• Publication:4944901

Cited in

(3)

• Specifying Peirce's law in classical realizability
• Realizability for Peano arithmetic with winning conditions in HON games
• Classical realizability and arithmetical formulæ

This page was built for publication: Realizability for Peano arithmetic with winning conditions in HON games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300895)