Game semantics for first-order logic
From MaRDI portal
Abstract: We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results. We use a Church style extension of Parigot's lambda-mu-calculus to represent proofs of first-order classical logic. We present some relations with Krivine's classical realizability and applications to type isomorphisms.
Recommendations
Cited in
(9)- Finite games for a predicate logic without contractions
- Games in the semantics of programming languages -- an elementary introduction
- Games and bisimulations for intuitionistic first-order Kripke models
- scientific article; zbMATH DE number 1688376 (Why is no real title available?)
- Combining control effects and their models: game semantics for a hierarchy of static, dynamic and delimited control effects
- Imperative programs as proofs via game semantics
- Study of behaviours via visitable paths
- The true concurrency of Herbrand's theorem
- Game-theoretic semantics for non-distributive logics
This page was built for publication: Game semantics for first-order logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3064167)