Propositional calculus is a branch of formal logic concerned with propositions that are either true or false and with the logical connectives that combine them. It does not reason about objects, predicates, or quantifiers, but it provides a foundational framework for logical inference used in computer science and AI.
(Also propositional logic, statement logic, sentential calculus, sentential logic, and zeroth-order logic.) A branch of logic which deals with propositions (which can be true or false) and argument flow. Compound propositions are formed by connecting propositions by logical connectives. The propositions without logical connectives are called atomic propositions. Unlike first-order logic, propositional logic does not deal with non-logical objects, predicates about them, or quantifiers. However, all the machinery of propositional logic is included in first-order logic and higher-order logics. In