Find link

language:

Find link is a tool written by Edward Betts.

searching for Extensions of First Order Logic 14 found (16 total)

alternate case: extensions of First Order Logic

Abstract model theory (169 words) [view diff] no match in snippet view article find links to article

generalization of model theory that studies the general properties of extensions of first-order logic and their models. Abstract model theory provides an approach

Higher-order logic (1,066 words) [view diff] case mismatch in snippet view article find links to article

and Jouko Väänänen. "On Löwenheim-Skolem-Tarski numbers for extensions of first order logic", Report No. 15 (2009/2010) of the Mittag-Leffler Institute

Löwenheim number (654 words) [view diff] case mismatch in snippet view article find links to article

and Jouko Väänänen. "On Löwenheim-Skolem-Tarski numbers for extensions of first order logic", Report No. 15 (2009/2010) of the Mittag-Leffler Institute

Jouko Väänänen (534 words) [view diff] case mismatch in snippet view article find links to article

Magidor and J. Väänänen, On Löwenheim-Skolem-Tarski numbers for extensions of first order logic, Journal of Mathematical Logic, 11(1), 87-113, 2011. E. Grädel

Joseph Sgro (2,884 words) [view diff] case mismatch in snippet view article find links to article

research concentrated on proving the existence of maximal extensions of first order logic which satisfy Łoś's theorem on ultraproducts and have the Souslin-Kleene

Descriptive complexity theory (2,543 words) [view diff] no match in snippet view article find links to article

Immerman 1999, p. 181 Abiteboul, S.; Vianu, V. (1989). "Fixpoint extensions of first-order logic and datalog-like languages". [1989] Proceedings. Fourth Annual

Grigore Roșu (1,229 words) [view diff] no match in snippet view article find links to article

(CSF), pp. 204-217. Y. Gurevich, S. Shelah. 1985, Fixed-point extensions of first-order logic In Proceedings of Foundations of Computer Science (SFCS), pp

Second-order logic (4,502 words) [view diff] no match in snippet view article find links to article

second-order logic. ESO also enjoys translation equivalence with some extensions of first-order logic that allow non-linear ordering of quantifier dependencies,

Fixed-point logic (2,030 words) [view diff] no match in snippet view article find links to article

Immerman 1999, p. 161 Abiteboul, S.; Vianu, V. (1989). "Fixpoint extensions of first-order logic and datalog-like languages". [1989] Proceedings. Fourth Annual

Leon Henkin (10,251 words) [view diff] no match in snippet view article find links to article

chapter Frames and General Structures of Manzano, M., (1996). Extensions of First-Order Logic, Cambridge University Press, Cambridge. Manzano, M., Kurucz

First-order logic (12,931 words) [view diff] no match in snippet view article find links to article

only model has the set of real numbers as its domain. Many extensions of first-order logic, including infinitary logics and higher-order logics, are more

Propositional calculus (11,441 words) [view diff] case mismatch in snippet view article find links to article

Press. p. 463. ISBN 978-0-19-020001-5. Manzano, María (2005). Extensions of first order logic. Cambridge tracts in theoretical computer science (Digitally

History of artificial intelligence (19,579 words) [view diff] no match in snippet view article find links to article

late 1970s and throughout the 1980s, a variety of logics and extensions of first-order logic were developed both for negation as failure in logic programming

Glossary of logic (30,237 words) [view diff] no match in snippet view article find links to article

47. ISBN 978-1-107-03659-8. Manzano, Maria (1996-03-29). Extensions of First-Order Logic. Cambridge University Press. p. 80. ISBN 978-0-521-35435-6