Jump to content

Abstract logic

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Steel1943 (talk | contribs) at 15:42, 17 September 2019 (→References: ce). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

For other uses, see Abstract logic (disambiguation).

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

  1. ^ C. C. Chang and Jerome Keisler Model Theory, 1990 ISBN 0-444-88054-2 page 128
  2. ^ C. C. Chang and Jerome Keisler Model Theory, 1990 ISBN 0-444-88054-2 page 132


Stub icon

This mathematical logic-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Abstract_logic&oldid=916197293"