Search arXivSearch

arXiv · 1408.3282

Atom-canonicity and complete representations for cylindric-like algebras, and omitting types for the clque guarded fragment of first order logic

Abstract

Fix a finite ordinal n>2. We show that there exists an atomic, simple and countable representable CA_n, such that its minimal completion is outside SNr_nCA_{n+3}. Hence, for any finite k\geq 3, the variety SNr_nCA_{n+k} is not atom-canonical, so that the variety of CA_n's having n+k-flat representations is not atom-canonical, too. We show, for finite k\geq 3, that S_cNr_nCA_{n+k} is not elementary, hence the class of CA_n's having complete n+3-smooth representations is not elementary. We obtain analogous results by replacing flat and smooth, respectively, by (the weaker notion of) square; this give a stronger result in both cases and here we can allow k to be infinite. Our results are proved using rainbow constructions for CA's. We lift the negative result on atom-canonicity to the transfinite. We also show that for any ordinal \alpha\geq \omega, for any finite k\geq 1, and for any r\in \omega, there exists an atomic algebra A_r\in SNr_\alphaCA_{\alpha+k}\sim SNr_nCA_{\alpha+k+1}, such that \Pi_{r/U} A_r\in RCA_{\alpha} where U is any non--principal ultrafilter on \omega. Reaping the harvest of our algebraic results we investigate a plethora of omitting types theorems for variants of first logic including its finite variable fragments and its packed fragment.

Explore related subjects

Keep this discovery

BibTeXRIS

Tarek Sayed Ahmed. 2014-06-25. Atom-canonicity and complete representations for cylindric-like algebras, and omitting types for the clque guarded fragment of first order logic. https://arxiv.org/abs/1408.3282

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