Difference between revisions of "Logical conjunction"
MyWikiBiz, Author Your Legacy — Thursday November 21, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) (+ cats) |
Jon Awbrey (talk | contribs) (→Syllabus: standardize) |
||
Line 26: | Line 26: | ||
==Syllabus== | ==Syllabus== | ||
+ | |||
+ | ===Focal nodes=== | ||
+ | |||
+ | {{col-begin}} | ||
+ | {{col-break}} | ||
+ | * [[Inquiry Live]] | ||
+ | {{col-break}} | ||
+ | * [[Logic Live]] | ||
+ | {{col-end}} | ||
+ | |||
+ | ===Peer nodes=== | ||
+ | |||
+ | {{col-begin}} | ||
+ | {{col-break}} | ||
+ | * [http://mywikibiz.com/Logical_conjunction Logical Conjunction @ MyWikiBiz] | ||
+ | * [http://mathweb.org/wiki/Logical_conjunction Logical Conjunction @ MathWeb Wiki] | ||
+ | * [http://netknowledge.org/wiki/Logical_conjunction Logical Conjunction @ NetKnowledge] | ||
+ | {{col-break}} | ||
+ | * [http://wiki.oercommons.org/mediawiki/index.php/Logical_conjunction Logical Conjunction @ OER Commons] | ||
+ | * [http://p2pfoundation.net/Logical_Conjunction Logical Conjunction @ P2P Foundation] | ||
+ | * [http://semanticweb.org/wiki/Logical_conjunction Logical Conjunction @ SemanticWeb] | ||
+ | {{col-end}} | ||
===Logical operators=== | ===Logical operators=== | ||
Line 50: | Line 72: | ||
* [[Boolean function]] | * [[Boolean function]] | ||
* [[Boolean-valued function]] | * [[Boolean-valued function]] | ||
+ | * [[Differential logic]] | ||
{{col-break}} | {{col-break}} | ||
* [[Logical graph]] | * [[Logical graph]] | ||
− | |||
* [[Minimal negation operator]] | * [[Minimal negation operator]] | ||
+ | * [[Multigrade operator]] | ||
+ | * [[Parametric operator]] | ||
* [[Peirce's law]] | * [[Peirce's law]] | ||
{{col-break}} | {{col-break}} | ||
* [[Propositional calculus]] | * [[Propositional calculus]] | ||
+ | * [[Sole sufficient operator]] | ||
* [[Truth table]] | * [[Truth table]] | ||
* [[Universe of discourse]] | * [[Universe of discourse]] | ||
* [[Zeroth order logic]] | * [[Zeroth order logic]] | ||
{{col-end}} | {{col-end}} | ||
+ | |||
+ | ===Relational concepts=== | ||
+ | |||
+ | {{col-begin}} | ||
+ | {{col-break}} | ||
+ | * [[Continuous predicate]] | ||
+ | * [[Hypostatic abstraction]] | ||
+ | * [[Logic of relatives]] | ||
+ | * [[Logical matrix]] | ||
+ | {{col-break}} | ||
+ | * [[Relation (mathematics)|Relation]] | ||
+ | * [[Relation composition]] | ||
+ | * [[Relation construction]] | ||
+ | * [[Relation reduction]] | ||
+ | {{col-break}} | ||
+ | * [[Relation theory]] | ||
+ | * [[Relative term]] | ||
+ | * [[Sign relation]] | ||
+ | * [[Triadic relation]] | ||
+ | {{col-end}} | ||
+ | |||
+ | ===Information, Inquiry=== | ||
+ | |||
+ | {{col-begin}} | ||
+ | {{col-break}} | ||
+ | * [[Inquiry]] | ||
+ | * [[Logic of information]] | ||
+ | {{col-break}} | ||
+ | * [[Descriptive science]] | ||
+ | * [[Normative science]] | ||
+ | {{col-break}} | ||
+ | * [[Pragmatic maxim]] | ||
+ | * [[Pragmatic theory of truth]] | ||
+ | {{col-break}} | ||
+ | * [[Semeiotic]] | ||
+ | * [[Semiotic information]] | ||
+ | {{col-end}} | ||
+ | |||
+ | ===Related articles=== | ||
+ | |||
+ | * [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Introduction_to_Inquiry_Driven_Systems Jon Awbrey, “Introduction To Inquiry Driven Systems”] | ||
+ | |||
+ | * [http://mywikibiz.com/Directory:Jon_Awbrey/Essays/Prospects_For_Inquiry_Driven_Systems Jon Awbrey, “Prospects For Inquiry Driven Systems”] | ||
+ | |||
+ | * [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Inquiry_Driven_Systems Jon Awbrey, “Inquiry Driven Systems : Inquiry Into Inquiry”] | ||
+ | |||
+ | * [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Propositional_Equation_Reasoning_Systems Jon Awbrey, “Propositional Equation Reasoning Systems”] | ||
+ | |||
+ | * [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Differential_Logic_:_Introduction Jon Awbrey, “Differential Logic : Introduction”] | ||
+ | |||
+ | * [http://planetmath.org/encyclopedia/DifferentialPropositionalCalculus.html Jon Awbrey, “Differential Propositional Calculus”] | ||
+ | |||
+ | * [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Differential_Logic_and_Dynamic_Systems_2.0 Jon Awbrey, “Differential Logic and Dynamic Systems”] | ||
==Document history== | ==Document history== |
Revision as of 21:26, 14 May 2010
☞ This page belongs to resource collections on Logic and Inquiry.
Logical conjunction is an operation on two logical values, typically the values of two propositions, that produces a value of true if and only if both of its operands are true.
The truth table of p AND q (also written as p ∧ q, p & q, or p\(\cdot\)q) is as follows:
p | q | p ∧ q |
---|---|---|
F | F | F |
F | T | F |
T | F | F |
T | T | T |
Syllabus
Focal nodes
Template:Col-breakTemplate:Col-breakTemplate:Col-endPeer nodes
- Logical Conjunction @ MyWikiBiz
- Logical Conjunction @ MathWeb Wiki
- Logical Conjunction @ NetKnowledge
- Logical Conjunction @ OER Commons
- Logical Conjunction @ P2P Foundation
- Logical Conjunction @ SemanticWeb
Logical operators
Related topics
- Propositional calculus
- Sole sufficient operator
- Truth table
- Universe of discourse
- Zeroth order logic
Relational concepts
Information, Inquiry
Related articles
Document history
Portions of the above article were adapted from the following sources under the GNU Free Documentation License, under other applicable licenses, or by permission of the copyright holders.
<sharethis />