Searcharxiv⌕ Search

arXiv · 2611.16753

Strong Completeness of Provability Logic for Languages of size at most continuum

Abstract

We investigate the strong completeness of $\mathrm{GL}(\mathbb P)$ for an infinite set of propositional variables $\mathbb P$ over ordinal spaces equipped with the interval topology $\mathcal{I}_1$. For every infinite cardinal $κ$, we consider the set \[ Γ_κ= \{\Diamond p_ξ:ξ<κ\} \cup \{\Box(p_ξ\to\Diamond p_η):ξ<η<κ\}, \] and prove that $Γ_κ$ has a model on an ordinal space with $\mathcal{I}_1$ if and only if $κ\nrightarrow_{\mathrm{ipath}}(ω)^2_{ω,<ω}$. We also prove that if $|\mathbb P|<\mathfrak p$, then $\mathrm{GL}(\mathbb P)$ is strongly complete with respect to $(ω^ω+1,\mathcal I_1)$. Finally, we establish the strong completeness of $\mathrm{GL}(\mathbb P)$ with respect to the same space whenever $|\mathbb P|=\aleph_1$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohammad Golshani, Reihane Zoghifard. 2026-11-12. Strong Completeness of Provability Logic for Languages of size at most continuum. https://searcharxiv.com/abs/2611.16753

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Dubnov-Ivanov-Nagata-Higman Theorem for NIP nilrings

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

math.LO↗

Relative computability and definability for nonregular oracles

Classically, a set is computable from an oracle if both the set and its complement are computably enumerable (c.e.) relative to that oracle. We construct a countable nonstandard model of true arithmetic with sets A and X such that both A and its complement are c.e. relative to X, yet A is not pointwise Turing reducible to X. The Turing functionals used here are single-valued at every oracle. For regular oracles, we prove that the classical equivalence holds over ISigma_1. Two further phenomena, each known from earlier work, are realized with the same oracle X that witnesses our main separation. Strong and pointwise Turing reducibility differ for this X, and some Delta_1^X set is not X-c.e.

math.LO↗