Open Access
2006 Invariant Version of Cardinality Quantifiers in Superstable Theories
Alexander Berenstein, Ziv Shami
Notre Dame J. Formal Logic 47(3): 343-351 (2006). DOI: 10.1305/ndjfl/1163775441

Abstract

We generalize Shelah's analysis of cardinality quantifiers for a superstable theory from Chapter V of Classification Theory and the Number of Nonisomorphic Models. We start with a set of bounds for the cardinality of each formula in some general invariant family of formulas in a superstable theory (in Classification Theory, a uniform family of formulas is considered) and find a set of derived bounds for all formulas. The set of derived bounds is sharp: up to a technical restriction, every model that satisfies the original bounds has a sufficiently saturated elementary extension that satisfies the original bounds and such that for each formula the set of its realizations in the extension has arbitrarily large cardinality below the corresponding derived bound of the formula.

Citation

Download Citation

Alexander Berenstein. Ziv Shami. "Invariant Version of Cardinality Quantifiers in Superstable Theories." Notre Dame J. Formal Logic 47 (3) 343 - 351, 2006. https://doi.org/10.1305/ndjfl/1163775441

Information

Published: 2006
First available in Project Euclid: 17 November 2006

zbMATH: 1113.03029
MathSciNet: MR2264703
Digital Object Identifier: 10.1305/ndjfl/1163775441

Subjects:
Primary: 03C45 , 03C50

Keywords: cardinality quantifiers , superstable theories

Rights: Copyright © 2006 University of Notre Dame

Vol.47 • No. 3 • 2006
Back to Top