Search arXivSearch

arXiv · 1401.7646

Characterizing intermediate tense logics in terms of Galois connections

Abstract

We propose a uniform way of defining for every logic ${\sf L}$ intermediate between intuitionistic and classical logics, the corresponding intermediate minimal tense logic ${\sf LK_t}$. This is done by building the fusion of two copies of intermediate logic with a Galois connection ${\sf LGC}$, and then interlinking their operators by two Fischer Servi axioms. The resulting system is called here ${\sf L2GC{+}FS}$. In the cases of intuitionistic logic ${\sf Int}$ and classical logic ${\sf Cl}$, it is noted that ${\sf Int2GC{+}FS}$ is syntactically equivalent to intuitionistic minimal tense logic ${\sf IK_t}$ by W. B. Ewald and ${\sf Cl2GC{+}FS}$ equals classical minimal tense logic ${\sf K_t}$. This justifies to consider ${\sf L2GC{+}FS}$ as minimal ${\sf L}$-tense logic ${\sf LK_t}$ for any intermediate logic ${\sf L}$. We define H2GC+FS-algebras as expansions of HK1-algebras, introduced by E. Orlowska and I. Rewitzky. For each intermediate logic ${\sf L}$, we show algebraic completeness of ${\sf L2GC{+}FS}$ and its conservativeness over ${\sf L}$. We prove relational completeness of ${\sf Int2GC{+}FS}$ with respect to the models defined on ${\sf IK}$-frames introduced by G. Fischer Servi. We also prove a representation theorem stating that every H2GC+FS-algebra can be embedded into the complex algebra of its canonical ${\sf IK}$-frame.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wojciech Dzik, Jouni Järvinen, Michiro Kondo. 2014-06-30. Characterizing intermediate tense logics in terms of Galois connections. https://doi.org/10.1093/jigpal%2Fjzu024

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO