Propositional logic statements are statements that are either true or false, and do not contain any variables.

Predicate logic statements are statements that contain variables, and can be either true or false depending on the values of the variables.

Propositional logic connectives are symbols that connect propositional logic statements together.

Predicate logic quantifiers are symbols that specify the range of values that a variable can take.

Propositional logic fallacies are arguments that are not logically valid.

Predicate logic fallacies are arguments that are not logically valid.

Propositional logic theorems are statements that are true in all cases.

Predicate logic theorems are statements that are true in all cases.

Propositional logic models are representations of propositional logic statements that allow us to determine their truth values.

Predicate logic models are representations of predicate logic statements that allow us to determine their truth values.

Propositional logic proof systems are systems of rules that allow us to derive new propositional logic statements from given propositional logic statements.

Predicate logic proof systems are systems of rules that allow us to derive new predicate logic statements from given predicate logic statements.

Propositional logic has applications in computer science, mathematics, and philosophy.

Predicate logic has applications in computer science, mathematics, and philosophy.

Propositional Prolog, SAT Solver, and ASP Solver are all propositional logic programming languages.

First-Order Prolog, Datalog, and Answer Set Programming are all predicate logic programming languages.