Propositional calculus

related topics
{math, number, function}
{theory, work, human}
{specie, animal, plant}
{style, bgcolor, rowspan}

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.


Full article ▸

related documents
Lisp (programming language)
Fourier transform
Vienna Development Method
Group (mathematics)
Model theory
Generic programming
Clifford algebra
C (programming language)
Vector space
Discrete Fourier transform
Floating point
Euclidean vector
Ordinal number
Mathematical logic
Regular expression
Common Lisp
Emmy Noether
Eiffel (programming language)
Surreal number
Prime number
Singular value decomposition
Radix sort
Natural deduction