language:
Find link is a tool written by Edward Betts.searching for First-order logic 49 found (783 total)
alternate case: first-order logic
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 attributesStephen 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 MassachusettsNEXPTIME (1,066 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 withPlural 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"Preferential entailment (195 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 – type of consequence relationTuple 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 wellMaría Manzano (283 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, CambridgeLindströ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. AlthoughCodd'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 theCoherent 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 (208 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 problemsEffective 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 9780520023567Double 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 eQ0 (mathematical logic) (1,135 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 relatedWholistic reference (396 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 implyTerm 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 graphsAC0 (769 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(+,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–349Pebble 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 forKnowledge-based engineering (2,641 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 itHenry 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)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-69History of artificial intelligence (19,579 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-orderAndrzej Mostowski (826 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 MathematicsInfluence 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, MenachemSolver (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 solversAlonzo 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 numberRosser's trick (1,591 words) [view diff] exact match in snippet view article find links to article
situation cannot hold for any two numbers, as well as to include some first-order logic.) Using the diagonal lemma, let ρ {\displaystyle \rho } be a formulaISO 15926 (2,177 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 inDefinition (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 (soExtendible 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 logicCut-elimination theorem (1,139 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 approachesCompetitions 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 InternationalRonald 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 sentenceCurry'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 paradoxVincent F. Hendricks (982 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 andMichael 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-9266Probabilistic logic (2,003 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 probabilitiesPedro 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 ScholarshipAlma-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".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".Ł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 ({\barJohn Alan Robinson (813 words) [view diff] exact match in snippet view article find links to article
mechanization (in the sense of a semidecision procedure) of classical first-order logic was proposed in 1965 by J.A. Robinson, with a single uniform inferenceAndrzej 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 theUniversal 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 adjacencySamuel 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 JanuaryLink 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 combineMathematics (15,937 words) [view diff] case mismatch in snippet view article find links to article
S2CID 11678884. Ewald, William (November 17, 2018). "The Emergence of First-Order Logic". Stanford Encyclopedia of Philosophy. ISSN 1095-5054. LCCN sn97004494Definable 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