- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The complexity of satisfiability for fragments of hybrid logic—Part I
Journal of Applied Logic 8 (4):409-421 (2010)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
The complexity of hybrid logics over equivalence relations.Martin Mundhenk & Thomas Schneider - 2009 - Journal of Logic, Language and Information 18 (4):493-514.
Guarded fragments with constants.Balder ten Cate & Massimo Franceschet - 2005 - Journal of Logic 14 (3):281-288.
Complexity of hybrid logics over transitive frames.Martin Mundhenk, Thomas Schneider, Thomas Schwentick & Volker Weber - 2010 - Journal of Applied Logic 8 (4):422-440.
Branching-time logics repeatedly referring to states.Volker Weber - 2009 - Journal of Logic, Language and Information 18 (4):593-624.
The computational complexity of hybrid temporal logics.C. Areces, P. Blackburn & M. Marx - 2000 - Logic Journal of the IGPL 8 (5):653-679.
Complexity Results for Modal Dependence Logic.Peter Lohmann & Heribert Vollmer - 2013 - Studia Logica 101 (2):343-366.
Hybrid languages.Patrick Blackburn & Jerry Seligman - 1995 - Journal of Logic, Language and Information 4 (3):251-272.
Guarded fragments with constants.Balder ten Cate & Massimo Franceschet - 2005 - Journal of Logic, Language and Information 14 (3):281-288.
Complexity Results of STIT Fragments.François Schwarzentruber - 2012 - Studia Logica 100 (5):1001-1045.
On the computational complexity of the numerically definite syllogistic and related logics.Ian Pratt-Hartmann - 2008 - Bulletin of Symbolic Logic 14 (1):1-28.
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.
On the restraining power of guards.Erich Grädel - 1999 - Journal of Symbolic Logic 64 (4):1719-1742.
Fragments of language.Ian Pratt-Hartmann - 2004 - Journal of Logic, Language and Information 13 (2):207-223.
On the Relations Between Discrete and Continuous Complexity Theory.Klaus Meer - 1995 - Mathematical Logic Quarterly 41 (2):281-286.
Decidable fragments of first-order modal logics.Frank Wolter & Michael Zakharyaschev - 2001 - Journal of Symbolic Logic 66 (3):1415-1438.
Analytics
Added to PP
2016-06-30
Downloads
17 (#862,403)
6 months
7 (#419,635)
2016-06-30
Downloads
17 (#862,403)
6 months
7 (#419,635)
Historical graph of downloads
Citations of this work
The expressibility of fragments of Hybrid Graph Logic on finite digraphs.James Gate & Iain A. Stewart - 2013 - Journal of Applied Logic 11 (3):272-288.
References found in this work
The two-valued iterative systems of mathematical logic.Emil Leon Post - 1941 - London,: H. Milford, Oxford university press.
Hybrid languages.Patrick Blackburn & Jerry Seligman - 1995 - Journal of Logic, Language and Information 4 (3):251-272.
Representation, reasoning, and relational structures: a hybrid logic manifesto.P. Blackburn - 2000 - Logic Journal of the IGPL 8 (3):339-365.
Hierarchies of modal and temporal logics with reference pointers.Valentin Goranko - 1996 - Journal of Logic, Language and Information 5 (1):1-24.
The computational complexity of hybrid temporal logics.C. Areces, P. Blackburn & M. Marx - 2000 - Logic Journal of the IGPL 8 (5):653-679.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-55b469568f-cdf2d uwo