Abstract logic
Jump to navigation
Jump to search
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]
See also
[edit | edit source]- Abstract algebraic logic – Study of the algebraization of deductive systems, based on the Lindenbaum–Tarski algebra
- Lua error in Module:GetShortDescription at line 33: attempt to index field 'wikibase' (a nil value).
- Löwenheim number – Smallest cardinal number for which a weak downward Löwenheim–Skolem theorem holds
- Lindström's theorem – Theorem in mathematical logic
- Universal logic – Subfield of logic that studies the features common to all logical systems
References
[edit | edit source]- ^ C. C. Chang and Jerome Keisler Model Theory, 1990 Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). page 128
- ^ C. C. Chang and Jerome Keisler Model Theory, 1990 Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). page 132
 | This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |