Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T10:28:13.460Z Has data issue: false hasContentIssue false

Theory of models with generalized atomic formulas

Published online by Cambridge University Press:  12 March 2014

H. Jerome Keisler*
Affiliation:
California Institute of Technology

Introduction

We shall prove the following theorem, which gives a necessary and sufficient condition for an elementary class to be characterized by a set of sentences having a prescribed number of alternations of quantifiers. A finite sequence of relational systems is said to be a sandwich of order n if each is an elementary extension of (i ≦ n—2), and each is an extension of (i ≦ n—2). If K is an elementary class, then the statements (i) and (ii) are equivalent for each fixed natural number n.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1960

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