SearcharxivSearch

arXiv · 2402.01245

Continuous logic in a classical setting

Abstract

Let $\mathcal{L}$ be a first-order two-sorted language and consider a class of $\mathcal{L}$-structures of the form $\langle M, X \rangle$ where $M$ varies among structures of the first sort, while $X$ is fixed in the second sort, and it is assumed to be a compact Hausdorff space. When $X$ is a compact subset of the real line, one way to treat classes of this kind model-theoretically is via continuous-valued logic, as in [Ben Yaacov-Berenstein-Henson-Usvyatsov 2010]. Prior to that, Henson and Iovino proposed an approach based on the notion of positive formulas [Henson-Iovino 2002]. Their work is tailored to the model theory of Banach spaces. Here we show that a similar approach is possible for a more general class of models. We introduce suitable versions of elementarity, compactness, saturation, quantifier elimination and other basic tools, and we develop basic model theory.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Claudio Agostini, Stefano Baratella, Silvia Barbina, Luca Motto Ros, Domenico Zambella. 2024-02-02. Continuous logic in a classical setting. https://doi.org/10.1007/s41980-025-00989-x

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