SearcharxivSearch

arXiv · 2311.15711

Standard analysis

Abstract

Let $\mathcal{L}$ be a first-order two-sorted language. Let $S$ be some fixed structure. A standard structure is an $\mathcal{L}$-structure of the form $(M,S)$, where $M$ is arbitrary. When $S$ is a compact topological space (and $\mathcal{L}$ meets a few additional requirements) it is possible to adapt a significant part of model theory to the restricted class of standard structures. This has been shown by Henson and Iovino for normed spaces and has been generalized to a larger class of structures in [AAVV]. We further generalize their approach to a significantly larger class. The starting point is to prove that every standard structure has a positive elementary extension that is standard and realizes all positive types that are finitely consistent. A second important step is to prove that (in a sufficiently saturated structure) the negation of a positive formula is equivalent to to an infinite (but small) disjunction of positive formulas. The main tool is the notion of approximation of a positive formula and of its negation that have been introduced by Henson and Iovino. We review and elaborate on the properties of positive formulas and their approximations. In parallel, we introduce continuous formulas which provide a better counterpart to Henson and Iovino theory of normed spaces and to the real-valued model theory of metric spaces [BBHU]. To demonstrate this setting in action we discuss countable categoricity and local stability.

Explore related subjects

Keep this discovery

BibTeXRIS

Domenico Zambella. 2023-11-27. Standard analysis. https://arxiv.org/abs/2311.15711

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