SearcharxivSearch

arXiv · 1511.05882

Strong Completeness of Provability Logic for Ordinal Spaces

Abstract

Abashidze and Blass independently proved that the modal logic $\sf{GL}$ is complete for its topological interpretation over any ordinal greater than or equal to $ω^ω$ equipped with the interval topology. Icard later introduced a family of topologies $\mathcal I_λ$ for $λ< ω$, with the purpose of providing semantics for Japaridze's polymodal logic $\sf{GLP}$ $_ω$. Icard's construction was later extended by Joosten and the second author to arbitrary ordinals $λ\geq ω$. We further generalize Icard topologies in this article. Given a scattered space $\mathfrak X = (X, τ)$ and an ordinal $λ$, we define a topology $τ_{+λ}$ in such a way that $τ_{+0}$ is the original topology $τ$ and $τ_{+λ}$ coincides with $\mathcal I_λ$ when $\mathfrak X$ is an ordinal endowed with the left topology. We then prove that, given any scattered space $\mathfrak X$ and any ordinal $λ>0$ such that the rank of $(X, τ)$ is large enough, $\sf{GL}$ is strongly complete for $τ_{+λ}$. One obtains the original Abashidze-Blass theorem as a consequence of the special case where $\mathfrak X=ω^ω$ and $λ=1$.

Explore related subjects

Keep this discovery

BibTeXRIS

Juan P. Aguilera, David Fernández-Duque. 2015-11-18. Strong Completeness of Provability Logic for Ordinal Spaces. https://arxiv.org/abs/1511.05882

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