In mathematical logic, an abstract logic is a formal system consisting of a class of sentences and a satisfaction relation with specific properties related to occurrence, expansion, isomorphism, renaming and quantification.[1]
Based on Lindström's characterization, first-order logic is, up to equivalence, the only abstract logic that is countably compact and has Löwenheim number ω.[2]
General | |||||||||
---|---|---|---|---|---|---|---|---|---|
Theorems (list) and paradoxes | |||||||||
Logics |
| ||||||||
Set theory |
| ||||||||
Formal systems (list), language and syntax |
| ||||||||
Proof theory | |||||||||
Model theory | |||||||||
Computability theory | |||||||||
Related | |||||||||