Related papers: Model Theory of the Inaccessibility Scheme

A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…

Let T be a complete, first-order theory in a finite or countable language having infinite models. Let I(T,kappa) be the number of isomorphism types of models of T of cardinality \kappa. We denote by \mu (respectively \hat\mu) the number of…

Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…

Ordinary infinitary languages L_{lambda, kappa} satisfy the Interpolation Theorem only in the case lambda <= {aleph_1}, kappa = {aleph_0}, this include first order logic of course. There are also some pairs of such logics satifying…

We study the Borel-reducibility of isomorphism relations in the generalized Baire space $\kappa^\kappa$. In the main result we show for inaccessible $\kappa$, that if $T$ is a classifiable theory and $T'$ is superstable with the strong…

Given a first-order theory $T$ formulated in the usual language of first-order arithmetic, we say that $T$ is of *restricted complexity* if there is some natural number $n$ and some set $\mathcal A$ of $\Sigma_n$-sentences such that $T$ can…

Large cardinals arising from the existence of arbitrarily long end elementary extension chains over models of set theory are studied here. In particular, we show that the large cardinals obtained that way (`Unfoldable cardinals') behave as…

Let $\kappa$ be a regular cardinal, $\lambda<\kappa$ be a smaller infinite cardinal, and $\mathsf K$ be a $\kappa$-accessible category where colimits of $\lambda$-indexed chains exist. We show that various category-theoretic constructions…

We present an approach to approximate reachable sets for linear systems with bounded L-infinity controls in finite time. Our first approach investigates the boundaries of these sets and reveals an exact characterization for single-input,…

A structure ${\mathbb Y}$ of a relational language $L$ is called almost chainable iff there are a finite set $F \subset Y$ and a linear order $<$ on the set $Y\setminus F$ such that for each partial automorphism $\varphi$ (i.e., local…

Given a regular cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$ (e.g., if the Generalized Continuum Hypothesis holds), we develop a proof system for classical infinitary logic that includes heterogeneous quantification (i.e., infinite…

The theme of the first two sections, is to prepare the framework of how from a ``complicated'' family of so called index models $I \in K_1$ we build many and/or complicated structures in a class $K_2$. The index models are…

Given a weakly compact cardinal $\kappa$, we give an axiomatization of intuitionistic first-order logic over $\mathcal{L}_{\kappa^+, \kappa}$ and prove it is sound and complete with respect to Kripke models. As a consequence we get the…

We initiate a complexity theoretic study of the language based graph reachability problem (L-REACH) : Fix a language L. Given a graph whose edges are labeled with alphabet symbols of the language L and two special vertices s and t, test if…

For a cardinal of the form $\kappa=\beth_\kappa$, Shelah's logic $L^1_\kappa$ has a characterisation as the maximal logic above $\bigcup_{\lambda<\kappa} L_{\lambda, \omega}$ satisfying Strong Undefinability of Well Order (SUDWO). SUDWO is…

This the first of a series of articles dealing with abstract classification theory. The apparatus to assign systems of cardinal invariants to models of a first order theory (or determine its impossibility) is developed in [Sh:a]. It is…

We investigate an extension of ZFC set theory (in an extended language) that stipulates the existence of a proper class of indiscernibles over the universe. One of the main results of the paper shows that the purely set-theoretical…

We study the continuous reducibility of isomorphism relations in the space of regresive functions in $\kappa^\kappa$. We show for inaccessible $\kappa$, that if $\mathcal{T}$ is a theory with less than $\kappa$ non-isomorphic models of size…

We prove that some natural "outside" property is equivalent (for a first order class) to being stable. For a model, being resplendent is a strengthening of being kappa-saturated. Restricting ourselves to the case kappa > |T| for…

In the original version of this paper, we assume a theory $T$ that the logic $\mathbb L_{\kappa, \aleph_{0}}$ is categorical in a cardinal $\lambda > \kappa$, and $\kappa$ is a measurable cardinal. There we prove that the class of model of…