default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErich Grädel
Person information
- affiliation: RWTH Aachen University
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j47]Erich Grädel, Niels Lücking, Matthias Naaf:
Semiring Provenance for B\"uchi Games: Strategy Analysis with Absorptive Polynomials. Log. Methods Comput. Sci. 20(1) (2024)- [c77]Sophie Brinke, Erich Grädel, Lovro Mrkonjic, Matthias Naaf:
Semiring Provenance in the Infinite. Tannen's Festschrift 2024: 3:1-3:26 - [c76]Sophie Brinke, Erich Grädel, Lovro Mrkonjic:
Ehrenfeucht-Fraïssé Games in Semiring Semantics. CSL 2024: 19:1-19:22 - 2023
- [j46]Anuj Dawar
, Erich Grädel, Moritz Lichter:
Limitations of the invertible-map equivalences. J. Log. Comput. 33(5): 961-969 (2023) - [c75]Clotilde Bizière, Erich Grädel, Matthias Naaf:
Locality Theorems in Semiring Semantics. MFCS 2023: 20:1-20:15 - [i22]Clotilde Bizière, Erich Grädel, Matthias Naaf:
Locality Theorems in Semiring Semantics. CoRR abs/2303.12627 (2023) - [i21]Sophie Brinke, Erich Grädel, Lovro Mrkonjic:
Ehrenfeucht-Fraïssé Games in Semiring Semantics. CoRR abs/2308.04910 (2023) - 2022
- [j45]Darion Haase, Erich Grädel, Richard Wilke:
Separation logic and logics with team semantics. Ann. Pure Appl. Log. 173(10): 103063 (2022) - [j44]Rafael Albert, Erich Grädel:
Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence. Ann. Pure Appl. Log. 173(10): 103088 (2022) - [j43]Erich Grädel, Richard Wilke:
Logics with Multiteam Semantics. ACM Trans. Comput. Log. 23(2): 13:1-13:30 (2022) - [c74]Erich Grädel, Hayyan Helal, Matthias Naaf, Richard Wilke:
Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics. LICS 2022: 41:1-41:12 - [i20]Erich Grädel, Hayyan Helal, Matthias Naaf, Richard Wilke:
Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics. CoRR abs/2203.03425 (2022) - [i19]Erich Grädel, Phokion G. Kolaitis, Marc Noy:
Logic and Random Discrete Structures (Dagstuhl Seminar 22061). Dagstuhl Reports 12(2): 1-16 (2022) - 2021
- [j42]Erich Grädel, Phil Pützstück:
Logics of dependence and independence: The local variants. J. Log. Comput. 31(7): 1690-1715 (2021) - [c73]Katrin M. Dannert, Erich Grädel, Matthias Naaf, Val Tannen:
Semiring Provenance for Fixed-Point Logic. CSL 2021: 17:1-17:22 - [c72]Erich Grädel, Lovro Mrkonjic:
Elementary Equivalence Versus Isomorphism in Semiring Semantics. ICALP 2021: 133:1-133:20 - [c71]Erich Grädel, Niels Lücking, Matthias Naaf:
Semiring Provenance for Büchi Games: Strategy Analysis with Absorptive Polynomials. GandALF 2021: 67-82 - [i18]Erich Grädel, Lovro Mrkonjic:
Elementary equivalence versus isomorphism in semiring semantics. CoRR abs/2102.05473 (2021) - [i17]Erich Grädel, Phil Pützstück:
Logics of Dependence and Independence: The Local Variants. CoRR abs/2102.10368 (2021) - [i16]Rafael Albert, Erich Grädel:
Unifying Hidden-Variable Problems from Quantum Mechanics by Logics of Dependence and Independence. CoRR abs/2102.10931 (2021) - [i15]Erich Grädel, Niels Lücking, Matthias Naaf:
Semiring Provenance for Büchi Games: Strategy Analysis with Absorptive Polynomials. CoRR abs/2106.12892 (2021) - [i14]Anuj Dawar, Erich Grädel, Moritz Lichter:
Limitations of the Invertible-Map Equivalences. CoRR abs/2109.07218 (2021) - 2020
- [c70]Anuj Dawar, Erich Grädel, Matthias Hoelzel:
Convergence and Nonconvergence Laws for Random Expansions of Product Structures. Fields of Logic and Computation III 2020: 118-132 - [c69]Erich Grädel, Martin Otto:
Guarded Teams: The Horizontally Guarded Case. CSL 2020: 22:1-22:17 - [c68]Erich Grädel:
Automatic Structures: Twenty Years Later. LICS 2020: 21-34 - [i13]Erich Grädel, Richard Wilke:
Logics with Multiteam Semantics. CoRR abs/2011.09834 (2020)
2010 – 2019
- 2019
- [j41]Erich Grädel, Wied Pakusa:
Rank Logic is dead, Long Live Rank Logic! J. Symb. Log. 84(1): 54-87 (2019) - [j40]Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa:
A Finite-Model-Theoretic View on Propositional Proof Complexity. Log. Methods Comput. Sci. 15(1) (2019) - [c67]Katrin M. Dannert, Erich Grädel:
Provenance Analysis: A Perspective for Description Logics? Description Logic, Theory Combination, and All That 2019: 266-285 - [c66]Anuj Dawar, Erich Grädel, Wied Pakusa:
Approximations of Isomorphism and Logics with Linear-Algebraic Operators. ICALP 2019: 112:1-112:14 - [c65]Erich Grädel, Svenja Schalthöfer:
Choiceless Logarithmic Space. MFCS 2019: 31:1-31:15 - [i12]Anuj Dawar, Erich Grädel, Wied Pakusa:
Approximations of Isomorphism and Logics with Linear-Algebraic Operators. CoRR abs/1902.06648 (2019) - [i11]Erich Grädel, Val Tannen:
Provenance Analysis for Logic and Games. CoRR abs/1907.08470 (2019) - [i10]Katrin M. Dannert, Erich Grädel, Matthias Naaf, Val Tannen:
Generalized Absorptive Polynomials and Provenance Semantics for Fixed-Point Logic. CoRR abs/1910.07910 (2019) - [i9]Erich Grädel, Phokion G. Kolaitis, Juha Kontinen, Heribert Vollmer:
Logics for Dependence and Independence (Dagstuhl Seminar 19031). Dagstuhl Reports 9(1): 28-46 (2019) - 2018
- [c64]Erich Grädel, Matthias Hoelzel:
Dependency Concepts up to Equivalence. CSL 2018: 25:1-25:21 - [e5]Anuj Dawar, Erich Grädel:
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018. ACM 2018 [contents] - [i8]Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa:
A Finite-Model-Theoretic View on Propositional Proof Complexity. CoRR abs/1802.09377 (2018) - 2017
- [c63]Erich Grädel, Benedikt Pago, Wied Pakusa:
The Model-Theoretic Expressiveness of Propositional Proof Systems. CSL 2017: 27:1-27:18 - [c62]Faried Abu Zaid, Erich Grädel, Frederic Reinhardt:
Advice Automatic Structures and Uniformly Automatic Classes. CSL 2017: 35:1-35:20 - [c61]Faried Abu Zaid, Anuj Dawar, Erich Grädel, Wied Pakusa:
Definability of summation problems for Abelian groups and semigroups. LICS 2017: 1-11 - [i7]Erich Grädel, Val Tannen:
Semiring Provenance for First-Order Model Checking. CoRR abs/1712.01980 (2017) - [i6]Anuj Dawar, Erich Grädel, Phokion G. Kolaitis, Thomas Schwentick:
Finite and Algorithmic Model Theory (Dagstuhl Seminar 17361). Dagstuhl Reports 7(9): 1-25 (2017) - 2016
- [c60]Erich Grädel, Stefan Hegselmann:
Counting in Team Semantics. CSL 2016: 35:1-35:18 - [p5]Erich Grädel:
Games for Inclusion Logic and Fixed-Point Logic. Dependence Logic 2016: 73-98 - 2015
- [c59]Erich Grädel, Martin Grohe:
Is Polynomial Time Choiceless? Fields of Logic and Computation II 2015: 193-209 - [c58]Erich Grädel, Wied Pakusa:
Rank Logic is Dead, Long Live Rank Logic!. CSL 2015: 390-404 - [c57]Felix Canavoi, Erich Grädel, Simon Leßenich, Wied Pakusa:
Defining Winning Strategies in Fixed-Point Logic. LICS 2015: 366-377 - [c56]Erich Grädel, Wied Pakusa, Svenja Schalthöfer, Lukasz Kaiser:
Characterising Choiceless Polynomial Time with First-Order Interpretations. LICS 2015: 677-688 - [i5]Erich Grädel, Wied Pakusa:
Rank logic is dead, long live rank logic! CoRR abs/1503.05423 (2015) - [i4]Erich Grädel, Juha Kontinen, Jouko Väänänen, Heribert Vollmer:
Logics for Dependence and Independence (Dagstuhl Seminar 15261). Dagstuhl Reports 5(6): 70-85 (2015) - 2014
- [j39]Faried Abu Zaid, Erich Grädel, Lukasz Kaiser, Wied Pakusa:
Model-Theoretic Properties of ω-Automatic Structures. Theory Comput. Syst. 55(4): 856-880 (2014) - [j38]Felix Canavoi, Erich Grädel, Roman Rabinovich:
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs. Theor. Comput. Sci. 560: 235-250 (2014) - [c55]Faried Abu Zaid, Erich Grädel, Stephan Jaax:
Bisimulation Safe Fixed Point Logic. Advances in Modal Logic 2014: 1-15 - [c54]Faried Abu Zaid, Erich Grädel, Martin Grohe, Wied Pakusa:
Choiceless Polynomial Time on Structures with Small Abelian Colour Classes. MFCS (1) 2014: 50-62 - [p4]Erich Grädel, Martin Otto:
The Freedoms of (Guarded) Bisimulation. Johan van Benthem on Logic and Information Dynamics 2014: 3-31 - 2013
- [j37]Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa:
Definability of linear equation systems over groups and rings. Log. Methods Comput. Sci. 9(4) (2013) - [j36]Erich Grädel, Jouko A. Väänänen:
Dependence and Independence. Stud Logica 101(2): 399-410 (2013) - [j35]Erich Grädel:
Model-checking games for logics of imperfect information. Theor. Comput. Sci. 493: 2-14 (2013) - 2012
- [j34]Dietmar Berwanger, Erich Grädel, Lukasz Kaiser, Roman Rabinovich:
Entanglement and the complexity of directed graphs. Theor. Comput. Sci. 463: 2-25 (2012) - [c53]Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa:
Definability of linear equation systems over groups and rings. CSL 2012: 213-227 - [c52]Erich Grädel, Simon Leßenich:
Banach-Mazur Games with Simple Winning Strategies. CSL 2012: 305-319 - [c51]Erich Grädel, Sebastian Siebertz:
Dynamic definability. ICDT 2012: 236-248 - [c50]Faried Abu Zaid, Erich Grädel, Lukasz Kaiser:
The Field of Reals is not omega-Automatic. STACS 2012: 577-588 - [c49]Felix Canavoi, Erich Grädel, Roman Rabinovich:
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs. GandALF 2012: 197-209 - [i3]Erich Grädel, Jouko A. Väänänen:
Dependence and Independence. CoRR abs/1208.5268 (2012) - 2011
- [p3]Vince Bárány, Erich Grädel, Sasha Rubin:
Automata-based presentations of infinite structures. Finite and Algorithmic Model Theory 2011: 1-76 - [p2]Erich Grädel:
Back and forth between logic and games. Lectures in Game Theory for Computer Scientists 2011: 99-145 - [e4]Krzysztof R. Apt, Erich Grädel:
Lectures in Game Theory for Computer Scientists. Cambridge University Press 2011, ISBN 978-0-521-19866-0 [contents] - 2010
- [j33]Anuj Dawar, Erich Grädel:
Properties of Almost All Graphs and Generalized Quantifiers. Fundam. Informaticae 98(4): 351-372 (2010) - [j32]Diana Fischer, Erich Grädel, Lukasz Kaiser:
Model Checking Games for the Quantitative µ-Calculus. Theory Comput. Syst. 47(3): 696-719 (2010) - [c48]Erich Grädel:
Definability in Games. CSL 2010: 19-21
2000 – 2009
- 2009
- [c47]Erich Grädel, Lukasz Kaiser, Roman Rabinovich:
Directed Graphs of Entanglement Two. FCT 2009: 169-180 - [e3]Erich Grädel, Reinhard Kahle:
Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings. Lecture Notes in Computer Science 5771, Springer 2009, ISBN 978-3-642-04026-9 [contents] - 2008
- [c46]Anuj Dawar, Erich Grädel:
The Descriptive Complexity of Parity Games. CSL 2008: 354-368 - [c45]Erich Grädel:
Banach-Mazur Games on Graphs. FSTTCS 2008: 364-382 - [c44]Diana Fischer, Erich Grädel, Lukasz Kaiser:
Model Checking Games for the Quantitative µ-Calculus. STACS 2008: 301-312 - [e2]Jörg Flum, Erich Grädel, Thomas Wilke:
Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. Texts in Logic and Games 2, Amsterdam University Press 2008, ISBN 978-90-5356-576-6 [contents] - [i2]Diana Fischer, Erich Grädel, Lukasz Kaiser:
Model Checking Games for the Quantitative mu-Calculus. CoRR abs/0802.2871 (2008) - 2007
- [b3]Erich Grädel, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Moshe Y. Vardi, Yde Venema, Scott Weinstein:
Finite Model Theory and Its Applications. Texts in Theoretical Computer Science. An EATCS Series, Springer 2007, ISBN 978-3-540-00428-8, pp. 1-437 - [j31]Dietmar Berwanger, Erich Grädel, Giacomo Lenzi:
The Variable Hierarchy of the µ-Calculus Is Strict. Theory Comput. Syst. 40(4): 437-466 (2007) - 2006
- [j30]Erich Grädel, Igor Walukiewicz:
Positional Determinacy of Games with Infinitely Many Priorities. Log. Methods Comput. Sci. 2(4) (2006) - [j29]Anuj Dawar, Erich Grädel, Stephan Kreutzer:
Backtracking games and inflationary fixed points. Theor. Comput. Sci. 350(2-3): 174-187 (2006) - [c43]Samson Abramsky, Erich Grädel, Johann A. Makowsky:
The Ackermann Award 2006. CSL 2006: 622-626 - [i1]Erich Grädel, Igor Walukiewicz:
Positional Determinacy of Games with Infinitely Many Priorities. CoRR abs/cs/0610035 (2006) - 2005
- [c42]Erich Grädel, Janos Makowsky, Alexander A. Razborov:
The Ackermann Award 2005. CSL 2005: 557-565 - 2004
- [j28]Achim Blumensath, Erich Grädel:
Finite Presentations of Infinite Structures: Automata and Interpretations. Theory Comput. Syst. 37(6): 641-674 (2004) - [j27]Dietmar Berwanger, Erich Grädel:
Fixed-Point Logics and Solitaire Games. Theory Comput. Syst. 37(6): 675-694 (2004) - [j26]Anuj Dawar, Erich Grädel, Stephan Kreutzer:
Inflationary fixed points in modal logic. ACM Trans. Comput. Log. 5(2): 282-315 (2004) - [c41]Anuj Dawar, Erich Grädel, Stephan Kreutzer:
Backtracking Games and Inflationary Fixed Points. ICALP 2004: 420-432 - [c40]Dietmar Berwanger, Erich Grädel:
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games. LPAR 2004: 209-223 - [c39]Erich Grädel:
Positional Determinacy of Infinite Games. STACS 2004: 4-18 - 2003
- [j25]Erich Grädel, Joseph Y. Halpern, Radha Jagadeesan, Adolfo Piperno:
LICS 2001 special issue. ACM Trans. Comput. Log. 4(3): 295 (2003) - [c38]Erich Grädel, Antje Nowack:
Quantum Computing and Abstract State Machines. Abstract State Machines 2003: 309-323 - [c37]Erich Grädel:
Inflationary and Deflationary Fixed Points (Invited Talk). FICS 2003: 37-41 - [c36]Erich Grädel, Stephan Kreutzer:
Will Deflation Lead to Depletion? On Non-Monotone Fixed Point Inductions. LICS 2003: 158- - [c35]Dietmar Berwanger, Erich Grädel, Stephan Kreutzer:
Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games. LPAR 2003: 229-243 - 2002
- [j24]Erich Grädel:
Guarded fixed point logics and the monadic theory of countable trees. Theor. Comput. Sci. 288(1): 129-152 (2002) - [j23]Georg Gottlob, Erich Grädel, Helmut Veith:
Datalog LITE: a deductive query language with linear time model checking. ACM Trans. Comput. Log. 3(1): 42-79 (2002) - [j22]Erich Grädel, Colin Hirsch, Martin Otto:
Back and forth between guarded and modal logics. ACM Trans. Comput. Log. 3(3): 418-463 (2002) - [c34]Dietmar Berwanger, Erich Grädel, Giacomo Lenzi:
On the Variable Hierarchy of the Modal µ-Calculus. CSL 2002: 352-366 - [c33]Erich Grädel:
Model Checking Games. WoLLIC 2002: 15-34 - [e1]Erich Grädel, Wolfgang Thomas, Thomas Wilke:
Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001]. Lecture Notes in Computer Science 2500, Springer 2002, ISBN 3-540-00388-6 [contents] - 2001
- [c32]Anuj Dawar, Erich Grädel, Stephan Kreutzer:
Inflationary Fixed Points in Modal Logic. CSL 2001: 277-291 - [c31]Dietmar Berwanger, Erich Grädel:
Games and Model Checking for Guarded Logics. LPAR 2001: 70-84 - [p1]Erich Grädel:
Why are Modal Logics so Robustly Decidable? Current Trends in Theoretical Computer Science 2001: 393-408 - 2000
- [c30]M.-Elisabeth Goncalves, Erich Grädel:
Decidability issues for action guarded logics. Description Logics 2000: 123-132 - [c29]Achim Blumensath, Erich Grädel:
Automatic Structures. LICS 2000: 51-62 - [c28]Erich Grädel, Colin Hirsch, Martin Otto:
Back and Forth between Guarded and Modal Logics. LICS 2000: 217-228 - [c27]Erich Grädel:
Efficient Evaluation Methods for Guarded Logics and Datalog LITE. LPAR 2000: 417
1990 – 1999
- 1999
- [j21]Erich Grädel, Anders Malmström:
0-1 laws for recursive structures. Arch. Math. Log. 38(4-5): 205-215 (1999) - [j20]Erich Grädel, Martin Otto, Eric Rosen:
Undecidability results on two-variable logics. Arch. Math. Log. 38(4-5): 313-354 (1999) - [j19]Erich Grädel:
Why are Modal Logics so Robustly Decidable? Bull. EATCS 68: 90-103 (1999) - [j18]Erich Grädel:
On The Restraining Power of Guards. J. Symb. Log. 64(4): 1719-1742 (1999) - [j17]Erich Grädel, Eric Rosen:
On Preservation Theorems for Two-Variable Logic. Math. Log. Q. 45: 315-325 (1999) - [j16]Erich Grädel, Martin Otto:
On Logics with Two Variables. Theor. Comput. Sci. 224(1-2): 73-113 (1999) - [c26]Erich Grädel:
Invited Talk: Decision procedures for guarded logics. CADE 1999: 31-51 - [c25]Erich Grädel, Stephan Kreutzer:
Descriptive Complexity Theory for Constraint Databases. CSL 1999: 67-81 - [c24]Erich Grädel, Marc Spielmann:
Logspace Reducibility via Abstract State Machines. World Congress on Formal Methods 1999: 1738-1757 - [c23]Erich Grädel, Eric Rosen:
Two-Variable Descriptions of Regularity. LICS 1999: 14-23 - [c22]Erich Grädel, Igor Walukiewicz:
Guarded Fixed Point Logic. LICS 1999: 45-54 - 1998
- [j15]Erich Grädel, Yuri Gurevich:
Metafinite Model Theory. Inf. Comput. 140(1): 26-81 (1998) - [c21]Erich Grädel:
Description Logics and Guarded Fragments of First Order Logic. Description Logics 1998 - [c20]Erich Grädel, Yuri Gurevich, Colin Hirsch:
The Complexity of Query Reliability. PODS 1998: 227-234 - 1997
- [b2]Egon Börger, Erich Grädel, Yuri Gurevich:
The Classical Decision Problem. Perspectives in Mathematical Logic, Springer 1997 - [j14]Erich Grädel, Phokion G. Kolaitis, Moshe Y. Vardi:
On the decision problem for two-variable first-order logic. Bull. Symb. Log. 3(1): 53-69 (1997) - [c19]Erich Grädel, Martin Otto, Eric Rosen:
Two-Variable Logic with Counting is Decidable. LICS 1997: 306-317 - [c18]Erich Grädel, Martin Otto, Eric Rosen:
Undecidability Results on Two-Variable Logics. STACS 1997: 249-260 - 1996
- [j13]Erich Grädel, Gregory L. McColm:
Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic. Ann. Pure Appl. Log. 77(2): 169-199 (1996) - [j12]Kevin J. Compton, Erich Grädel:
Logical Definability of Counting Functions. J. Comput. Syst. Sci. 53(2): 283-297 (1996) - 1995
- [j11]Erich Grädel, Gregory L. McColm:
On the Power of Deterministic Transitive Closures. Inf. Comput. 119(1): 129-135 (1995) - [j10]Erich Grädel, Yuri Gurevich:
Tailoring Recursion for Complexity. J. Symb. Log. 60(3): 952-969 (1995) - [c17]Anuj Dawar, Erich Grädel:
Generalized Quantifiers and 0-1 Laws. LICS 1995: 54-64 - [c16]Erich Grädel, Klaus Meer:
Descriptive complexity theory over the real numbers. STOC 1995: 315-324 - 1994
- [j9]Erich Grädel:
Definability on finite structures and the existence of one-way functions. Methods Log. Comput. Sci. 1(3): 299-314 (1994) - [c15]Kevin J. Compton, Erich Grädel:
Logical Definability of Counting Functions. SCT 1994: 255-266 - [c14]Erich Grädel, Yuri Gurevich:
Tailoring Recursing for Complexity. ICALP 1994: 118-129 - [c13]Erich Grädel, Yuri Gurevich:
Metafinite Model Theory. LCC 1994: 313-366 - 1993
- [c12]Erich Grädel, Anders Malmström:
Approximable Minimization Problems and Optimal Solutions on Random Inputs. CSL 1993: 139-149 - 1992
- [j8]Erich Grädel:
Capturing Complexity Classes by Fragments of Second-Order Logic. Theor. Comput. Sci. 101(1): 35-57 (1992) - [c11]Thomas Behrendt, Kevin J. Compton, Erich Grädel:
Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions. CSL 1992: 43-60 - [c10]Erich Grädel, Martin Otto:
Inductive Definability with Counting on Finite Structures. CSL 1992: 231-247 - [c9]Erich Grädel, Gregory L. McColm:
Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic. FOCS 1992: 167-176 - [c8]Erich Grädel, Gregory L. McColm:
Deterministic vs. Nondeterministic Transitive Closure Logic. LICS 1992: 58-63 - 1991
- [j7]Erich Grädel:
Simple Sentences That Are Hard to Decide. Inf. Comput. 94(1): 62-82 (1991) - [c7]Erich Grädel:
Capturing Complexity Classes by Fragments of Second Order Logic. SCT 1991: 341-352 - [c6]Erich Grädel:
On Transitive Closure Logic. CSL 1991: 149-163 - [c5]Erich Grädel:
The Expressive Power of Second Order Horn Logic. STACS 1991: 466-477 - 1990
- [j6]Erich Grädel:
Satisfiability of formulae with one ∀ is decidable in exponential time. Arch. Math. Log. 29(4): 265-276 (1990) - [j5]Erich Grädel:
On the Notion of Linear Time Computability. Int. J. Found. Comput. Sci. 1(3): 295-308 (1990) - [j4]Erich Grädel:
Simple Interpretations Among Complicated Theories. Inf. Process. Lett. 35(5): 235-238 (1990) - [j3]Erich Grädel:
Domino Games and Complexity. SIAM J. Comput. 19(5): 787-804 (1990)
1980 – 1989
- 1989
- [j2]Erich Grädel:
Dominoes and the Complexity of Subclasses of Logical Theories. Ann. Pure Appl. Log. 43(1): 1-30 (1989) - [c4]Erich Grädel:
On Logical Descriptions of Some Concepts in Structural Complexity Theory. CSL 1989: 163-175 - [c3]Erich Grädel:
Complexity of Formula Classes in First Order Logic with Functions. FCT 1989: 224-233 - 1988
- [j1]Erich Grädel:
Subclasses of Presburger Arithmetic and the Polynomial-Time Hierarchy. Theor. Comput. Sci. 56: 289-301 (1988) - [c2]Erich Grädel:
Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes. CSL 1988: 118-137 - [c1]Erich Grädel:
Domino Games with an Application to the Complexity of Boolean Algebras with Bounded Quantifier Alternations. STACS 1988: 98-107 - 1987
- [b1]Erich Grädel:
The complexity of subclasses of logical theories. Univ. Basel, 1987, pp. 1-67
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
