Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1804.00279

Coset relation algebras

H. Andréka·S. Givant
View original source ↗Read source document ↗Export metadata ↓

Abstract

A measurable relation algebra is a relation algebra in which the identity element is a sum of atoms that can be measured in the sense that the "size" of each such atom can be defined in an intuitive and reasonable way (within the framework of the first-order theory of relation algebras). A large class of examples of such algebras, using systems of groups and coordinated systems of isomorphisms between quotients of the groups, has been constructed. This class of group relation algebras is not large enough to exhaust the class of all measurable relation algebras. In the present article, the class of examples of measurable relation algebras is considerably extended by adding one more ingredient to the mix: systems of cosets that are used to "shift" the operation of relative multiplication. It is shown that, under certain additional hypotheses on the system of cosets, each such coset relation algebra with a shifted operation of relative multiplication is an example of a measurable relation algebra. We also show that the class of coset relation algebras does contain examples that are not representable as set relation algebras. In a later article, it is shown that the class of coset relation algebras is adequate to the task of describing all measurable relation algebras in the sense that every atomic measurable relation algebra is essentially isomorphic to a coset relation algebra.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

H. Andréka, S. Givant. 2018-04-01. Coset relation algebras. https://doi.org/10.1007/s00012-018-0516-x

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↗