Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2205.00245

Craig interpolation theorem fails in bi-intuitionistic predicate logic

Grigory K. Olkhovikov·Guillermo Badia
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this article we show that bi-intuitionistic predicate logic lacks the Craig Interpolation Property. We proceed by adapting the counterexample given by Mints, Olkhovikov and Urquhart for intuitionistic predicate logic with constant domains (G. Mints, G. K. Olkhovikov and A. Urquhart. Failure of Interpolation in Constant Domain Intuitionistic Logic. Journal of Symbolic Logic, 78: 937--950 (2013)). More precisely, we show that there is a valid implication $ϕ\rightarrow ψ$ with no interpolant (i.e. a formula $θ$ in the intersection of the vocabularies of $ϕ$ and $ψ$ such that both $ϕ\rightarrow θ$ and $θ\rightarrow ψ$ are valid). Importantly, this result does not contradict the unfortunately named `Craig interpolation' theorem established by Rauszer in (Cecylia Rauszer. Craig Interpolation Theorem for an Extention of Intuitionistic Logic. Bull. Ac. Pol. Sc., 25(4), 337--341 (1977)) since that article is about the property more correctly named `deductive interpolation' (see Galatos, Jipsen, Kowalski and Ono's use of this term in N. Galatos, P. Jipsen, T. Kowalski, \& H. Ono. Residuated Lattices: An Algebraic Glimpse at Substructural Logics. Studies in Logic and the Foundations of Mathematics, Vol. 151. Amsterdam: Elsevier B. V. (2007)) for global consequence. Given that the deduction theorem fails for bi-intuitionistic logic with global consequence, the two formulations of the property are not equivalent.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Grigory K. Olkhovikov, Guillermo Badia. 2022-06-07. Craig interpolation theorem fails in bi-intuitionistic predicate logic. https://doi.org/10.1017/s1755020322000296

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗