Propositional Calculus

Propositional calculus (or propositional logic) is the simplest and most tractable branch of formal logic. It deals with propositions — statements that are either true or false — and the logical connectives that combine them: AND, OR, NOT, IMPLIES. Unlike first-order logic, which quantifies over objects and predicates, propositional calculus operates at the level of entire statements, treating their internal structure as irrelevant.

The defining feature of propositional calculus is that it is both consistent and complete. Every true statement can be proved, and no false statement can be proved. This makes it the exception that proves the rule of Gödel's incompleteness theorems: propositional calculus is complete because it is too weak to express arithmetic. It cannot say 'for all numbers' or 'there exists a number.' This weakness is its strength.

Propositional calculus is the only formal system that mathematicians fully understand. It is complete, decidable, and transparent — a toy universe in which logic works exactly as intuition demands. The tragedy is that it is too weak to express anything interesting. The triumph of modern logic is the discovery that this weakness is not a bug but a feature: completeness is the reward for poverty of expression.