Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1502.07701

Problems on neat embeddings solved by rainbow constructions and Monk algebras

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

Abstract

This paper is a survey of recent results and methods in (Tarskian) algebraic logic. We focus on cylindric algebras. Fix 2<n<\omega. Rainbow constructions are used to solve problems on classes consisting of algebras having a neat embedding property substantially generalizing seminal results of Hodkinson as well as Hirsch and Hodkinson on atom-canonicity and complete representations, respectively. For proving non-atom-canonicity of infinitely many varieties approximating the variety of representable algebras of dimension n, so-called blow up and blur constructions are used. Rainbow constructions are compared to constructions using Monk-like algebras and cases where both constructions work are given. When splitting methods fail. rainbow constructions are used to show that diagonal free varieties of representable diagonal free algebras of finite dimension n, do no admit universal axiomatizations containing only finitely many variables. Notions of representability, like complete, weak and strong are lifted from atom structures to atomic algebras and investigated in terms of neat embedding properties. The classical results of Monk and Maddux on non-finite axiomatizability of the classes of representable relation and cylindric algebras of finite dimension n are reproved using also a blow up and blur construction. Applications to n-variable fragments of first order logic are given. The main results of the paper are summarized in tabular form at the end of the paper.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Tarek Sayed Ahmed. 2015-02-03. Problems on neat embeddings solved by rainbow constructions and Monk algebras. https://arxiv.org/abs/1502.07701

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↗