SearcharxivSearch

arXiv · 1305.5269

Various interplays between relation and cylindric algebras

Abstract

Using model theoretic techniques that proved that the class of $n$ neat reducts of $m$ dimensional cylindric algebras, $\Nr_n\CA_m$, is not elementary, we prove the same result for $\Ra\CA_k$, $k\geq 5$, and we show that $\Ra\CA_k\subset S_c\Ra\CA_k$ for all $k\geq 5$. Conversely, using the rainbow construction for cylindric algebra, we show that several classes of algebras, related to the class $\Nr_n\CA_m$, $n$ finite and $m$ arbitrary, are not elementary. Our results apply to many cylindric-like algebras, including Pinter's substitution algebras and Halmos' polyadic algebras with and without equality. The techniques used are essentially those used by Hirsch and Hodkinson, and later by Hirsch in \cite{hh} and \cite{r}. In fact, the main result in \cite{hh} follows from our more general construction. Finally we blow up a little the {\it blow up and blur construction} of Andréka nd Németi, showing that various constructions of weakly representable atom structures that are not strongly representable, can be formalized in our blown up, blow up and blur construction, both for relation and cylindric algebras. Two open problems are discussed, in some detail, proposing ideas. One is whether class of subneat reducts are closed under completions, the other is whether there exists a weakly representable $ω$ dimensional atom structure, that is not strongly representable. For the latter we propose a lifting argument, due to Monk, applied to what we call anti-Monk algebras (the algebras, constructed by Hirsch and Hodkinson, are atomic, and their atom structure is stongly representable.)

Explore related subjects

Keep this discovery

BibTeXRIS

Tarek Sayed Ahmed. 2013-04-25. Various interplays between relation and cylindric algebras. https://arxiv.org/abs/1305.5269

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