Submission date: 25 January 2014.

Abstract:

Suppose L={<, ... } is any countable first order language in which < is always interpreted as a linear ordering and T is an L-theory such that T has a θ-like model where θ is a strongly inaccessible cardinal. In this technical paper we study the model theory of T and initiate a new line of investigations towards two old open questions in this topic.

Mathematics Subject Classification: 03C55, 03C64

Keywords and phrases: Elementary End Extension, Inaccessible-like Models

Full text: arXiv 1401.6535: pdf, ps.