Realizability for Peano arithmetic with winning conditions in HON games

DOI10.1016/J.APAL.2016.10.006MaRDI QIDQ345704zbMATH OpenOpenAlexFDO

Authors Valentin Blot

Publication date 2 December 2016

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.apal.2016.10.006

zbMATH Keywords

Peano arithmeticclassical realizabilityHyland-Ong game semantics

Mathematics Subject Classification ID

Applications of game theory (91A80) 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)

Recommendations

• Realizability for Peano arithmetic with winning conditions in HON games
• Classical realizability and arithmetical formulæ
• Learning based realizability for HA + EM1 and 1-backtracking games: soundness and completeness
• Interactive learning based realizability and 1-backtracking games
• Publication:4944901

Cites work

• scientific article; zbMATH DE number 5851813 (Why is no real title available?)
• scientific article; zbMATH DE number 1215498 (Why is no real title available?)
• scientific article; zbMATH DE number 1223609 (Why is no real title available?)
• scientific article; zbMATH DE number 1241700 (Why is no real title available?)
• scientific article; zbMATH DE number 1499102 (Why is no real title available?)
• A semantics of evidence for classical arithmetic
• Asynchronous games 3 an innocent model of linear logic
• Asynchronous games. II: The true concurrency of innocence
• Control categories and duality: On the categorical semantics of the lambda-mu calculus
• Dependent choice, `quote' and the clock
• Existential witness extraction in classical realizability and via a negative translation
• Least and Greatest Fixpoints in Game Semantics
• On full abstraction for PCF: I, II and III
• On the computational content of the axiom of choice
• Realizability for Peano arithmetic with winning conditions in HON games
• Sequential algorithms and strongly stable functions
• Thick Subtrees, Games and Experiments
• Typed lambda-calculus in classical Zermelo-Fraenkel set theory

Cited in

(2)

• A game-semantic model of computation
• Realizability for Peano arithmetic with winning conditions in HON games

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 Q345704)