SearcharxivSearch

arXiv · 2006.03421

Space and time via Topological and Tense cylindric algebras

Abstract

Let $\alpha$ be an arbritary ordinal, and $2<n<\omega$. In \cite{3} accepted for publication in Quaestiones Mathematicae, we studied using algebraic logic, interpolation, amalgamation using $\alpha$ many variables for topological logic with $\alpha$ many variables briefly $\sf TopL_{\alpha}$. This is a sequel to \cite{3}; the second part on modal cylindric algebras, where we study algebraically other properties of $\sf TopL_{\alpha}$. Modal cylindric algebras are cylindric algebras of infinite dimension expanded with unary modalities inheriting their semantics from a unimodal logic $\sf L$ such as $\sf K5$ or $\sf S4$. Using the methodology of algebraic logic, we study topological (when $\sf L=S4$), in symbols $\sf TCA_{\alpha}$. We study completeness and omitting types $\sf OTT$s for $\sf TopL_{\omega}$ and $\sf TenL_{\omega}$, by proving several representability results for locally finite such algebras. Furthermore, we study the notion of atom-canonicity for both ${\sf TCA}_{n}$ and ${\sf TenL}_n$, a well known persistence property in modal logic, in connection to $\sf OTT$ for ${\sf TopL}_n$ and ${\sf TeLCA}_n$, respectively. We study representability, omitting types, interpolation and complexity isssues (such as undecidability) for topological cylindric algebras. In a sequel to this paper, we introduce temporal cyindric algebras and point out the way how to amalgamate algebras of space (topological algebars) and algebras of time (temporal algebras) forming topological-temporal cylindric algebras that lend themselves to encompassing spacetime gemetries, in a purely algebraic manner.

Explore related subjects

Keep this discovery

BibTeXRIS

Tarek Sayed Ahmed. 2020-05-18. Space and time via Topological and Tense cylindric algebras. https://arxiv.org/abs/2006.03421

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