Intuitionistic games: determinacy, completeness, and normalization
From MaRDI portal
Publication:332080
DOI10.1007/S11225-016-9661-4zbMATH Open1417.03127OpenAlexW2284305443MaRDI QIDQ332080FDOQ332080
Authors: Paweł Urzyczyn 
Publication date: 27 October 2016
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-016-9661-4
Recommendations
- The problem of determinacy of infinite games from an intuitionistic point of view
- Dialogues, strategies, and intuitionistic provability
- Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves
- Some remarks on relations between proofs and games
- The intuitionistic fragment of computability logic at the propositional level
Applications of game theory (91A80) Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20)
Cites Work
- Logic in games
- Lectures on the Curry-Howard isomorphism
- Proofs and countermodels in non-classical logics
- Locus solum: From the rules of logic to the logic of rules.
- Focusing and polarization in linear, intuitionistic, and classical logics
- On the strong normalisation of intuitionistic natural deduction with permutation-conversions
- A short note on type-inhabitation: formula-trees vs. game semantics
- Long normal form proof search and counter-model generation
- Some remarks on relations between proofs and games
- On Long Normal Inhabitants of a Type
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proof Search and Counter Model of Positive Minimal Predicate Logic
- Title not available (Why is that?)
- Mechanical procedure for proof construction via closed terms in typed \(\lambda\) calculus
Cited In (10)
- The problem of determinacy of infinite games from an intuitionistic point of view
- Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves
- Small model property reflects in games and automata
- Weak axioms of determinacy and subsystems of analysis I: δ20 games
- Finite high-order games and an inductive approach towards Gowers's dichotomy
- A dialogical route to logical pluralism
- Answer set programming in intuitionistic logic
- The Parallel Intensionally Fully Abstract Games Model of PCF
- Dialogues, strategies, and intuitionistic provability
- Hammer for Coq: automation for dependent type theory
Uses Software
This page was built for publication: Intuitionistic games: determinacy, completeness, and normalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q332080)
