SearcharxivSearch

arXiv · 1304.2932

Results on Polyadic Algebras

Abstract

While every polyadic algebra ($\PA$) of dimension 2 is representable, we show that not every atomic polyadic algebra of dimension two is completely representable; though the class is elementary. Using higly involved constructions of Hirsch and Hodkinson we show that it is not elementary for higher dimensions a result that, to the best of our knowledge, though easily destilled from the literature, was never published. We give a uniform flexible way of constructing weak atom structures that are not strong, and we discuss the possibility of extending such result to infinite dimensions. Finally we show that for any finite $n>1$, there are two $n$ dimensional polyadic atom structures $\At_1$ and $\At_2$ that are $L_{\infty,\omega}$ equivalent, and there exist atomic $\A,\B\in \PA_n$, such that $\At\A=\At_1$ and $\At\B= \At_2$, $\A\in \Nr_n\PA_{\omega}$ and $\B\notin \Nr_n\PA_{n+1}$. This can also be done for infinite dimensions (but we omit the proof)

Explore related subjects

Keep this discovery

BibTeXRIS

Tarek Sayed Ahmed. 2013-04-09. Results on Polyadic Algebras. https://arxiv.org/abs/1304.2932

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