## Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

## If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

# Automorphism Properties of Stationary Logic

Martin Otto
The Journal of Symbolic Logic
Vol. 57, No. 1 (Mar., 1992), pp. 231-237
DOI: 10.2307/2275187
Stable URL: http://www.jstor.org/stable/2275187
Page Count: 7
Preview not available

## Abstract

By means of an Ehrenfeucht-Mostowski construction we obtain an automorphism theorem for a syntactically characterized class of Laa-theories comprising in particular the finitely determinate ones. Examples of Laa-theories with only rigid models show this result to be optimal with respect to a classification in terms of prenex quantifier type: Rigidity is seen to hinge on quantification of type $\ldots\forall\ldots\mathbf{\operatorname{stat}}\ldots$ permitting of the parametrization of families of disjoint stationary systems by the elements of the universe.

• 231
• 232
• 233
• 234
• 235
• 236
• 237