Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2302.00743

Cantor Derivative Logic in Topological Dynamics

Yoàv Montacute
View original source ↗Read source document ↗Export metadata ↓

Abstract

Topological semantics for modal logic based on the Cantor derivative operator gives rise to derivative logics, also referred to as d-logics. Unlike logics based on the topological closure operator, d-logics have not previously been studied in the framework of dynamic topological systems (DTSs), which are pairs (X,f) consisting of a topological space X equipped with a continuous function f : X -> X. We introduce the logics wK4C, K4C and GLC and show that they all have the finite Kripke model property and are sound and complete with respect to the d-semantics in this dynamical setting. We also prove a general result for the case where f is a homeomorphism, which yields soundness and completeness for the corresponding systems wK4H, K4H and GLH. Of special interest is GLC, which is the d-logic of all DTSs based on a scattered space. We use the completeness of GLC and the properties of scattered spaces to demonstrate the first sound and complete dynamic topological logic in the original trimodal language. In particular, we show that the version of DTL based on the class of scattered spaces is finitely axiomatisable over the original language, and that the natural axiomatisation is sound and complete.

Explore related subjects

math.LOcs.LO

Keep this discovery

BibTeXRIS

Yoàv Montacute. 2023-02-01. Cantor Derivative Logic in Topological Dynamics. https://arxiv.org/abs/2302.00743

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↗