Notes on cardinals that are characterizable by a complete (Scott) sentence

Characterizing the powerset by a complete (Scott) sentence

This paper is part II of a study on cardinals that are characterizable by a Scott sentence, continuing the work from http://arxiv.org/abs/1007.2426v1. A cardinal $κ$ is characterized by a Scott sentence $ϕ_M$, if $ϕ_M$ has a model of size $κ$, but no model of $κ^+$. The main question in this paper is the following: Are the characterizable cardinals closed under the powerset operation? We prove that if $\aleph_β$ is characterized by a Scott sentence, then $2^{\aleph_{β+β_1}}$ is (homogeneously) characterized by a Scott sentence, for all $0<β_1<ω_1$. So, the answer to the above question is posit…

Linear Orderings and Powers of Characterizable Cardinal

The current paper answers an open question of abs/1007.2426 We say that a countable model M characterizes an infinite cardinal kappa, if the Scott sentence of M has a model in cardinality kappa, but no models in cardinality kappa plus. If M is linearly ordered by <, we will say that the linear ordering (M,<) characterizes kappa. It is known that if kappa is characterizable, then kappa plus is characterizable by a linear ordering. Also, if kappa is characterizable by a dense linear ordering with an increasing sequence of size kappa, then 2^kappa is characterizable. We show that if kappa is homo…

Hanf Number for Scott Sentences of Computable Structures

The Hanf number for a set $S$ of sentences in $L_{ω_1,ω}$ (or some other logic) is the least infinite cardinal $κ$ such that for all $φ\in S$, if $φ$ has models in all infinite cardinalities less than $κ$, then it has models of all infinite cardinalities. S-D. Friedman asked what is the Hanf number for Scott sentences of computable structures. We show that the value is $\beth_{ω_1^{CK}}$. The same argument proves that $\beth_{ω_1^{CK}}$ is the Hanf number for Scott sentences of hyperarithmetical structures.

可数完全海廷代数乘积上的斯科特拓扑

Scott topologies on products of countable complete Heyting algebras

本文证明斯科特拓扑与可数表示框架的任意乘积相容且乘积空间是素谱的，并指出可数生成不足以保证该性质，同时给出阿廷空间与代数 dcpo 的关联及二分法定理。

Borel Complexity and Potential Canonical Scott Sentences

We define and investigate HC-forcing invariant formulas of set theory, whose interpretations in the hereditarily countable sets are well behaved under forcing extensions. This leads naturally to a notion of cardinality ||Phi|| for sentences Phi of $L_{ω_1,ω}$, which counts the number of sentences of $L_{\infty,ω}$ that, in some forcing extension, become a canonical Scott sentence of a model of Phi. We show this cardinal bounds the complexity of (Mod(Phi), iso), the class of models of Phi with universe omega, by proving that (Mod(Phi),iso) is not Borel reducible to (Mod(Psi),iso) whenever ||Psi…

The Joint Embedding Property and Maximal Models

We introduce the notion of a `pure` Abstract Elementary Class to block trivial counterexamples. We study classes of models of bipartite graphs and show: Main Theorem (cf. Theorem 3.5.2 and Corollary 3.5.6): If $(λ_i : i \le α<\aleph_1)$ is a strictly increasing sequence of characterizable cardinals (Definition 2.1) whose models satisfy JEP$(<λ_0)$, there is an $L_{ω_1,ω}$ -sentence $ψ$ whose models form a pure AEC and (1) The models of $ψ$ satisfy JEP$(<λ_0)$, while JEP fails for all larger cardinals and AP fails in all infinite cardinals. (2) There exist $2^{λ_i^+}$ non-isomorphic maximal mod…