Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1509.03743

How many varieties of cylindric algebras

H. Andréka·I. Németi
View original source ↗Read source document ↗Export metadata ↓

Abstract

Cylindric algebras, or concept algebras in another name, form an interface between algebra, geometry and logic; they were invented by Alfred Tarski around 1947. We prove that there are 2 to the alpha many varieties of geometric (i.e., representable) alpha-dimensional cylindric algebras, this means that 2 to the alpha properties of definable relations of (possibly infinitary) models of first-order logic theories can be expressed by formula schemes using alpha variables, where alpha is infinite. This solves Problem 4.2 in the 1985 Henkin-Monk-Tarski monograph. For solving this problem, we had to devise a new kind of construction, which we then use to solve Problem 2.13 of the 1971 Henkin-Monk-Tarski monograph which concerns the structural description of geometric cylindric algebras. There are fewer varieties generated by locally finite dimensional cylindric algebras, and we get a characterization of these among all the 2 to the alpha varieties. As a by-product, we get a simple, natural recursive enumeration of all the equations true of geometric cylindric algebras, and this can serve as a solution to Problem 4.1 of the 1985 Henkin-Monk-Tarski monograph. All this has logical content and implications concerning ordinary first order logic with a countable number of variables.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

H. Andréka, I. Németi. 2015-09-12. How many varieties of cylindric algebras. https://doi.org/10.1090/tran%2F7083

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↗