- 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 expressibility of fragments of Hybrid Graph Logic on finite digraphs
Journal of Applied Logic 11 (3):272-288 (2013)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Monotonicity and the Expressibility of NP Operators.Iain A. Stewart - 1994 - Mathematical Logic Quarterly 40 (1):132-140.
Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable.Valentin Shehtman - 1990 - Studia Logica 49 (3):365 - 385.
Guarded fragments with constants.Balder ten Cate & Massimo Franceschet - 2005 - Journal of Logic 14 (3):281-288.
Hybrid Identities and Hybrid Equational Logic.Klaus Denecke - 1995 - Mathematical Logic Quarterly 41 (2):190-196.
Generalized quantifiers and pebble games on finite structures.Phokion G. Kolaitis & Jouko A. Väänänen - 1995 - Annals of Pure and Applied Logic 74 (1):23-75.
How to define a linear order on finite models.Lauri Hella, Phokion G. Kolaitis & Kerkko Luosto - 1997 - Annals of Pure and Applied Logic 87 (3):241-267.
Notions of locality and their logical characterizations over finite models.Lauri Hella, Leonid Libkin & Juha Nurmonen - 1999 - Journal of Symbolic Logic 64 (4):1751-1773.
Hybrid logics of separation axioms.Dmitry Sustretov - 2009 - Journal of Logic, Language and Information 18 (4):541-558.
Hybrid languages.Patrick Blackburn & Jerry Seligman - 1995 - Journal of Logic, Language and Information 4 (3):251-272.
Omitting types for finite variable fragments and complete representations of algebras.Hajnal Andréka, István Németi & Tarek Sayed Ahmed - 2008 - Journal of Symbolic Logic 73 (1):65-89.
The dimension of the negation of transitive closure.Gregory L. McColm - 1995 - Journal of Symbolic Logic 60 (2):392-414.
Analytics
Added to PP
2016-06-30
Downloads
11 (#1,113,583)
6 months
4 (#800,606)
2016-06-30
Downloads
11 (#1,113,583)
6 months
4 (#800,606)
Historical graph of downloads
References found in this work
Hybrid Logics: Characterization, Interpolation and Complexity.Carlos Areces, Patrick Blackburn & Maarten Marx - 2001 - Journal of Symbolic Logic 66 (3):977-1010.
The computational complexity of hybrid temporal logics.C. Areces, P. Blackburn & M. Marx - 2000 - Logic Journal of the IGPL 8 (5):653-679.
The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic.Joseph Y. Halpern - 1995 - Artificial Intelligence 75 (2):361-372.
Model checking hybrid logics.Massimo Franceschet & Maarten de Rijke - 2006 - Journal of Applied Logic 4 (3):279-304.
Using modal logics to express and check global graph properties.Mario Benevides & L. Schechter - 2009 - Logic Journal of the IGPL 17 (5):559-587.
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-7c76586df8-pp8v9 uwo