Lukas' Notes

Satisfiable Formula (Propositional Logic)

1 min read

Definition

Satisfiable Formula (Propositional Logic)

A propositional formula is satisfiable if there exists a interpretation that makes it true.

Backlinks

June 21st, 2024 (1st Exam for SS 2024)
June 26th, 2024 (1st Exam for SS 2024)
October 11, 2024 (2nd Exam for SS 2024)
Splitting Preserves Satisfiability, Not Equivalence
Countermodel (Propositional Logic)
Entailment (Propositional Logic)
Entailment–Unsatisfiability Duality (Propositional Logic)
Satisfiability as Non-Equivalence to Falsum (Propositional Logic)
Splitting (Propositional Logic)
Splitting Algorithm (Propositional Logic)
Splitting Tree (Propositional Logic)
Tableaux (Propositional Logic)

Created with Quartz v4.5.2 © 2026

GitHub