Strongly determined types

Annals of Pure and Applied Logic 99 (1-3):197-230 (1999)
  Copy   BIBTEX

Abstract

The notion of a strongly determined type over A extending p is introduced, where p .S. A strongly determined extension of p over A assigns, for any model M )- A, a type q S extending p such that, if realises q, then any elementary partial map M → M which fixes acleq pointwise is elementary over . This gives a crude notion of independence which arises very frequently. Examples are provided of many different kinds of theories with strongly determined types, and some without. We investigate a notion of multiplicity for strongly determined types with applications to ‘involved’ finite simple groups, and an analogue of the Finite Equivalence Relation Theorem. Lifting of strongly determined types to covers of a structure is discussed, and an application to finite covers is given

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

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

On Kueker's conjecture.Predrag Tanović - 2012 - Journal of Symbolic Logic 77 (4):1245-1256.
Types, indicated and initiated.Robert Howell - 2002 - British Journal of Aesthetics 42 (2):105-127.
Determinateness of certain almost-borel games.Robert S. Wolf - 1985 - Journal of Symbolic Logic 50 (3):569-579.
Regular types in nonmultidimensional ω-stable theories.Anand Pillay - 1984 - Journal of Symbolic Logic 49 (3):880-891.
DMP in Strongly Minimal Sets.Assaf Hasson & Ehud Hrushovski - 2007 - Journal of Symbolic Logic 72 (3):1019 - 1030.

Analytics

Added to PP
2014-01-16

Downloads
20 (#656,480)

6 months
6 (#203,358)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Simple theories.Byunghan Kim & Anand Pillay - 1997 - Annals of Pure and Applied Logic 88 (2-3):149-164.
ℵ0-Categorical, ℵ0-stable structures.G. Cherlin, L. Harrington & A. H. Lachlan - 1985 - Annals of Pure and Applied Logic 28 (2):103-135.
An introduction to forking.Daniel Lascar & Bruno Poizat - 1979 - Journal of Symbolic Logic 44 (3):330-350.
On variants of o-minimality.Dugald Macpherson & Charles Steinhorn - 1996 - Annals of Pure and Applied Logic 79 (2):165-209.
A version of o-minimality for the p-adics.Deirdre Haskell & Dugald Macpherson - 1997 - Journal of Symbolic Logic 62 (4):1075-1092.

View all 23 references / Add more references