Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T10:15:13.591Z Has data issue: false hasContentIssue false

Classification Theory and Stationary Logic

Published online by Cambridge University Press:  20 November 2018

Alan H. Mekler*
Affiliation:
Simon Fraser University, Burnaby, British Columbia
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Stationary logic L(aa) is obtained for Lωω by adding a quantifier aa which ranges over countable sets and is interpreted to mean “for a closed unbounded set of countable subsets”. The dual quantifier for aa is stat, i.e., stat sφ(s) is equivalent to ¬aa s ¬φ(s). In the study of the L(aa)-model theory of structures a particular well behaved class was isolated, the finitely determinate structures. These are structures in which the quantifier “stat” can be replaced by the quantifier “aa” without changing the validity of sentences. Many structures such as R and all ordinals are finitely determinate. In this paper we will be concerned with finitely determinate first order theories, i.e., those theories all of whose models are finitely determinate.

Example 0.1. [5] The theory of dense linear orderings is not finitely determinate. Let S be a stationary costationary subset of ω 1 and

where

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1987