Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1304.5152

Blow up and Blur constructions in Algebraic Logic

Tarek Sayed Ahmed
View original source ↗Read source document ↗Export metadata ↓

Abstract

The idea in the title is to blow up a finite structure, replacing each 'colour or atom' by infinitely many, using blurs to represent the resulting term algebra, but the blurs are not enough to blur the structure of the finite structure in the complex algebra. Then, the latter cannot be representable due to a {finite- infinite} contradiction. This structure can be a finite clique in a graph or a finite relation algebra or a finite cylindric algebra. This theme gives examples of weakly representable atom structures that are not strongly representable. Many constructions existing in the literature are placed in a rigorous way in such a framework, properly defined. This is the essence too of construction of Monk like-algebras, one constructs graphs with finite colouring (finitely many blurs), converging to one with infinitely many, so that the original algebra is also blurred at the complex algebra level, and the term algebra is completey representable, yielding a representation of its completion the complex algebra. A reverse of this process exists in the literature, it builds algebras with infinite blurs converging to one with finite blurs. This idea due to Hirsch and Hodkinson, uses probabilistic methods of Erdos to construct a sequence of graphs with infinite chromatic number one that is 2 colourable. This construction, which works for both relation and cylindric algebras, further shows that the class of strongly representable atom structures is not elementary.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Tarek Sayed Ahmed. 2013-04-17. Blow up and Blur constructions in Algebraic Logic. https://arxiv.org/abs/1304.5152

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↗