Search results
Jump to navigation
Jump to search
- A '''logical matrix''', in the finite dimensional case, is a <math>k\!</math>-dimensiona * [http://intersci.ss.uci.edu/wiki/index.php/Logical_matrix Logical Matrix @ InterSciWiki] ...4 KB (520 words) - 04:08, 10 May 2019
- '''Logical conjunction''' is an operation on two logical values, typically the values of two propositions, that produces a value of A logical conjunction of propositions <math>p</math> and <math>q</math> may be writte ...6 KB (799 words) - 04:12, 10 May 2019
- ...junction''', also called '''logical alternation''', is an operation on two logical values, typically the values of two propositions, that produces a value of |+ style="height:30px" | <math>\text{Logical Disjunction}\!</math> ...5 KB (626 words) - 02:28, 9 March 2020
- ...], say, <math>\mathbb B=\{0,1\}</math> , whose elements are interpreted as logical values, typically, <math>0=\text{false}</math> and <math>1=\text{true}</mat ===Logical operators=== ...4 KB (516 words) - 07:58, 12 May 2019
- '''Logical equality''' is an operation on two logical values, typically the values of two propositions, that produces a value of |+ style="height:30px" | <math>\text{Logical Equality}\!</math> ...5 KB (635 words) - 18:44, 26 December 2022
- ===Logical operators=== * [[Logical conjunction]] ...5 KB (544 words) - 08:47, 24 March 2023
- The '''logical NNOR''' (“Neither Nor”) is an operation on two logical values, typically the values of two propositions, that produces a value of |+ style="height:30px" | <math>\text{Logical NNOR}\!</math> ...5 KB (648 words) - 02:29, 9 March 2020
- The '''logical NAND''' is an operation on two logical values, typically the values of two propositions, that produces a value of |+ style="height:30px" | <math>\text{Logical NAND}\!</math> ...5 KB (654 words) - 02:29, 9 March 2020
- ...a specified class of operators. In the context of [[logic]], it is a logical operator that suffices to generate every [[boolean-valued function]], <math ===Logical operators=== ...5 KB (602 words) - 03:53, 2 June 2018
- ===Logical operators=== * [[Logical conjunction]] ...5 KB (568 words) - 16:06, 8 September 2022
- '''Logical negation''' is an operation on one logical value, typically the value of a proposition, that produces a value of ''tru |+ style="height:30px" | <math>\text{Logical Negation}\!</math> ...6 KB (699 words) - 02:29, 9 March 2020
- ===Logical operators=== * [[Logical conjunction]] ...5 KB (590 words) - 08:46, 24 March 2023
- ...ogical inequality''' or '''symmetric difference''', is an operation on two logical values, typically the values of two propositions, that produces a value of ===Logical operators=== ...6 KB (697 words) - 02:28, 9 March 2020
- ===Logical operators=== * [[Logical conjunction]] ...6 KB (785 words) - 04:12, 10 May 2019
- ===Logical operators=== * [[Logical conjunction]] ...7 KB (857 words) - 04:07, 10 May 2019
- ...>\{ \operatorname{false}, \operatorname{true} \}.</math> The names of the logical values, or ''truth values'', are commonly abbreviated in accord with the eq ==Logical negation== ...16 KB (2,160 words) - 02:29, 9 March 2020
- ...eirce's law is represented by means of the following formal equivalence or logical equation. '''Proof.''' Using the axiom set given in the entry for [[logical graphs]], Peirce's law may be proved in the following manner. ...11 KB (1,503 words) - 08:06, 18 December 2022
- ...logical implication''' encompasses a specific logical function, a specific logical [[relation (mathematics)|relation]], and the various symbols that are used Close approximations to the concept of logical implication are expressed in ordinary language by means of linguistic forms ...15 KB (2,098 words) - 14:41, 27 March 2024
- ...ession in the distinguished subset, typically interpreted as the subset of logical ''axioms''. ...t of operator symbols, variously interpreted as ''logical operators'' or ''logical connectives''. A ''well-formed formula'' (''wff'') is any atomic formula o ...16 KB (2,271 words) - 02:29, 9 March 2020
- ...okes, or [[logical NAND|NAND]] and [[logical NNOR|NNOR]]. Either of these logical operators is a ''[[sole sufficient operator]]'' for deriving or generating ...uces the term ''ampheck'' for the 2-place logical connective or the binary logical operator that is currently called the ''joint denial'' in logic, the NNOR o ...9 KB (1,221 words) - 08:46, 24 March 2023