Concept

Atomic formula

Related lectures (17)

Covers Sequent Calculus with Equality, focusing on atomic formulas and substitution rules.

Explores Second Order Logic, WS1S, HOL, decision procedures, atomic and composite formulas, and the combination of WS1S with MONA in HOL.

Introduction to Quantifier Elimination for Presburger Arithmetic

Introduces formal verification methodology and Presburger arithmetic for program verification and automated reasoning.

Structural Induction

Introduces structural induction, a method to prove properties of elements in recursively defined sets.

Structural Induction

Introduces structural induction, a method to prove properties of elements in recursively defined sets.

Untitled

Propositional Logic: Basic Logical Connectives

Covers propositions, logical connectives, truth tables, and propositional logic language.

Logical Formulas and Types: Understanding the Kerry Howard Isomorphism

Explores the Kerry Howard Isomorphism, translating logical propositions into types and terms, with a focus on proof by induction and exam preparation.

Formal Proofs: Checking Invariants and Bounded Model Checking

Explores formal proofs, satisfiability problems, and inductive invariants using SAT queries in sequential circuits.

Finite Systems Expressed with Formulas

Explores finite transition systems, propositional logic, truth interpretation, satisfiability, and boolean function representation with circuits.

Induction for SMT Solvers

Explores techniques for induction in SMT solvers, focusing on CVC4's implementation and competitive performance with other provers.

Geometric Curve Reparameterization

Covers the reparameterization of geometric curves and the concept of 'same geometric curve'.

Propositional Logic: Normal Forms

Explores Disjunctive Normal Form and Conjunctive Normal Form in propositional logic, showing how to construct them and discussing their complexity.

Model Formulas in R: Basics and Applications

Explores model formulas in R, covering basics, interactions, ANOVA, and factorial designs with practical examples.

Propositional Logic: Normal Forms

Explains constructing DNF and CNF in propositional logic and their complexity.

Gauss-Legendre Quadrature Formulas

Explores Gauss-Legendre quadrature formulas using Legendre polynomials for accurate function approximation.

Memory Consistency: Taking it to the Compiler

Explores memory consistency, weak consistency, and language-level guarantees in memory ordering, emphasizing the importance of data race free programming.