SearcharxivSearch

arXiv · 1401.1156

Algebraisable versions of predicate topological logic

Abstract

Motivated by questions like: which spatial structures may be characterized by means of modal logic, what is the logic of space, how to encode in modal logic different geometric relations, topological logic provides a framework for studying the confluence of the topological semantics for $\sf S4$ modalities, based on topological spaces rather than Kripke frames. Following research initiated by Sgro, and further pursued algebraically by Georgescu, we prove an interpolation theorem and an omitting types theorem for various extensions of predicate topological logic and Chang's modal logic. Our proof is algebraic addressing expansions of cylindric algebras using interior operators and boxes, respectively. Then we proceed like is done in abstract algebraic logic by studing algebraisable extensions of both logics; obtaining a plethora of results on the amalgamation property for various subclasses of their algebraic counterparts, which are varieties. Notions like atom-canonicity and complete representations are approached for finite dimensional topological cylindric algebras. The logical consequences of our algebraic results are carefully worked out for infinitary extensions of Chang's predicate modal logic and finite versions thereof, by restricting to $n$ variables, $n$ finite, viewed as a propositional multi-dimensional modal logic, and $n$ products of bimodal whose frames are of the form $(U, U\times U, R)$ where $R$ is a pre-order, endowed with diagonal constants.

Explore related subjects

Keep this discovery

BibTeXRIS

Tarek Sayed Ahmed. 2014-01-06. Algebraisable versions of predicate topological logic. https://arxiv.org/abs/1401.1156

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