Realizability for Peano arithmetic with winning conditions in HON games

DOI10.1016/j.apal.2016.10.006zbMath1377.03020OpenAlexW2536088897MaRDI QIDQ345704

Valentin Blot

Publication date: 2 December 2016

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

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) Semantics in the theory of computing (68Q55) First-order arithmetic and fragments (03F30) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Related Items (1)

A game-semantic model of computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On full abstraction for PCF: I, II and III
• Dependent choice, `quote' and the clock
• Asynchronous games. II: The true concurrency of innocence
• Sequential algorithms and strongly stable functions
• Control categories and duality: on the categorical semantics of the lambda-mu calculus
• Existential witness extraction in classical realizability and via a negative translation
• Least and Greatest Fixpoints in Game Semantics
• Thick Subtrees, Games and Experiments
• On the computational content of the axiom of choice
• A semantics of evidence for classical arithmetic
• Realizability for Peano Arithmetic with Winning Conditions in HON Games
• Typed lambda-calculus in classical Zermelo-Fraenkel set theory

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