Hostname: page-component-7b7567c8c-mnklg Total loading time: 0 Render date: 2026-11-12T17:50:54.465Z Has data issue: false hasContentIssue false

Finitely based theories

Published online by Cambridge University Press:  12 March 2014

Ehud Hrushovski*
Affiliation:
Department of Mathematics, Princeton University, Princeton, New Jersey 08544Department of Mathematics, Rutgers University, New Brunswick, New Jersey 08903

Abstract

A stable theory is finitely based if every set of indiscernibles is based on a finite subset. This is a common generalization of superstability and 1-basedness. We show that if such theories have more than one model they must have infinitely many, and prove some other conjectures.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1989

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable