Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Propositions Calculation

Description

This lecture covers the calculation of propositions, focusing on predicate logic, with references to Bernays' work. Topics include logical formulas, annotations, and editing, with an emphasis on the logical connectives and satisfiability.

Official source

Ontological neighbourhood

Logic

Classical logic: First-order logic

Related concepts (25)

Logical connective

In logic, a logical connective (also called a logical operator, sentential connective, or sentential operator) is a logical constant. They can be used to connect logical formulas. For instance in the syntax of propositional logic, the binary connective can be used to join the two atomic formulas and , rendering the complex formula . Common connectives include negation, disjunction, conjunction, implication, and equivalence.

Logical conjunction

In logic, mathematics and linguistics, and () is the truth-functional operator of conjunction or logical conjunction. The logical connective of this operator is typically represented as or or (prefix) or or in which is the most modern and widely used. The and of a set of operands is true if and only if all of its operands are true, i.e., is true if and only if is true and is true. An operand of a conjunction is a conjunct.

Propositional calculus

Propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. It deals with propositions (which can be true or false) and relations between propositions, including the construction of arguments based on them. Compound propositions are formed by connecting propositions by logical connectives. Propositions that contain no logical connectives are called atomic propositions.

Logical truth

Logical truth is one of the most fundamental concepts in logic. Broadly speaking, a logical truth is a statement which is true regardless of the truth or falsity of its constituent propositions. In other words, a logical truth is a statement which is not only true, but one which is true under all interpretations of its logical components (other than its logical constants). Thus, logical truths such as "if p, then p" can be considered tautologies.

Logical disjunction

In logic, disjunction, also known as logical disjunction or logical or or logical addition or inclusive disjunction , is a logical connective typically notated as and read aloud as "or". For instance, the English language sentence "it is sunny or it is warm" can be represented in logic using the disjunctive formula , assuming that abbreviates "it is sunny" and abbreviates "it is warm". In classical logic, disjunction is given a truth functional semantics according to which a formula is true unless both and are false.

Related lectures (28)

Automating First-Order Logic Proofs Using Resolution

Covers first-order logic syntax, semantics, and resolution for proving properties.

Predicate Logic: Quantifiers and Truth Values

Explores existential quantifiers, truth values, and composite statements in predicate logic.

Introduction & Propositional Logic

Covers the basics of propositional logic, logical connectives, truth tables, and compound propositions.

Propositional Logic: Translations and Equivalences

Covers translating natural language to propositional logic and proving tautologies.

Propositional Logic: Basics and Applications