Jump to content

Abstract logic

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by VanishedUserABC (talk | contribs) at 09:43, 19 September 2010. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
For the musical album please see Abstract Logic (album)

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 0444880542 page 128
  2. ^ C. C. Chang and Jerome Keisler Model Theory, 1990 ISBN 0444880542 page 132