Propositional calculus
From The Art and Popular Culture Encyclopedia
Related e |
Google
Featured: |
In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules and axioms allows certain formulas to be derived, called theorems; which may be interpreted as true propositions. The series of formulas which is constructed within such a system is called a derivation and the last formula of the series is a theorem, whose derivation may be interpreted as a proof of the truth of the proposition represented by the theorem.
Truth-functional propositional logic is a propositional logic whose interpretation limits the truth values of its propositions to two, usually true and false. Truth-functional propositional logic and systems isomorphic to it are considered to be zeroth-order logic.
Related topics
- Ampheck
- Boolean algebra (logic)
- Boolean algebra (structure)
- Boolean algebra topics
- Boolean domain
- Boolean function
- Boolean-valued function
- Categorical logic
- Combinational logic
- Combinatory logic
- Conceptual graph
- Disjunctive syllogism
- Entitative graph
- Existential graph
- Frege's propositional calculus
- Implicational propositional calculus
- Intuitionistic propositional calculus
- Laws of Form
- Logical graph
- Logical value
- Minimal negation operator
- Multigrade operator
- Operation
- Parametric operator
- Peirce's law
- Propositional formula
- Symmetric difference
- Truth table