SearcharxivSearch

arXiv · 2301.09940

A Lopez-Escobar Theorem for Continuous Domains

Abstract

We prove an effective version of the Lopez-Escobar theorem for continuous domains. Let $Mod(\tau)$ be the set of countable structures with universe $\omega$ in vocabulary $\tau$ topologized by the Scott topology. We show that an invariant set $X \subseteq Mod(\tau)$ is $\Pi^0_\alpha$ in the effective Borel hierarchy of this topology if and only if it is definable by a $\Pi^p_\alpha$ - formula, a positive $\Pi^0_\alpha$ formula in the infinitary logic $L_{\omega_1,\omega}$. As a corollary of this result we obtain a new pullback theorem for positive computable embeddings: Let $K$ be positively computably embeddable in $K'$ by $\Phi$, then for every $\Pi^p_\alpha$ formula $\xi$ in the vocabulary of $K'$ there is a $\Pi^p_\alpha$ formula $\xi^\star$ in the vocabulary of $K$ such that for all $A \in K$, $A \models \xi^\star$ if and only if $\Phi(A) \models \xi$. We use this to obtain new results on the possibility of positive computable embeddings into the class of linear orderings.

Explore related subjects

Keep this discovery

BibTeXRIS

Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger, Alexandra A. Soskova, Stefan V. Vatev. 2023-01-24. A Lopez-Escobar Theorem for Continuous Domains. https://doi.org/10.1017/jsl.2024.18

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