← All problems

Is there a logic L which satisfies both the Beth property and Δ-interpolation, is compact but does not satisfy the interpolation property

50 years old · documented by

In the usual one-sorted setting of regular abstract-model-theoretic logics, ask whether there is a logic LL such that, for every vocabulary, it is compact, has the Beth property and the Δ\Delta-interpolation property, but fails the interpolation property. Compactness means that every set Φ\Phi of LL-sentences has a model if every finite subset of Φ\Phi has a model. Interpolation means that whenever φi∈L[τi]\varphi_i\in L[\tau_i] for i=0,1i=0,1 and φ0⊨φ1\varphi_0\models\varphi_1, there is an LL-sentence θ\theta in the common vocabulary satisfying Model-Theoretic Logics: Background and Aims

φ0⊨θ⊨φ1,θ∈L[τ0∩τ1].\varphi_0\models\theta\models\varphi_1,\qquad \theta\in L[\tau_0\cap\tau_1].

For Δ\Delta-interpolation, a class KK of structures in a vocabulary τ\tau is Δ\Delta in LL when both KK and its complement are projective classes in LL—that is, each is definable by taking reducts of models of an LL-sentence in an expanded vocabulary. The property requires every such KK to be definable by an LL-sentence. The Beth property says that implicit definitions are explicit: if an LL-sentence permits at most one expansion of each reduct interpreting a nonlogical symbol, that symbol is definable by an LL-formula over the remaining vocabulary. The question is whether all these properties can hold together while interpolation fails. Model-Theoretic Logics: Background and Aims

Background

Craig interpolation is a defining feature of first-order logic and implies Beth definability. In abstract model theory, however, interpolation, compactness and Robinson-style consistency properties can separate: interpolation is stronger than the closure under implicit definability expressed by Δ\Delta-interpolation. In particular, the general implication is interpolation ⇒\Rightarrow Δ\Delta-interpolation ⇒\Rightarrow Beth; the converses do not follow merely from these implications. Feferman, Harmonious Logic Model-Theoretic Logics: Background and Aims

Feferman traces the motivating research question to the 1970s: whether compact extensions of first-order logic could retain interpolation, or at least related definability properties. One useful construction is the Δ\Delta-closure of a logic: it adds definitions for classes that are already Δ\Delta in that logic. Under the stated countable-occurrence-number hypothesis, this closure has Δ\Delta-interpolation and preserves compactness properties of the original logic, making it a natural tool for seeking compact logics with definability without full interpolation. Feferman, Harmonious Logic Model-Theoretic Logics: Background and Aims

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.