What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
accepts arity assume atomic formulas axiomatizable axioms binary relation cardinality class of finite class of ordered class of structures clause complexity class complexity theory configuration contains Corollary corresponding DATALOG definition denote deterministic digraph duplicator wins effectively strongly captures example Exercise existential expressive power finite model finite structures first-order formula first-order logic first-order sentence fixed-point logic FO(DTC FO(LFP FO(LFP)-formula following are equivalent free variables given hence I-DATALOG input tapes intentional symbols isomorphism type Lemma length lexicographic ordering LFP operator log space-bounded LOGSPACE logspace reductions model theory monotone natural numbers nontrivial obtained oracle machine oracle tapes ordered structures partial isomorphism polynomial positive Pow(A preceding proof Proposition PSPACE quantifier rank quantifier-free r-structures regular expressions relation symbol satisfies second-order logic sequence spoiler Str[r strongly captures PTIME subformula subset Suppose Theorem totally defined transitive closure tuples Turing machine unary vocabulary
Page 344 - Society, 1989. [Kol90] Ph. G. Kolaitis. Implicit definability on finite structures and unambiguous computations. In Proc. 5th IEEE Symp. on Logic in Computer Science, pages 168-180, 1990.
Page 346 - L. Pacholski and W. Szwast, The 0-1 law fails for the class of existential second-order Godel sentences with equality, Proc.
Page 344 - December 1977. [Imm88] N. Immerman. Nondeterministic space is closed under complement. SIAM Journal ' on Computing, 17:935-938, 1988.
From Google Scholar
EVGENY DANTSIN, THOMAS EITER, GEORG GOTTLOB, ANDREI VORONKOV - 2001 - ACM Computing Surveys
B Courcelle, JA Makowsky, U Rotics - 2000 - Theory of Computing Systems
MICHAEL BENEDIKT, GUOZHU DONG, LEONID LIBKIN, LIMSOON WONG - 1998 - Journal of the ACM
All Scholar search results »
Achim Blumensath, Erich Grädel, RWTH Aachen
JSTOR: Finite Model Theory.
3 Finite Model Theory and Descriptive Complexity
A Finite Model Theory for Biological Hypotheses
CIDEC Library: Ebbinghaus * Finite Model Theory
Finite Model Theory on Tame Classes of Structures
Zentralblatt MATH Database 1931 – 2008 0841.03014
Math 512: Finite Model Theory
Preservation Theorems in Finite Model Theory - Rosen, Weinstein ...
avaxhome -> ebooks -> Science -> Mathematics -> Finite Model Theory
FINITE MODEL THEORY (Perspectives in Mathematical Logic) By Heinz ...