propositional calculus

Branch of logic concerned with the study of propositions (whether they are true or false) that are formed by other propositions with the use of logical connectives, and how their value depends on the truth value of their components

EntityQ200694

Also known as sentential calculus · sentential logic · statement logic · zeroth-order logic · propositional logic

Subclass of: logical system
Part of: logic
, mathematical logic

Overview

From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0

Propositional logic is a branch of classical logic. It is also called statement logic, sentential calculus, propositional calculus, sentential logic, or sometimes zeroth-order logic. Sometimes, it is called first-order propositional logic to contrast it with System F, but it is distinct from first-order logic. It deals with propositions and relations between propositions, including the construction of arguments based on them. Compound propositions are formed by connecting propositions by logical connectives representing the truth functions of conjunction, disjunction, implication, biconditional, and negation. Some sources include other connectives, as in the table below.

Overview

All data

40 statements · 18% with external sources · numbers in brackets are citations

Defining formula: P \to Q, P \vdash Q
Is the study of: propositional formula
Different from: zeroth-order logic
Said to be the same as: propositional logic
Has characteristic: validity
Permanent duplicated item: propositional logic

On other databases

29 identifiers linking propositional calculus across the web's reference databases

Data quality

statements

18%

externally sourced

Source last edited September 28, 2026. AIDB refreshes this page daily.

Suggest a fact or correction

Links

Use this data

curl https://aidb.si/api/v1/entities/Q200694

API docs, limits & keys

Cite this page

AIDB. (2026). propositional calculus (Q200694). Retrieved from https://aidb.si/e/propositional-calculus-Q200694