The strategic balance of games in logic

DOI10.1007/978-3-031-24117-8_20MaRDI QIDQ6612796

Jouko Väänänen

Publication date: 1 October 2024

zbMATH Keywords

Ehrenfeucht-Fraisse gameevaluation gamegame theoretic semanticsmodel-existence game

Mathematics Subject Classification ID

Quantum computation (81P68) Logic in computer science (03B70) Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinitary logics and 0-1 laws
• An application of games to the completeness problem for formalized theories
• The complexity of homomorphism and constraint satisfaction problems seen from the other side
• Countable approximations and Löwenheim-Skolem theorems
• The Size of a Formula as a Measure of Complexity
• Logic with the quantifier “there exist uncountably many”
• On the model theory of denumerably long formulas with finite strings of quantifiers
• A UNIFYING PRINCIPAL IN QUANTIFICATION THEORY
• Completeness in the theory of types

This page was built for publication: The strategic balance of games in logic