Propositional Logic

Branch of Logic: Propositional Logic – A Necessary Evil

Not to be confused with Propositional analysis , which, frankly, deals with a different kind of structural interrogation.

Propositional logic is, regrettably, a foundational branch of logic . [^1] [^2] It’s known by an assortment of aliases, each attempting to capture its essence, though none quite manage to convey the cosmic weariness it instills. You might hear it called statement logic [^1], sentential calculus [^3], propositional calculus [^4] [^a], or even sentential logic [^5] [^1]. Occasionally, it’s referred to as zeroth-order logic [^b] [^7] [^8] [^9], a designation that succinctly places it at the very beginning of the logical hierarchy, implying simpler, less ambitious concerns. Some even stretch to call it first-order propositional logic [^10] to distinguish it from more esoteric systems like System F , but let’s be clear: it should never, under any circumstances, be mistaken for its more sophisticated cousin, first-order logic .

At its core, propositional logic concerns itself with propositions [^1] – those delightful linguistic constructs that possess the singular quality of being unequivocally true or false [^11]. It meticulously examines the relations between these propositions [^12], including the rather mundane but crucial task of constructing coherent arguments based on their interplay [^13]. Complex or “compound” propositions are not born spontaneously; they are painstakingly assembled by connecting simpler propositions using logical connectives . These connectives are merely symbolic representations of fundamental truth functions , dictating the outcome of conjunction (the ‘and’), disjunction (the ‘or’), implication (the ‘if…then’), biconditional (the ‘if and only if’), and negation (the ’not’) [^14] [^15] [^16] [^17]. Some texts, for the sake of completeness or perhaps just to be difficult, include other connectives, as you’ll observe in the table below.

What truly sets propositional logic apart from its more advanced counterparts, such as first-order logic , is its unwavering focus. It steadfastly refuses to engage with the messy specifics of non-logical objects, the intricate predicates that describe their properties, or the universal pronouncements of quantifiers . It is, in essence, the minimalist of logical systems. However, one must concede that all the structural elegance and operational machinery inherent in propositional logic are fully encompassed within first-order logic and its even more abstract successors, higher-order logics . In this rather undeniable sense, propositional logic serves as the fundamental bedrock, the bare minimum, upon which the entire edifice of more complex logical systems is constructed.

Typically, this branch of logic is explored through the medium of a formal language [^c]. Within this structured environment, individual propositions are stripped of their natural language ambiguities and represented by single letters, known rather uncreatively as propositional variables . These variables then combine with symbols representing the aforementioned connectives to forge intricate propositional formulas . Consequently, these initial propositional variables are often referred to as atomic formulas within the context of a formal propositional language [^15] [^2]. While these atomic propositions are conventionally denoted by letters from the alphabet [^d] [^15], the notation for the logical connectives themselves is, predictably, a wild and varied landscape. For those who might have encountered a different dialect of logical notation, the following table presents the primary notational variants for each connective in propositional logic. Historically, other notations, such as the utterly delightful Polish notation , have also been employed. For a more detailed, and no doubt equally dry, account of the origins of these symbols, one can consult their respective articles or the broader entry on “Logical connective ”.

Notational variants of the connectives [^e] [^18] [^19]

| Connective | Symbol