Find link

language:

Find link is a tool written by Edward Betts.

searching for First-order logic 51 found (784 total)

Barber paradox (759 words) [view diff] no match in snippet view article find links to article

The barber paradox is a puzzle derived from Russell's paradox. It was used by Bertrand Russell as an illustration of the paradox, though he attributes

Stephen Yablo (881 words) [view diff] no match in snippet view article find links to article

Stephen Yablo (/ˈjæbloʊ/; born 1957) is a Canadian-born American philosopher. He is the Emeritus David W. Skinner Professor of Philosophy at the Massachusetts

NEXPTIME (1,146 words) [view diff] exact match in snippet view article find links to article

satisfiability problem of first-order logic with two variables is NEXPTIME-complete. The satisfiability problem of first-order logic with counting and with

Preferential entailment (182 words) [view diff] exact match in snippet view article find links to article

propositional case) or containment of the extensions of predicates (in the first-order logic case). Rational consequence relation Shoham, Y. (1987), "Nonmonotonic

Semantic Web Rule Language (1,031 words) [view diff] no match in snippet view article find links to article

undecidable. There can be three types of approach: translate SWRL into First Order Logic (Hoolet) and demonstrate reasoning tasks with a theorem prover; translate

Plural quantification (2,283 words) [view diff] exact match in snippet view article find links to article

buildings in London over 20 stories. The point of the theory is to give first-order logic the power of set theory, but without any "existential commitment"

Tuple relational calculus (2,303 words) [view diff] exact match in snippet view article find links to article

Lacroix and Alain Pirotte proposed domain calculus, which is closer to first-order logic and together with Codd showed that both of these calculi (as well

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

quantification. Relational calculus is essentially equivalent to first-order logic, and indeed, Codd's Theorem had been known to logicians since the

Lindström quantifier (1,192 words) [view diff] exact match in snippet view article find links to article

type t, there is a quantifier of that type that is not definable in first-order logic extended with quantifiers that are of types less than t. Although

María Manzano (286 words) [view diff] no match in snippet view article find links to article

[1989], ISBN 978-0198538516 Manzano, María (1996), Extensions of First Order Logic, Cambridge Tracts in Theoretical Computer Science, vol. 19, Cambridge

Coherent topos (99 words) [view diff] exact match in snippet view article find links to article

Deligne's theorem is a variant of the Gödel completeness theorem for first-order logic. Spectral space Pyknotic set Jacob Lurie, Categorical Logic (278x)

Thousands of Problems for Theorem Provers (250 words) [view diff] no match in snippet view article find links to article

algorithms. Problems are expressed in a simple text-based format for first order logic or higher-order logic. TPTP is used as the source of some problems

Double turnstile (460 words) [view diff] exact match in snippet view article find links to article

revised ed.). King's College Publications. p. 62. ISBN 0-9543006-7-X. Open Logic Project, First-order logic (p.7). Accessed 4 January 2022. v t e v t e v t e

Effective method (492 words) [view diff] case mismatch in snippet view article find links to article

mathematics". Metalogic: An Introduction to the Metatheory of Standard First-Order Logic. University of California Press (published 1973). ISBN 9780520023567

Wholistic reference (393 words) [view diff] exact match in snippet view article find links to article

Frege (1848–1925). Some recent formulations of standard one-sorted first-order logic seem to be in accord with a form of it, if they do not actually imply

Q0 (mathematical logic) (1,141 words) [view diff] exact match in snippet view article

calculus, and provides a foundation for mathematics comparable to first-order logic plus set theory. It is a form of higher-order logic and closely related

Term graph (431 words) [view diff] no match in snippet view article find links to article

since they are well-suited to representing quantified statements in first order logic. Symbolic programming software is another application for term graphs

AC0 (776 words) [view diff] exact match in snippet view article find links to article

equal to the descriptive class FO+BIT of all languages describable in first-order logic with the addition of the BIT predicate, or alternatively by FO(+,

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

denote the set of tree properties describable in transitive closure first-order logic, and F O + pos T C {\displaystyle FO+{\text{pos}}\,TC} the same for

Database schema (1,119 words) [view diff] no match in snippet view article find links to article

Olog Schema matching Three-schema approach Rybinski, H. (1987). "On First-Order-Logic Databases". ACM Transactions on Database Systems. 12 (3): 325–349

History of artificial intelligence (20,004 words) [view diff] exact match in snippet view article find links to article

first-order logic, lack the expressive power to adequately represent the knowledge required for reasoning by default". He proposed augmenting first-order

Knowledge-based engineering (2,661 words) [view diff] no match in snippet view article find links to article

to the expressive power of first order logic. As Levesque also demonstrated, the closer a language is to First Order Logic, the more probable that it

Phokion G. Kolaitis (630 words) [view diff] exact match in snippet view article find links to article

(TODS) 30 (4), 994-1055 On the decision problem for two-variable first-order logic, E Grädel, PG Kolaitis, MY Vardi, Bulletin of Symbolic Logic, 53-69

Andrzej Mostowski (827 words) [view diff] no match in snippet view article find links to article

University of Warsaw. Much of his work, during that time, was on first order logic and model theory. He also worked at the State Institute of Mathematics

Henry M. Sheffer (533 words) [view diff] case mismatch in snippet view article find links to article

2017. Geoffrey Hunter, An Introduction to the Metatheory of Standard First-Order Logic, MacMillan, London and Basingstoke, 1971. Sheffer, Henry Maurice (1913)

Alonzo Church (2,245 words) [view diff] case mismatch in snippet view article find links to article

Limits of Mathematics". The New York Times. p. B6. "Undecidability of First-Order Logic" (PDF). Church, A. (1936). "An unsolvable problem of elementary number

Solver (531 words) [view diff] exact match in snippet view article find links to article

respect to combinations of background theories expressed in classical first-order logic with equality. Semantic reasoner List of linear programming solvers

Influence of nonstandard analysis (653 words) [view diff] exact match in snippet view article find links to article

Research Volume 99, Issue 1, 16 May 1997, Pages 48–57. Melvin Fitting: First-order logic and automated theorem-proving. Springer, 1996. Daniel Lehmann, Menachem

ISO 15926 (2,185 words) [view diff] case mismatch in snippet view article find links to article

RDF. For validation and reasoning purposes all are represented in First-Order Logic as well. In Part 9 these Node and Template instances are stored in

Definition (3,903 words) [view diff] exact match in snippet view article find links to article

outside mathematics, such as primitive group or irreducible variety. In first-order logic definitions are usually introduced using extension by definition (so

Extendible cardinal (506 words) [view diff] exact match in snippet view article find links to article

compactness theorem shows ℵ 0 {\displaystyle \aleph _{0}} -compactness of first-order logic.) Let L κ 2 {\displaystyle L_{\kappa }^{2}} be the infinitary logic

Competitions and prizes in artificial intelligence (2,218 words) [view diff] no match in snippet view article find links to article

yearly competition of fully automated theorem provers for classical first order logic associated with the Conference on Automated Deduction (CADE) and International

Curry's paradox (2,406 words) [view diff] exact match in snippet view article find links to article

ponens. These are included in most common logical systems, such as first-order logic. In the 1930s, Curry's paradox and the related Kleene–Rosser paradox

Ronald Fagin (1,179 words) [view diff] exact match in snippet view article find links to article

model theory. Another result that he proved in his PhD thesis is that first-order logic has a zero-one law, which says that if S is a first-order sentence

Michael Makkai (466 words) [view diff] no match in snippet view article find links to article

ISBN 0-8218-5111-X, doi:10.1090/conm/104 M. Makkai: Duality and Definability in First Order Logic, Memoirs of the American Mathematical Society, 503, 1993, ISSN 0065-9266

Alma-0 (627 words) [view diff] case mismatch in snippet view article find links to article

Imperative Programming Language". Krzysztof R. Apt, Andrea Schaerf (1999). "The Alma Project, or How First-Order Logic Can Help Us in Imperative Programming".

Cut-elimination theorem (1,162 words) [view diff] exact match in snippet view article find links to article

the system is consistent. Normally also the system has, at least in first-order logic, the subformula property, an important property in several approaches

Pedro Domingos (507 words) [view diff] exact match in snippet view article find links to article

contributions to the field of machine learning and to the unification of first-order logic and probability. 2003: Sloan Fellowship 1992–1997: Fulbright Scholarship

Vincent F. Hendricks (994 words) [view diff] case mismatch in snippet view article find links to article

Springer, 2002) Knowledge Contributors (Dordrecht: Springer, 2003) First-Order Logic Revisited (Berlin: Logos Verlag 2004) The Way Through Science and

Universal vertex (1,942 words) [view diff] exact match in snippet view article find links to article

of having a universal vertex can be expressed by a formula in the first-order logic of graphs. Using ∼ {\displaystyle \sim } to indicate the adjacency

Relational (414 words) [view diff] exact match in snippet view article find links to article

but actually imply each other Relational algebra, an offshoot of first-order logic and of algebra of sets concerned with operations over finitary relations

Andrzej Trybulec (717 words) [view diff] exact match in snippet view article find links to article

objects being sets and eliminated notion of class, together with the first-order logic of the Gentzen-Jaśkowski natural deduction, in 1973 he designed the

Probabilistic logic (2,006 words) [view diff] exact match in snippet view article find links to article

empirically satisfactory unification of classic probability theory and first-order logic that is suitable for inductive reasoning. Their theory assigns probabilities

Samuel Buss (324 words) [view diff] no match in snippet view article find links to article

mathematics, and lower bounds in propositional proof systems. "A Limit of First Order Logic « Gödel's Lost Letter and P=NP". Rjlipton.wordpress.com. 17 January

Link prediction (2,404 words) [view diff] exact match in snippet view article find links to article

random field (HL-MRF). HL-MRFs are created by a set of templated first-order logic-like rules, which are then grounded over the data. PSL can combine

Łoś–Tarski preservation theorem (362 words) [view diff] exact match in snippet view article find links to article

Jerzy Łoś and Alfred Tarski. Let T {\displaystyle T} be a theory in a first-order logic language L {\displaystyle L} and Φ ( x ¯ ) {\displaystyle \Phi ({\bar

Serge Abiteboul (831 words) [view diff] case mismatch in snippet view article find links to article

S2CID 12707902. Abiteboul, S.; Vianu, V. (1995). "Computing with First-Order Logic". Journal of Computer and System Sciences. 50 (2): 309. doi:10.1006/jcss

Substructural type system (1,361 words) [view diff] no match in snippet view article find links to article

New Structures for Physics (PDF). pp. 95–174. Ambler, S. (1991). First order logic in symmetric monoidal closed categories (PhD). U. of Edinburgh. "Vale's

Definable set (1,268 words) [view diff] exact match in snippet view article find links to article

If the structure is considered in second-order logic instead of first-order logic, the definable sets of natural numbers in the resulting structure

Construction of the real numbers (4,193 words) [view diff] exact match in snippet view article find links to article

just individual such numbers. As such, the reals are not given by a first-order logic theory. A model of real numbers is a mathematical structure that satisfies

Raymond Smullyan (2,703 words) [view diff] case mismatch in snippet view article find links to article

NJ: Princeton University Press. ISBN 978-0-691-08047-5. — (1968). First-Order Logic. Ergebnisse der Mathematik und ihrer Grenzgebiete. Vol. 43 (1st edition