Find link

language:

Find link is a tool written by Edward Betts.

searching for Finite model theory 18 found (53 total)

Blum–Shub–Smale machine (654 words) [view diff] case mismatch in snippet view article find links to article

ISBN 3-540-66752-0. Zbl 0948.68082. Grädel, E. (2007). "Finite Model Theory and Descriptive Complexity". Finite Model Theory and Its Applications (PDF). Springer-Verlag

Fragment (logic) (219 words) [view diff] case mismatch in snippet view article

Heinz-Dieter; Flum, Jörg (2005), "Chapter 7. Descriptive Complexity Theory", Finite Model Theory, Perspectives in mathematical logic, Springer, pp. 119–164, ISBN 9783540287889

Heinz-Dieter Ebbinghaus (205 words) [view diff] case mismatch in snippet view article find links to article

2007, ISBN 978-3-642-08050-0. Heinz-Dieter Ebbinghaus, Jörg Flum. Finite Model Theory, 2005, ISBN 3-540-28787-6. Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang

Finite model property (245 words) [view diff] exact match in snippet view article find links to article

Decidability and the Finite Model Property. Journal of Philosophical Logic, 10 (1981), 367-370. Leonid Libkin, Elements of finite model theory, chapter 14

Fagin's theorem (599 words) [view diff] exact match in snippet view article find links to article

Spencer, Joel; Vardi, Moshe Y.; Venema, Yde; Weinstein, Scott (2007). Finite model theory and its applications. Texts in Theoretical Computer Science. An EATCS

Almost surely (1,425 words) [view diff] case mismatch in snippet view article find links to article

Spencer, Joel; Vardi, Moshe Y.; Venema, Yde; Weinstein, Scott (2007). Finite Model Theory and Its Applications. Springer. p. 232. ISBN 978-3-540-00428-8. Jacod

Pebble game (763 words) [view diff] exact match in snippet view article find links to article

Spencer, Joel; Vardi, Moshe Y.; Venema, Yde; Weinstein, Scott (2007). Finite model theory and its applications. Texts in Theoretical Computer Science. An EATCS

Quantifier elimination (1,435 words) [view diff] exact match in snippet view article find links to article

Spencer, Joel; Vardi, Moshe Y.; Venema, Yde; Weinstein, Scott (2007). Finite model theory and its applications. Texts in Theoretical Computer Science. An EATCS

E. W. Beth Dissertation Prize (136 words) [view diff] case mismatch in snippet view article find links to article

Institution 2024 Aliaume Lopez First Order Preservation Theorems in Finite Model Theory: Locality, Topology, and Limit Constructions École Normale Supérieure

Least fixed point (1,474 words) [view diff] case mismatch in snippet view article find links to article

Example 12.1, pp. 12.2–3 Immerman, Neil. Descriptive Complexity, 1999, Springer-Verlag. Libkin, Leonid. Elements of Finite Model Theory, 2004, Springer.

Almost all (2,577 words) [view diff] case mismatch in snippet view article find links to article

Joel; Vardi, Moshe Y.; Venema, Yde; Weinstein, Scott (11 June 2007). Finite Model Theory and Its Applications. Texts in Theoretical Computer Science (An EATCS

Horn-satisfiability (1,073 words) [view diff] exact match in snippet view article find links to article

Spencer, Joel; Vardi, Moshe Y.; Venema, Yde; Weinstein, Scott (2007). Finite model theory and its applications. Texts in Theoretical Computer Science. An EATCS

Michael Shub (878 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-1584885085. Grädel, Erich (2007). "Algorithmic Model Theory". Finite Model Theory and Its Applications (PDF). New York City: Springer-Verlag. p. 217

NP-intermediate (1,534 words) [view diff] exact match in snippet view article find links to article

Spencer, Joel; Vardi, Moshe Y.; Venema, Yde; Weinstein, Scott (2007). Finite model theory and its applications. Texts in Theoretical Computer Science. An EATCS

SNP (complexity) (868 words) [view diff] exact match in snippet view article

Spencer, Joel; Vardi, Moshe Y.; Venema, Yde; Weinstein, Scott (2007). Finite model theory and its applications. Texts in Theoretical Computer Science. An EATCS

Actual infinity (2,607 words) [view diff] no match in snippet view article find links to article

term algebras, term rewriting, and so on. More abstractly, both (finite) model theory and proof theory offer the needed tools to work with infinities.

Cyclic order (6,392 words) [view diff] case mismatch in snippet view article find links to article

(PDF), in Berwanger, Dietmar; Grädel, Erich (eds.), Problems in Finite Model Theory, p. 12, archived from the original (PDF) on 27 May 2011, retrieved

Quantum contextuality (5,857 words) [view diff] case mismatch in snippet view article find links to article

Samson; Dawar, Anuj; Wang, Pengming (2017). "The pebbling comonad in Finite Model Theory". 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science