Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...tifiers, and formulas are built from propositional variables using logical connectives. In this context, a valuation begins with an assignment of a truth value to ...ation symbols. Formulas are built out of [[atomic formula]]s using logical connectives and quantifiers. A [[structure (mathematical logic)|structure]] consists o ...
    3 KB (412 words) - 15:06, 13 August 2024
  • ...'''IMPLY gate''' is an informal digital [[logic gate]] that implements a [[logical conditional]]. ...it is equivalent to [[Material_conditional|material implication]], and the logical expression ¬A v B. ...
    2 KB (267 words) - 12:15, 31 July 2024
  • ...sions. Logically, it is equivalent to [[material nonimplication]], and the logical expression A ∧ ¬B. {{Logical connectives}} ...
    2 KB (196 words) - 09:38, 31 July 2023
  • ...countably]] many [[propositional variable]]s and the following primitive [[logical connective]]s: * '''Bottom''' <math>\bot</math> ([[nullary]] — a [[Logical constant|propositional constant]]); <math>0</math> or <math>\overline{0}</m ...
    6 KB (799 words) - 13:20, 18 October 2024
  • {{Short description|Range of application for a quantifier or connective in a logical formula}} In [[logic]], the '''scope''' of a [[Quantifier (logic)|quantifier]] or [[Logical connective|connective]] is the shortest formula in which it occurs,<ref nam ...
    9 KB (1,300 words) - 14:09, 8 October 2024
  • ...=1991 |title=Logic, Language, and Meaning, Volume 2: Intensional Logic and Logical Grammar|publisher=University of Chicago Press |page=101}}</ref><ref>Grant, ...d by themselves were dubbed syncategorematic, (i.e., prepositions, logical connectives, etc.). [[Priscian]] in his ''Institutiones grammaticae''<ref>Priscian, ''I ...
    6 KB (795 words) - 09:51, 4 June 2024
  • {{Short description|Properties linking logical conjunction and disjunction}} {{Logical connectives sidebar}} ...
    9 KB (1,391 words) - 20:57, 25 October 2024
  • ...diagram''' that represents the logical statement <math>P \lor Q</math> ([[Logical disjunction|disjunction]]).]] A '''Randolph diagram''' ('''R-diagram''') is a simple way to visualize logical expressions and combinations of sets. Randolph diagrams were created by mat ...
    10 KB (1,432 words) - 17:08, 6 September 2024
  • ...es]]), and in the exact complete choice of axioms over the chosen basis of connectives. ...d negation <math>\{\to,\neg\}</math> as functionally complete set of basic connectives. Every logic system requires at least one non-nullary [[rule of inference]] ...
    19 KB (3,523 words) - 11:17, 6 December 2024
  • ...order language are the [[Accessibility relation|accessible worlds]]. The [[logical connective]]s from [[propositional logic]] remain untouched and the modal o ...> is false but the whole formula is [[Vacuous truth|vacuously true]]: an [[Logical implication|implication]] is also true when the [[Antecedent (logic)|antece ...
    5 KB (782 words) - 18:32, 28 June 2023
  • ...higher order logics one can define propositional connectives in terms of [[logical equivalence]] and quantifiers, in 1963 Henkin developed a formulation of '' ...put it, '''ST''' is "logic-free" in the sense that it contains no logical connectives or quantifiers in its formulae.<ref>P.T. Johnstone, ''Sketches of an elepha ...
    7 KB (998 words) - 21:45, 29 February 2024
  • ...ath> are formulas, then <math>(\theta \and \xi)</math> is a formula (the [[logical conjunction|conjunction]] of <math>\theta</math> and <math>\xi</math>). It is possible to express the missing [[logical connectives]] in this language. For instance: ...
    6 KB (901 words) - 06:58, 25 February 2025
  • {{short description|Characteristic of some logical systems}} Completeness, as a quality of logical systems, is closely related to [[consistency]]. A formal system is consiste ...
    7 KB (953 words) - 19:19, 10 January 2025
  • ...us]]), chosen to be as short as possible. For example, an axiom with six [[Logical NAND|NAND]] operations and three variables is equivalent to Boolean algebra where the vertical bar represents the NAND logical operation (also known as the [[Sheffer stroke]]). ...
    7 KB (948 words) - 03:50, 24 January 2025
  • Inquisitive propositions encode informational content via the region of logical space that their information states cover. For instance, the inquisitive pr ...opositions can be used to provide a semantics for the [[logical connective|connectives]] of [[propositional logic]] since they form a [[Heyting algebra]] when ord ...
    8 KB (1,114 words) - 17:50, 6 February 2022
  • * the [[logical connective|logical operators]] ¬ and ∨, and ...h as &lt;, &le;, =, &ge; or &gt;.{{clarify|reason=Since the set of logical connectives is chosen minimal (without e.g. \lor), the same could be done here. If time ...
    8 KB (1,332 words) - 20:48, 6 February 2025
  • {{Redirect|Logical implication|the binary connective|Material conditional}} ...provide accounts of the nature of logical consequence and the nature of [[logical truth]].<ref>[[Willard Van Orman Quine|Quine, Willard Van Orman]], ''Philos ...
    17 KB (2,428 words) - 23:09, 28 January 2025
  • ...assertibles can be built up from simple ones through the use of [[logical connectives]]. The resulting syllogistic was grounded on five basic indemonstrable argu ...ars|2006|p=55}}</ref> To achieve a happy life—a life worth living—requires logical thought.<ref name="shenefeltwhite74"/> The Stoics held that an understandin ...
    34 KB (5,128 words) - 03:43, 13 January 2025
  • ...metimes also been used to denote logic systems with a restricted number of connectives. [[logical implication|implication]] <math>\to</math>, ...
    23 KB (3,653 words) - 21:38, 20 November 2024
  • ...ure]] consisting of only the equality relation symbol, and includes no non-logical axioms at all.<ref>{{Cite book| last1=Monk | first1=J. Donald | title=Mathe ...ex formulas can be built as usual in first-order logic using propositional connectives such as <math>\land, \lor, \lnot</math> and quantifiers <math>\forall,\exi ...
    6 KB (819 words) - 13:02, 24 October 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)