Search results
Jump to navigation
Jump to search
Page title matches
- ...'term''' denotes a [[mathematical object]] while a [[Formula (mathematical logic)|formula]] denotes a mathematical fact. In particular, terms appear as comp ...stant symbols, [[Variable (mathematics)|variables]] and [[function symbol (logic)|function symbols]]. ...20 KB (3,157 words) - 06:45, 20 August 2024
Page text matches
- {{Short description|Logic for mathematics}} '''Algorithmic logic''' is a calculus of programs that allows the expression of [[semantic prope ...3 KB (410 words) - 01:15, 1 August 2024
- {{Short description|Rule of inference in predicate logic}} | field = [[Predicate logic]] ...2 KB (302 words) - 12:41, 18 December 2024
- |known_for=Coining the term [[free logic]] ...Salzburg]]. He has written extensively on the subject of [[free logic]], a term which he coined.<ref>{{Cite journal ...4 KB (510 words) - 13:42, 6 April 2024
- ...the law of absorption because the term <math>Q</math> is "absorbed" by the term <math>P</math> in the [[consequent]].<ref>Whitehead and Russell, ''[[Princi ...positional logic]]. The principle was stated as a theorem of propositional logic by [[Bertrand Russell|Russell]] and [[Alfred North Whitehead|Whitehead]] in ...3 KB (521 words) - 13:21, 12 February 2025
- {{Short description|Rule of inference in predicate logic}} | field = [[Predicate logic]] ...3 KB (445 words) - 01:24, 17 December 2024
- In [[mathematical logic]], a '''witness''' is a specific value {{mvar|t}} to be substituted for var ...<math>\exists x\, \varphi(x)</math> in a theory ''T'' is a [[term (logic)|term]] ''c'' such that ''T'' proves ''φ''(''c'') (Hinman 2005:196). The use of s ...3 KB (535 words) - 21:31, 22 April 2024
- ...eory) |classes]] are described by a property of their elements. This class logic is thus a generalization of [[set theory]], which allows only a limited con ==Class logic in the strict sense== ...6 KB (911 words) - 19:00, 29 December 2024
- {{About|terms resulting from overlaps in [[term rewriting system]]s||Critical pair (disambiguation){{!}}Critical pair}} ...rm rewriting)|confluent]]. (For notation details, see {{section link|Term (logic)|Operations with terms}}.)]] ...4 KB (704 words) - 17:17, 29 September 2024
- {{Short description|Concept in modal logic}} ...se if something does not exist, it cannot exist). In the notation of modal logic, this can be written as <math>\phi \leftrightarrow \Box \phi</math>. ...3 KB (429 words) - 11:42, 11 August 2024
- In [[mathematical logic]], the '''Scott–Curry theorem''' is a result in [[lambda calculus]] stating The Scott–Curry theorem applies equally to sets of terms in [[combinatory logic]] with weak equality. It has parallels to [[Rice's theorem]] in computabili ...4 KB (621 words) - 00:18, 25 April 2021
- In [[mathematical logic]] and [[metalogic]], a [[formal system]] is called '''complete''' with resp ...on the context, mostly referring to the property of semantical [[Validity (logic)|validity]]. Intuitively, a system is called complete in this particular se ...7 KB (953 words) - 19:19, 10 January 2025
- {{short description|Modal logic term}} In [[modal logic]], the '''modal depth''' of a formula is the deepest nesting of [[modal ope ...4 KB (590 words) - 21:44, 1 June 2023
- {{distinguish|Interpretation (logic)}} ...]] ''M'' in another structure ''N'' (typically of a different [[signature (logic)|signature]]) is a technical notion that approximates the idea of represent ...7 KB (1,076 words) - 01:34, 7 January 2025
- {{Short description|Concept of logic or linguistics}} In [[logic]] and [[linguistics]], an expression is '''syncategorematic''' if it lacks ...6 KB (795 words) - 09:51, 4 June 2024
- ...-generating dependency is a [[Sentence (logic)|sentence]] in [[first-order logic]] of the form: ...uality atom has the form <math>w_i = w_j</math>, where each of the [[Term (logic)|terms]] <math>w, ..., w_h, w_i, w_j</math> are [[Variable (mathematics)|va ...3 KB (441 words) - 04:53, 19 June 2024
- ...Each letter in ''F'' has its [[arity]] so it can be used to build [[Term (logic)|terms]]. Nullary elements (of zero arity) are also called '''constants'''. For instance, in the term ...1 KB (220 words) - 20:16, 6 April 2023
- ...ise]]s to be [[truth|true]] and the conclusion nevertheless to be [[False (logic)|false]].<ref>[http://www.iep.utm.edu/val-snd/ Validity and Soundness – Int ...ment terminology used in logic (en).svg|thumb|Argument terminology used in logic]] ...9 KB (1,361 words) - 05:31, 24 January 2025
- The main application of the principle is in the study of [[intuitionistic logic]], where the principle is not generally valid. Its crucial equivalent speci The principle is valid in [[classical logic]]. ...8 KB (1,287 words) - 12:04, 1 September 2024
- }}</ref> is a proof interpretation of intuitionistic logic ([[Heyting arithmetic]]) into a finite type extension of [[primitive recurs == Intuitionistic logic == ...8 KB (1,175 words) - 11:26, 19 January 2025
- ...ndon School of Economics]], and [[W. V. O. Quine]].<ref>Czesław Lejewski, "Logic and Existence" ''British Journal for the Philosophy of Science''; Vol. 5 (1 == "Logic and Existence" == ...8 KB (1,111 words) - 22:18, 28 July 2023