SearcharxivSearch

arXiv · 1312.0222

Asymmetric regular types

Abstract

We study asymmetric regular types. If $\frak p$ is regular and $A$-asymmetric then there exists a strict order such that Morley sequences in $\frak p$ over $A$ are strictly increasing (we allow Morley sequences to be indexed by elements of a linear order). We prove that for all $M\supseteq A$ maximal Morley sequences in $\frak p$ over $A$ consisting of elements of $M$ have the same (linear) order type, denoted by $\Inv_{\frak p,A}(M)$, which does not depend on the particular choice of the order witnessing the asymmetric regularity. In the countable case we determine all possibilities for $\Inv_{\frak p,A}(M)$: either it can be any countable linear order, or in any $M\supseteq A$ it is a dense linear order (provided that it has at least two elements). Then we study relationship between $\Inv_{\frak p,A}(M)$ and $\Inv_{\frak q,A}(M)$ when $\frak p$ and $\frak q$ are strongly regular, $A$-asymmetric, and such that $\frak p_{\strok A}$ and $\frak q_{\strok A}$ are not weakly orthogonal. We distinguish two kinds on non-orthogonality: bounded and unbounded. In the bounded case we prove that $\Inv_{\frak p,A}(M)$ and $\Inv_{\frak q,A}(M)$ are either isomorphic or anti-isomorphic. In the unbounded case, $\Inv_{\frak p,A}(M)$ and $\Inv_{\frak q,A}(M)$ may have distinct cardinalities but we prove that their Dedekind completions are either isomorphic or anti-isomorphic. We provide examples of all four situations.

Explore related subjects

Keep this discovery

BibTeXRIS

Slavko Moconja, Predrag Tanović. 2013-12-01. Asymmetric regular types. https://doi.org/10.1016/j.apal.2014.09.003

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