Forking and Incomplete Types

Mathematical Logic Quarterly 42 (1):421-432 (1996)
  Copy   BIBTEX

Abstract

Let Δ be a set of formulas. In this paper we study the following question: under what assumptions on Δ, the concept “a complete Δ-type p over B does not fork over A ⊆ B” behaves well. We apply the results to the structure theory of ω1-saturated models

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The stable forking conjecture and generic structures.Massoud Pourmahdian - 2003 - Archive for Mathematical Logic 42 (5):415-421.
Properties and Consequences of Thorn-Independence.Alf Onshuus - 2006 - Journal of Symbolic Logic 71 (1):1 - 21.
Stable types in rosy theories.Assaf Hasson & Alf Onshuus - 2010 - Journal of Symbolic Logic 75 (4):1211-1230.
Geometry of Forking in Simple Theories.Assaf Peretz - 2006 - Journal of Symbolic Logic 71 (1):347 - 359.
Simplicity, and stability in there.Byunghan Kim - 2001 - Journal of Symbolic Logic 66 (2):822-836.
Forking in VC-minimal theories.Sarah Cotter & Sergei Starchenko - 2012 - Journal of Symbolic Logic 77 (4):1257-1271.
Forking and dividing in NTP₂ theories.Artem Chernikov & Itay Kaplan - 2012 - Journal of Symbolic Logic 77 (1):1-20.
Thorn-forking as local forking.Hans Adler - 2009 - Journal of Mathematical Logic 9 (1):21-38.
A geometric introduction to forking and thorn-forking.Hans Adler - 2009 - Journal of Mathematical Logic 9 (1):1-20.
Regular types in nonmultidimensional ω-stable theories.Anand Pillay - 1984 - Journal of Symbolic Logic 49 (3):880-891.

Analytics

Added to PP
2013-12-01

Downloads
12 (#1,058,801)

6 months
3 (#992,474)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references