Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1402.5867

Amalgamation, interpolation and congruence extension properties in topological cylindric algebras

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

Abstract

Topological cylindric algebras of dimension \alpha, \alpha any ordinal are cylindric algebras with dimension \alpha expanded with \alpha S4 modalities. The S4 modalities in representable algebras are induced by a topology on the base of the representation of its cylindric reduct, that is not necessarily an Alexandrov topolgy. For \alpha>2, the class of representable algebras is a variety that is not axiomatized by a finite schema, and in fact all complexity results on representations for cylindric algebras, proved by Andreka (concerning number of variables needed for axiomatizations) Hodkinson (on Sahlqvist axiomatizations and canonicity) and others, transfer to the topological addition, by implementing a very simple procedure of `discretely topologizing a cylindric algebra' Given a cylindric algebra of dimension \alpha, one adds \alpha many interior identity operations, the latter algebra is representable as a topological cylindric algebra if and only if the former is; the representation induced by the discrete topology. In this paper we investigate amalgamation properties for various classes of topological cylindric algebras of all dimensions. We recover, in the topological context, all of the results proved by Andreka, Comer Madarasz, Nemeti, Pigozzi, Sain, Sayed Ahmed, Sagi, Shelah, Simon, and others for cylindric algebras and much more.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Tarek Sayed Ahmed. 2014-01-27. Amalgamation, interpolation and congruence extension properties in topological cylindric algebras. https://arxiv.org/abs/1402.5867

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↗