On theTractability of Comparing Informational Structures

, &
In J. van Eijck & R. Verbrugge (eds.), Proceedings of the Workshop 'Reasoning about other minds: Logical and cognitive perspectives (2011)
  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,349

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

The Computational Complexity of Quantified Reciprocals.Jakub Szymanik - 2009 - In Peter Bosch, David Gabelaia & Jérôme Lang (eds.), Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. Springer.
Computational complexity of some Ramsey quantifiers in finite models.Marcin Mostowski & Jakub Szymanik - 2007 - Bulletin of Symbolic Logic 13:281--282.
Against digital ontology.Luciano Floridi - 2009 - Synthese 168 (1):151 - 178.
On computational complexity in weakly admissible structures.Viggo Stoltenberg-Hansen - 1980 - Journal of Symbolic Logic 45 (2):353-358.
Epistemic modals and informational consequence.Moritz Schulz - 2010 - Synthese 174 (3):385 - 395.
Epistemic virtues, metavirtues, and computational complexity.Adam Morton - 2004 - Noûs 38 (3):481–502.
Coherence and Computational Complexity of Quantifier-free Dependence Logic Formulas.Jarmo Kontinen - 2013 - Studia Logica 101 (2):267-291.
Epistemic Virtues, Metavirtues, and Computational Complexity.Professor Adam Morton - 2004 - Noûs 38 (3):481-502.
Finite identification from the viewpoint of epistemic update.Cédric Dégremont & Nina Gierasimczuk - 2011 - Information And Computation 209 (3):383-396.
Some Computationalconstraints In Epistemic Logic.Timothy Williamson - 2004 - In S. Rahman (ed.), Logic, Epistemology, and the Unity of Science. Dordrecht: Kluwer Academic Publishers. pp. 437--456.
Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.
Logic in Cognitive Science: Bridging the Gap between Symbolic and Connectionist Paradigms.Alistair Isaac & Jakub Szymanik - 2010 - Journal of the Indian Council of Philosophical Research (2):279-309.
A modal perspective on the computational complexity of attribute value grammar.Patrick Blackburn & Edith Spaan - 1993 - Journal of Logic, Language and Information 2 (2):129-169.
Complexity and postmodernism: understanding complex systems.Paul Cilliers - 1998 - New York: Routledge.

Analytics

Added to PP
2011-10-07

Downloads
54 (#288,506)

6 months
2 (#1,263,261)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jakub Szymanik
University of Amsterdam

Citations of this work

Dynamics of lying.Hans van Ditmarsch - 2014 - Synthese 191 (5):1-33.

Add more citations

References found in this work

Logics for the relational syllogistic.Ian Pratt-Hartmann & Lawrence S. Moss - 2009 - Review of Symbolic Logic 2 (4):647-683.
The Tree of Knowledge in Action: Towards a Common Perspective.Johan van Benthem & Eric Pacuit - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 87-106.
Undecidablity for arbitrary public announcement logic.Tim French & Hans van Dirmarsch - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 23-42.

Add more references