On uniform definability of types over finite sets

Journal of Symbolic Logic 77 (2):499-514 (2012)
  Copy   BIBTEX

Abstract

In this paper, using definability of types over indiscernible sequences as a template, we study a property of formulas and theories called "uniform definability of types over finite sets" (UDTFS). We explore UDTFS and show how it relates to well-known properties in model theory. We recall that stable theories and weakly o-minimal theories have UDTFS and UDTFS implies dependence. We then show that all dp-minimal theories have UDTFS

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1333566634

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

My notes

Similar books and articles

The ordertype of β-r.E. Sets.Klaus Sutner - 1990 - Journal of Symbolic Logic 55 (2):573-576.
Definability and definable groups in simple theories.Anand Pillay - 1998 - Journal of Symbolic Logic 63 (3):788-796.
Games and definability for FPC.Guy McCusker - 1997 - Bulletin of Symbolic Logic 3 (3):347-362.
Recursively enumerable sets which are uniform for finite extensions.Donald A. Alton - 1971 - Journal of Symbolic Logic 36 (2):271-287.
Lascar Types and Lascar Automorphisms in Abstract Elementary Classes.Tapani Hyttinen & Meeri Kesälä - 2011 - Notre Dame Journal of Formal Logic 52 (1):39-54.
The First-Order Structure of Weakly Dedekind-Finite Sets.A. C. Walczak-Typke - 2005 - Journal of Symbolic Logic 70 (4):1161 - 1170.
Admissible sets and structures: an approach to definability theory.Jon Barwise - 1975 - New York: Springer Verlag.
Sets and Point-Sets: Five Grades of Set-Theoretic Involvement in Geometry.John P. Burgess - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:456 - 463.
On intermediate predicate logics of some finite Kripke frames, I. levelwise uniform trees.Dmitrij Skvortsov - 2004 - Studia Logica 77 (3):295 - 323.
A new symbolic representation for the algebra of sets.Jerome Frazee - 1990 - History and Philosophy of Logic 11 (1):67-75.
Definability, automorphisms, and dynamic properties of computably enumerable sets.Leo Harrington & Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (2):199-213.
Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames.A. V. Chagrov & L. A. Chagrova - 1995 - Studia Logica 55 (3):421 - 448.
On external Scott algebras in nonstandard models of peano arithmetic.Vladimir Kanovei - 1996 - Journal of Symbolic Logic 61 (2):586-607.
Hereditary undecidability of some theories of finite structures.Ross Willard - 1994 - Journal of Symbolic Logic 59 (4):1254-1262.
Definability in number fields.S. P. Tung - 1987 - Journal of Symbolic Logic 52 (1):152-155.

Analytics

Added to PP
2012-04-05

Downloads
38 (#410,745)

6 months
11 (#225,837)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Indiscernibles, EM-Types, and Ramsey Classes of Trees.Lynn Scow - 2015 - Notre Dame Journal of Formal Logic 56 (3):429-447.
Hypergraph sequences as a tool for saturation of ultrapowers.M. E. Malliaris - 2012 - Journal of Symbolic Logic 77 (1):195-223.
On VC-minimal theories and variants.Vincent Guingona & Michael C. Laskowski - 2013 - Archive for Mathematical Logic 52 (7-8):743-758.

View all 7 citations / Add more citations

References found in this work

Classification Theory and the Number of Nonisomorphic Models.S. Shelah - 1982 - Journal of Symbolic Logic 47 (3):694-696.

Add more references