Fixed-Point Logics Martin Grohe Dissertation zur Erlangung der Doktorwurde...  Home/Search
Context
Related
| logik.mathematik.uni...grohediss.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: logik.mathematik.uni...preprints (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This dissertation would not have been possible without his considerable advice and without all the long discussions we had on almost every detail. Actually I learned a lot beyond this work (Update)
Similar documents (at the sentence level):
5.3%: Arity Hierarchies - Grohe (1996) (Correct)
Active bibliography (related documents): More All
0.7: Hierarchies in Transitive Closure Logic, Stratified Datalog.. - Grädel, McColm (1994) (Correct)
0.6: On the Expressive Power of Counting - Grumbach, Tollu (1994) (Correct)
0.5: Hierarchies in Classes of Program Schemes - Arratia-Quesada, Chauhan, Stewart (1999) (Correct)
Similar documents based on text: More All
0.3: Search for the H Dibaryon in ...-Nucleon Interactions - Albertson (1993) (Correct)
0.3: Weak Autoepistemic Reasoning - A Study in Autoepistemic.. - Kalinski (1994) (Correct)
0.3: Easy Instances for Model Checking - Frick (2001) (Correct)
BibTeX entry: (Update)
@misc{ martin-structure,
author = "Fixed--Point Logics Martin",
title = "The Structure of",
url = "citeseer.ist.psu.edu/620735.html" }
Citations (may not include all citations):957 The Probabilistic Method (context) - Alon, Spencer - 1992
379 The complexity of relational query languages (context) - Vardi - 1982
294 Finite model theory (context) - Ebbinghaus, Flum
245 Relational queries computable in polynomial time - Immerman - 1986
211 Languages that capture complexity classes - Immerman - 1987
198 Structure and complexity of relational queries - Chandra, Harel - 1982
124 Datalog extensions for database queries and updates (context) - Abiteboul, Vianu - 1991
120 Elementary Induction on Abstract Structures (context) - Moschovakis - 1974
114 Generic computation and its complexity (context) - Abiteboul, Vianu - 1991
95 Fixed point extensions of first--order logic (context) - Gurevich, Shelah - 1986
82 Sigma 1 -formulae on finite structures (context) - Ajtai - 1983
81 Mathematical Logic (context) - Ebbinghaus, Flum et al. - 1994
81 Probabilities on finite models (context) - Fagin - 1976
63 Toward logic tailored for computational complexity - Gurevich - 1984
49 Range and degree of realizability of formulas in the restric.. (context) - Glebskii, Kogan et al. - 1969
36 Number of quantifiers is better than number of tape cells (context) - Immerman - 1981
35 The expressive power of stratified logic programs (context) - Kolaitis - 1991
31 laws in logic and combinatorics (context) - Compton - 1988
30 Extended logics: The general framework (context) - Ebbinghaus - 1985
24 Graph theory and probability (context) - Erdos - 1959
21 Logical hierarchies in PTIME (context) - Hella - 1992
20 Implicit definability on finite structures and unambiguous c.. (context) - Kolaitis - 1990
20 Definability hierarchies of generalized quantifiers (context) - Hella - 1989
19 Expressiveness of restricted recursive queries (context) - Afrati, Cosmadakis - 1989
13 Using the hamiltonian path operator to capture NP (context) - Stewart - 1992
13 Extending partial isomorphisms of graphs (context) - Hrushovski - 1992
12 Existential fixed-point logic (context) - Blass, Gurevich - 1987
8 first--order logic (context) - Ajtai, Gurevich - 1989
8 On transitive closure logic (context) - Gradel - 1991
7 Oracles and quantifiers - Makowsky, Pnueli - 1993
5 Skolem normal forms concerning the least fixed point (context) - Dahlhaus - 1987
4 stratified datalog and infinitary logic (context) - Gradel, McColm et al. - 1992
4 Deterministic versus nondeterministic transitive closure log.. (context) - Gradel, McColm - 1992
3 Fixpoint logic vs generalized quantifiers (context) - Hella - 1994
3 Zeitschrift fur mathematische Logik und Grundlagen der Mathe.. (context) - Lov'asz, G'acs et al. - 1977
3 Ehrenfeucht-Fraiss'e Game (context) - Bosse - 1992
3 Fixpunktlogiken in der endlichen Modelltheorie (context) - Grohe - 1992
2 Bounded arity hierarchies in fixed--point logics (context) - Grohe - 1993
2 Expressibility of bounded arity fixedpoint queries (context) - Dublish, Maheshwari - 1989
1 The arity problem for fixed point logic -- a complexity theo.. (context) - Imhof - 1994
1 Asymptotic laws in combinatorics (context) - Oberschelp - 1982
1 Extending partial isomorphisms (context) - Herwig - 1993
1 The Ehrenfeucht-Fraiss'e game for transitive closure (context) - Calo, Makowsky - 1992
Documents on the same site (http://logik.mathematik.uni-freiburg.de/preprints.html): More
On the (infinite) Model Theory of Fixed-Point Logics - Flum (1995) (Correct)
Enhancing Fixed Point Logic With Cardinality Quantifiers - Hella, Imhof (1996) (Correct)
Total and Partial Well-Founded Datalog Coincide - Flum, Kubierschky, Ludäscher (1997) (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