Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2103.00563

The strong amalgamation property into union

Paolo Lipparini
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the situation in which some class of structures has the Strong Amalgamation Property (SAP) with the further requirement that the amalgamating structure can be taken over the set theoretical union of (the images of) the domains of the structures to be amalgamated. We call this property SAPU. The main advantage of SAPU over SAP is that there are many preservation theorems showing that we can merge different theories with SAPU still obtaining a theory with SAPU, hence with SAP. In particular, we get SAPU for various theories with many binary relations, each relation satisfying any set of properties chosen among transitivity, reflexivity, symmetry, antireflexivity, antisymmetry. We may also add unary operations, possibly satisfying some coarseness, isotonicity and closure conditions. SAPU is not limited to relational theories: the varieties defining the most usual Maltsev conditions in universal algebra have SAPU. Other examples include bounded directoids, order algebras and various generalization.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Paolo Lipparini. 2021-02-28. The strong amalgamation property into union. https://arxiv.org/abs/2103.00563

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗