Full-completeness conjecture for universal operations on grounds
Let be over the base structure , and let be a denotation relative to such that, for some operational symbol of , is a universal operation on grounds . Full-completeness conjecture. There should exist a denotation relative to over and operational symbols of such that a universal operation on grounds , composed of , agrees extensionally with on every : if is the ground on satisfying and is the ground on satisfying , then . 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 , rather than merely that the type be derivable in intuitionistic logic.
References
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
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.