17 found
Order:
  1.  10
    Dependence and Independence.Erich Grädel & Jouko Väänänen - 2013 - Studia Logica 101 (2):399-410.
    We introduce an atomic formula ${\vec{y} \bot_{\vec{x}}\vec{z}}$ intuitively saying that the variables ${\vec{y}}$ are independent from the variables ${\vec{z}}$ if the variables ${\vec{x}}$ are kept constant. We contrast this with dependence logic ${\mathcal{D}}$ based on the atomic formula = ${(\vec{x}, \vec{y})}$ , actually equivalent to ${\vec{y} \bot_{\vec{x}}\vec{y}}$ , saying that the variables ${\vec{y}}$ are totally determined by the variables ${\vec{x}}$ . We show that ${\vec{y} \bot_{\vec{x}}\vec{z}}$ gives rise to a natural logic capable of formalizing basic intuitions about independence and dependence. (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   13 citations  
  2. On the Restraining Power of Guards.Erich Grädel - 1999 - Journal of Symbolic Logic 64 (4):1719-1742.
    Guarded fragments of first-order logic were recently introduced by Andreka, van Benthem and Nemeti; 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 quantifier pattern or the number of variables) of almost all other known decidable (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   14 citations  
  3.  26
    On the Decision Problem for Two-Variable First-Order Logic.Erich Grädel, Phokion G. Kolaitis & Moshe Y. Vardi - 1997 - Bulletin of Symbolic Logic 3 (1):53-69.
    We identify the computational complexity of the satisfiability problem for FO 2 , the fragment of first-order logic consisting of all relational first-order sentences with at most two distinct variables. Although this fragment was shown to be decidable a long time ago, the computational complexity of its decision problem has not been pinpointed so far. In 1975 Mortimer proved that FO 2 has the finite-model property, which means that if an FO 2 -sentence is satisfiable, then it has a finite (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   15 citations  
  4.  4
    Undecidability Results on Two-Variable Logics.Erich Grädel, Martin Otto & Eric Rosen - 1999 - Archive for Mathematical Logic 38 (4-5):313-354.
    It is a classical result of Mortimer that $L^2$ , first-order logic with two variables, is decidable for satisfiability. We show that going beyond $L^2$ by adding any one of the following leads to an undecidable logic:– very weak forms of recursion, viz.¶(i) transitive closure operations¶(ii) (restricted) monadic fixed-point operations¶– weak access to cardinalities, through the Härtig (or equicardinality) quantifier¶– a choice construct known as Hilbert's $\epsilon$ -operator.In fact all these extensions of $L^2$ prove to be undecidable both for satisfiability, (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  5. On Preservation Theorems for Two-Variable Logic.Erich Gradel & Eric Rosen - 1999 - Mathematical Logic Quarterly 45 (3):315-325.
    We show that the existential preservation theorem fails for two-variable first-order logic FO2. It is known that for all k ≥ 3, FOk does not have an existential preservation theorem, so this settles the last open case, answering a question of Andreka, van Benthem, and Németi. In contrast, we prove that the homomorphism preservation theorem holds for FO2.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  6. Dominoes and the Complexity of Subclasses of Logical Theories.Erich Grädel - 1989 - Annals of Pure and Applied Logic 43 (1):1-30.
  7.  7
    Satisfiability of Formulae with One ∀ is Decidable in Exponential Time.Erich Grädel - 1990 - Archive for Mathematical Logic 29 (4):265-276.
    In first order logic without equality, but with arbitrary relations and functions the ∃*∀∃* class is the unique maximal solvable prefix class. We show that the satisfiability problem for this class is decidable in deterministic exponential time The result is established by a structural analysis of a particular infinite subset of the Herbrand universe and by a polynomial space bounded alternating procedure.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  8.  4
    Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic.Erich Grädel & Gregory L. McColm - 1996 - Annals of Pure and Applied Logic 77 (2):169-199.
    We establish a general hierarchy theorem for quantifier classes in the infinitary logic L∞ωωon finite structures. In particular, it is shown that no infinitary formula with bounded number of universal quantifiers can express the negation of a transitive closure.This implies the solution of several open problems in finite model theory: On finite structures, positive transitive closure logic is not closed under negation. More generally the hierarchy defined by interleaving negation and transitive closure operators is strict. This proves a conjecture of (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  9.  8
    Tailoring Recursion for Complexity.Erich Grädel & Yuri Gurevich - 1995 - Journal of Symbolic Logic 60 (3):952-969.
    We design functional algebras that characterize various complexity classes of global functions. For this purpose, classical schemata from recursion theory are tailored for capturing complexity. In particular we present a functional analog of first-order logic and describe algebras of the functions computable in nondeterministic logarithmic space, deterministic and nondeterministic polynomial time, and for the functions computable by AC 1 -circuits.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  10.  7
    Vassar College, 124 Raymond Avenue, Poughkeepsie, Ny 12604, Usa. In a Review, a Reference “Jsl Xliii 148,” for Example, Refers Either to the Publication Reviewed on Page 148 of Volume 43 of the Journal, or to the Review Itself (Which Contains Full Bibliographical Information for the Reviewed Publication). Analogously, a Reference “Bsl VII 376” Refers to the Review Beginning on Page 376 in Volume 7 of This Bulletin, Or. [REVIEW]David M. Evans, Erich Grädel, Geoffrey P. Hellman, Denis Hirschfeldt, Thomas J. Jech, Julia Knight, Michael C. Laskowski, Volker Peckhaus, Wolfram Pohlers & Sławomir Solecki - 2005 - Bulletin of Symbolic Logic 11 (1):37.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  11.  4
    Books to Asl, Box 742, Vassar College, 124 Raymond Avenue, Poughkeepsie, Ny 12604, Usa. In a Review, a Reference “Jsl Xliii 148,” for Example, Refers Either to the Publication Reviewed on Page 148 of Volume 43 of the Journal, or to the Review Itself (Which Contains Full Bibliographical Information for the Reviewed Publication). Analogously, a Reference. [REVIEW]Mirna Dzamonja, David M. Evans, Erich Grädel, Geoffrey P. Hellman, Denis Hirschfeldt, Julia Knight, Michael C. Laskowski, Roger Maddux, Volker Peckhaus & Wolfram Pohlers - 2005 - Bulletin of Symbolic Logic 11 (2).
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  12. Vassar College, 124 Raymond Avenue, Poughkeepsie, Ny 12604, Usa. In a Review, a Reference “Jsl Xliii 148,” for Example, Refers Either to the Publication Reviewed on Page 148 of Volume 43 of the Journal, or to the Review Itself (Which Contains Full Bibliographical Information for the Reviewed Publication). Analogously, a Reference “Bsl VII 376” Refers to the Review Beginning on Page 376 in Volume 7 of This Bulletin, Or. [REVIEW]Anuj Dawar Beklemishev, Mirna Dzamonja, David Evans, Erich Grädel, Denis Hirschfeldt, Hannes Leitgeb, Roger Maddux, Grigori Mints, Volker Peckhaus & Sławomir Solecki - 2008 - Bulletin of Symbolic Logic 14 (4).
     
    Export citation  
     
    My bibliography  
  13.  2
    Vassar College, 124 Raymond Avenue, Poughkeepsie, Ny 12604, Usa. In a Review, a Reference “Jsl Xliii 148,” for Example, Refers Either to the Publication Reviewed on Page 148 of Volume 43 of the Journal, or to the Review Itself (Which Contains Full Bibliographical Information for the Reviewed Publication). Analogously, a Reference “Bsl VII 376” Refers to the Review Beginning on Page 376 in Volume 7 of This Bulletin, Or. [REVIEW]John Baldwin, Lev Beklemishev, Anuj Dawar, Mirna Dzamonja, David Evans, Erich Grädel, Denis Hirschfeldt, Hannes Leitgeb, Roger Maddux & Grigori Mints - 2008 - Bulletin of Symbolic Logic 14 (1).
    Direct download  
     
    Export citation  
     
    My bibliography  
  14.  1
    9th Workshop on Logic, Language, Information and Computation (Wollic'2002).Erich Grädel - 2003 - Bulletin of Symbolic Logic 9 (1):941-949.
  15. Clermont-Ferrand, France, July 21–30, 1994.Sanjeev Arora, Matthias Baaz, Lenore Blum, Patrick Dehornoy, Solomon Feferman, Moti Gitik, Erich Grädel, Yuri Gurevich, Serge Grigorieff & David Harel - 1995 - Bulletin of Symbolic Logic 1 (2).
  16. The Bulletin of Symbolic Logic Volume 11, Number 2, June 2005.Mirna Dzamonja, David M. Evans, Erich Gradel, Geoffrey P. Hellman, Denis Hirschfeldt, Julia Knight, Michael C. Laskowski, Roger Maddux, Volker Peckhaus & Wolfram Pohlers - 2005 - Bulletin of Symbolic Logic 11 (2).
  17.  11
    Finite Model Theory and its Applications.Erich Grädel, Phokion Kolaitis, Libkin G., Marx Leonid, Spencer Maarten, Vardi Joel, Y. Moshe, Yde Venema & Scott Weinstein - 2007 - Springer.
    This book gives a comprehensive overview of central themes of finite model theory – expressive power, descriptive complexity, and zero-one laws – together with selected applications relating to database theory and artificial intelligence, especially constraint databases and constraint satisfaction problems. The final chapter provides a concise modern introduction to modal logic, emphasizing the continuity in spirit and technique with finite model theory. This underlying spirit involves the use of various fragments of and hierarchies within first-order, second-order, fixed-point, and infinitary logics (...)
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography