A Purely Algebraic Proof Of The Omitting Types Theorem

Bulletin of the Section of Logic 8 (1):7-9 (1979)
  Copy   BIBTEX

Abstract

In the present note we make use of some information given in [2]. Also, the terminology and notation do not dier from those accepted in [2]; in particular this concerns the formalism for the predicate calculus. Let A be a model of a rst-order language L. We say that A realizes a set of formulas Fla i A j= [a] for some valuation a in A and all 2 . We say that A omits i A does not realize . A formula 2 Fla is consistent with a theory T in i there is a model of T which realizes fg

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,932

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Remarks on Floyd-Hoare derivability.Laszlo Csirmaz - 1980 - Bulletin of the Section of Logic 9 (3):131-133.
Omitting types in fuzzy logic with evaluated syntax.Petra Murinová & Vilém Novák - 2006 - Mathematical Logic Quarterly 52 (3):259-268.
Characterization of NIP theories by ordered graph-indiscernibles.Lynn Scow - 2012 - Annals of Pure and Applied Logic 163 (11):1624-1641.
Completeness of Floyd logic.Hajnal Andreka & Istvan Nemeti - 1978 - Bulletin of the Section of Logic 7 (3):115-119.
Definability of types, and pairs of o-minimal structures.Anand Pillay - 1994 - Journal of Symbolic Logic 59 (4):1400-1409.
Lindenbaum's extensions.Andrzej Biela & Teodor Stepien - 1981 - Bulletin of the Section of Logic 10 (1):42-46.

Analytics

Added to PP
2015-02-02

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Janusz Czelakowski
University of Opole

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references