(Enter summary)
Abstract: Guarded fragments of first-order logic were recently introduced by Andr'eka, van Benthem and N'emeti; they consist of relational first-order formulae whose quantifiers are appropriately relativized by atoms. These fragments are interesting because they extend in a natural way many propositional modal logics, because they have useful model-theoretic properties and especially because they are decidable classes that avoid the usual syntactic restrictions (on the arity of relation symbols, the... (Update)
Cited by: More
Fragments of Language - Ian Pratt-Hartmann Department
(Correct)
Modal Logics with Existential Modality, Finite-iteration.. - Shkatov (2005)
(Correct)
Resolution-Based Methods for Modal Logics - De Nivelle, Schmidt, Hustadt (2000)
(Correct)
Active bibliography (related documents): More All
1.7: Undecidability Results on Two-Variable Logics - Grädel, Otto, Rosen (1998)
(Correct)
1.1: Guarded Fragments of First-Order Logic: A Perspective for New.. - Grädel (1998)
(Correct)
1.0: Why Are Modal Logics So Robustly Decidable? - Grädel (1999)
(Correct)
Similar documents based on text: More All
1.2: Deciding the Guarded Fragments by Resolution - de Nivelle, de Rijke (2000)
(Correct)
0.5: Finite Model Theory and Descriptive Complexity - Grädel (2002)
(Correct)
0.4: Reasoning about Guarded Formulae - Georgieva
(Correct)
Related documents from co-citation: More All
15: A superposition decision procedure for the guarded fragment with equality
- Ganzinger, de Nivelle - 1999
12: Guarded xed point logic (context) - adel, Walukiewicz - 1999
12: The two-variable guarded fragment with transitive relations
- Ganzinger, Meyer et al. - 1999
BibTeX entry: (Update)
E. Gradel. On the restraining power of guards. Journal of Symbolic Logic, 64(4):1719-1742, 1999. http://citeseer.ist.psu.edu/gr98restraining.html More
@misc{ gr99restraining,
author = "Erich Gr{\"a}del",
title = "the restraining power of guards",
text = "E. Gradel. On the restraining power of guards. Journal of Symbolic Logic,
64(4):1719-1742, 1999.",
year = "1999",
url = "citeseer.ist.psu.edu/gr98restraining.html" }
Citations (may not include all citations):
130
The computational complexity of provability in systems of mo.. (context) - Ladner - 1977
68
Why is modal logic so robustly decidable
- Vardi - 1997
58
The undecidability of the domino problem (context) - Berger - 1966
43
Structural Complexity II (context) - Balc'azar, D'iaz et al. - 1990
42
Modal Languages and Bounded Fragments of Predicate Logic (context) - Andr'eka, van Benthem et al. - 1996
42
On languages with two variables (context) - Mortimer - 1975
38
Exploring Logical Dynamics (context) - van Benthem - 1996
27
Recurring dominoes: Making the highly undecidable highly und.. (context) - Harel - 1985
20
The Classical Decision Problem (context) - orger, adel et al. - 1997
19
Tree width and tangles: A new connectivity measure and some .. (context) - Reed - 1997
14
Definability and descriptive complexity on databases of boun..
- Grohe, no
11
the decision problem for two-variable first-order logic (context) - adel, Kolaitis et al. - 1997
9
Finite algebras of relations are representable on finite set.. (context) - Andr'eka, Hodkinson et al. - 1996
9
Extending partial isomorphisms on finite structures (context) - Herwig - 1995
8
ILLC Research Report (context) - van Benthem, bits - 1997
8
Remarks on Berger's paper on the domino problem (context) - Gurevich, Koryakov - 1972
7
Extending partial isomorphisms for the small index property ..
- Herwig
7
with applications to high undecidability (context) - on, trees - 1986
6
Reasoning in description logics (context) - Donnini, Lenzerini et al. - 1996
5
Undecidability results on Two-variable logics (context) - adel, Otto et al. - 1997
4
to appear in Theoretical Computer Science (context) - adel, Otto et al.
4
On recursive separability (context) - Trakhtenbrot - 1953
3
On preservation theorems for two-variable logic (context) - adel, Rosen
3
Modal Logic an Classical Logic (context) - van Benthem - 1983
2
Dominoes and the complexity of subclasses of logical theorie.. (context) - adel - 1989
2
Entscheidungsproblem reduced to the 898 case (context) - Kahr, Moore et al. - 1962
1
Extending partial isomorphisms of graphs (context) - Hrushowski - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-i7.informatik.rwth-aachen.de/WWW/Publications/publicationsAll.html): More
Guarded Fragments of First-Order Logic: A Perspective for New.. - Grädel (1998)
(Correct)
On Logics with Two Variables - Grädel, Otto (1999)
(Correct)
Eliminating Recursion in the µ-Calculus - Otto (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC