Abstract logic
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 which is countably compact and has Löwenheim number ω.[2]
See also
References
- C. C. Chang and Jerome Keisler Model Theory, 1990 ISBN 0-444-88054-2 page 128
- C. C. Chang and Jerome Keisler Model Theory, 1990 ISBN 0-444-88054-2 page 132
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.