Degrees of indeterminacy of games

DOI10.4064/FM-77-2-151-166MaRDI QIDQ5643819zbMATH OpenOpenAlexFDO

Authors Andreas Blass

Publication date 1972

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/214483

Mathematics Subject Classification ID

2-person games (91A05)

Cited in

(16)

• Many concepts and two logics of algorithmic reduction
• Modelling simultaneous games in dynamic logic
• A game semantics for linear logic
• Introduction to computability logic
• The intuitionistic fragment of computability logic at the propositional level
• Build your own clarithmetic. I: Setup and completeness
• Separating the basic logics of the basic recurrences
• On the symmetry of sequentiality
• Toggling operators in computability logic
• Resource modalities in tensor logic
• The variable hierarchy for the games -calculus
• Introduction to clarithmetic. I
• A propositional cirquent calculus for computability logic.
• Thoughts on sub-Turing interactive computability
• On abstract resource semantics and computability logic
• Sequential operators in computability logic

This page was built for publication: Degrees of indeterminacy of games

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