Full-completeness conjecture for universal operations on grounds

Let Λ\Lambda be over the base structure B1\mathfrak{B}_1, and let den1den^*_1 be a denotation relative to Λ\Lambda such that, for some operational symbol ϕ\phi of Λ\Lambda, den1(ϕ)den^*_1(\phi) is a universal operation on grounds ff. Full-completeness conjecture. There should exist a denotation den2den^*_2 relative to Gen\texttt{Gen} over B1\mathfrak{B}_1 and operational symbols ϕ1,,ϕn\phi_1,\ldots,\phi_n of Gen\texttt{Gen} such that a universal operation on grounds hh, composed of den2(ϕ1),,den2(ϕn)den^*_2(\phi_1),\ldots,den^*_2(\phi_n), agrees extensionally with den1(ϕ)den^*_1(\phi) on every B2\mathfrak{B}_2: if g1g_1 is the ground on B2\mathfrak{B}_2 satisfying den1(ϕ)B1,B2g1den^*_1(\phi)\approx_{\mathfrak{B}_1,\mathfrak{B}_2}g_1 and g2g_2 is the ground on B2\mathfrak{B}_2 satisfying hB1,B2g2h\approx_{\mathfrak{B}_1,\mathfrak{B}_2}g_2, then g1B2g2g_1\equiv_{\mathfrak{B}_2}g_2. This is stronger than Prawitz's conjecture: it asks that every universal operation inhabiting the relevant type be extensionally represented by the denotation of a term of Gen\texttt{Gen}, rather than merely that the type be derivable in intuitionistic logic.

Sources & referencesView supporting material

Primary source

Antonio Piccolomini d'Aragona, “Denotational semantics for languages of epistemic grounding based on Prawitz's theory of grounds”, arXiv:2501.10491 (2025).

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.