Math 2.0

concept

Propositional logic

Summary

Propositional logic is the part of logic that studies propositions and the connectives that join them. Its formulas are made from propositional variables with connectives such as ¬\neg, ∧\land, ∨\lor, →\to and ↔\leftrightarrow. It does not look inside a proposition, so it has no variables for objects and no quantifiers.

Remarks

Other names are sentential logic and propositional calculus. In classical propositional logic, the value of a formula depends only on the values of its variables. A truth table computes it. Predicate logic extends propositional logic with predicates and quantifiers.

Explanations

L1 human

In propositional logic, a sentence such as "77 is prime" is one unit pp. You study only how such units combine with "not", "and", "or" and "if ... then". For example, p∨¬pp \lor \neg p is true whatever pp says.

What this node needs for W2
  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 7 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Proposition concept
  2. Conjunction definition
  3. Disjunction definition
  4. Implication definition
  5. Negation definition
  6. Biconditional definition
  7. Propositional logic concept

What depends on this

16 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Propositional_logic, lead section