Deterministic and Nondeterministic Strategies for Hintikka games in First-order and Branching-quantifier logic

Logique Et Analyse 195:265--9 (2006)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,752

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Modelling simultaneous games in dynamic logic.Johan van Benthem, Sujata Ghosh & Fenrong Liu - 2008 - Synthese 165 (2):247-268.
Modelling Simultaneous Games in Dynamic Logic.Johan Van Benthem, Sujata Ghosh & Fenrong Liu - 2008 - Synthese 165 (2):247 - 268.
Tailoring recursion for complexity.Erich Grädel & Yuri Gurevich - 1995 - Journal of Symbolic Logic 60 (3):952-969.
Ways of branching quantifers.Gila Sher - 1990 - Linguistics and Philosophy 13 (4):393 - 422.
Fixed point logics.Anuj Dawar & Yuri Gurevich - 2002 - Bulletin of Symbolic Logic 8 (1):65-88.
Hintikka's thesis revisited.Nina Gierasimczuk & Jakub Szymanik - 2007 - Bulletin of Symbolic Logic 13:273.
Characterizing Definability of Second-Order Generalized Quantifiers.Juha Kontinen & Jakub Szymanik - 2011 - In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.
On the logic of informational independence and its applications.Gabriel Sandu - 1993 - Journal of Philosophical Logic 22 (1):29 - 60.
Which Mathematical Logic is the Logic of Mathematics?Jaakko Hintikka - 2012 - Logica Universalis 6 (3-4):459-475.
Logic, language-games and information: Kantian themes in the philosophy of logic.Jaakko Hintikka - 1973 - Oxford,: Clarendon Press.
Coherence and Computational Complexity of Quantifier-free Dependence Logic Formulas.Jarmo Kontinen - 2013 - Studia Logica 101 (2):267-291.
Information-seeking dialogues: Some of their logical properties. [REVIEW]Jaakko Hintikka & Esa Saarinen - 1979 - Studia Logica 38 (4):355 - 363.
On the definability of the quantifier “there exist uncountably many”.Žarko Mijajlović - 1985 - Studia Logica 44 (3):257 - 264.

Analytics

Added to PP
2011-03-20

Downloads
5 (#1,536,375)

6 months
1 (#1,464,097)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Thomas Forster
Cambridge University

Citations of this work

Independence friendly logic.Tero Tulenheimo - 2010 - Stanford Encyclopedia of Philosophy.

Add more citations

References found in this work

No references found.

Add more references