Jump to content
Wikipedia The Free Encyclopedia

Abstract logic

From Wikipedia, the free encyclopedia
Formal system in mathematical logic
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 that is countably compact and has Löwenheim number ω.[2]

See also

[edit ]

References

[edit ]
  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
General
Theorems (list)
 and paradoxes
Logics
Traditional
Propositional
Predicate
Set theory
Types of sets
Maps and cardinality
Set theories
Formal systems (list),
language and syntax
Example axiomatic
systems
 (list)
Proof theory
Model theory
Computability theory
Related
Stub icon

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

AltStyle によって変換されたページ (->オリジナル) /