SearcharxivSearch

arXiv · 1308.6165

Atom-canonicity, relativized representations and omitting types for clique guarded semantics and guarded logics

Abstract

We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting types theorems, both negative and positive for finite variable fragments and / or modifications of first order logic. Negative results are obtained when we keep usual syntax and relativize models (so that they witness commutativity of quantifiers only locally) and positive ones are obtained when we weaken 'commutativity of quantifiers' in the syntax and relativize semantics differently. Such algebras have weak neat embedding properties, too, in the sense that they embed into neat reducts of algebras in higher dimensions possibly finite. In the second part of the paper various notions of representability originally formulated for atom structure are lifted in an obvious way to the algebra level, like weak and strong representability. Such classes of algebras (that are atomic) are characterized completely via neat embeddings. Finally, several model theoretic questions on such classes consisting of algebras having weak neat embedding properties and relativized representations, like decidability of their equational or universal theory, their finite axiomatizability if first order definable, are posed and answered.

Explore related subjects

Keep this discovery

BibTeXRIS

Tarek Sayed Ahmed. 2013-08-27. Atom-canonicity, relativized representations and omitting types for clique guarded semantics and guarded logics. https://arxiv.org/abs/1308.6165

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