Search arXivSearch

arXiv · 1012.3405

Linear Orderings and Powers of Characterizable Cardinal

Abstract

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 homogeneously characterizable, then kappa is characterizable by a dense linear ordering, while the converse fails. The main theorems are: 1) If kappa>2^lambda is a characterizable cardinal, lambda is characterizable by a dense linear ordering and lambda is the least cardinal such that kappa^lambda>kappa, then kappa^lambda is also characterizable, 2) if aleph_alpha and kappa^(aleph_alpha) are characterizable cardinals, then the same is true for kappa^(aleph_(alpha+beta)), for all countable beta. Combining these two theorems we get that if kappa>2^(aleph_alpha) is a characterizable cardinal, aleph_alpha is characterizable by a dense linear ordering and aleph_alpha is the least cardinal such that kappa^(aleph_alpha)>kappa, then for all beta<alpha+omega_1, kappa^(aleph_beta) is characterizable. Also if kappa is a characterizable cardinal, then kappa^(aleph_alpha) is characterizable, for all countable alpha.

Explore related subjects

Keep this discovery

BibTeXRIS

Ioannis Souldatos. 2010-12-15. Linear Orderings and Powers of Characterizable Cardinal. https://doi.org/10.1016/j.apal.2011.09.002

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO