Prawitz's conjecture on completeness of intuitionistic logic for the theory of grounds

An operational type is a specification of the premises and conclusion of a rule together with the domains and co-domains governing its discharged assumptions. Let τ1,,τnτn+1\tau_1,\ldots,\tau_n\rhd\tau_{n+1} be an operational type, and suppose that ff is a universal operation on grounds of this type. For each ini\leq n, let σi\sigma_i be τi\tau_i when τi\tau_i has empty domain, and otherwise let σi\sigma_i be a derivation from Γi\Gamma_i to αi\alpha_i, where Γi\Gamma_i and αi\alpha_i are respectively the domain and co-domain of τi\tau_i. Let RR be the inference with premises σ1,,σn\sigma_1,\ldots,\sigma_n and conclusion β\beta, and let β\beta be the co-domain of τn+1\tau_{n+1}. The bindings of ff and RR agree: ff binds xx and ξγ\xi^\gamma at index ii exactly when RR binds xx and discharges γ\gamma on σi\sigma_i. Prawitz's conjecture. If there is a universal operation on grounds ff of operational type τ1,,τnτn+1\tau_1,\ldots,\tau_n\rhd\tau_{n+1}, then the corresponding inference RR is derivable in intuitionistic logic, IL\texttt{IL}. This conjecture is the completeness question for IL\texttt{IL} with respect to the theory of grounds: correctness is established, while the conjecture would imply the converse implication ΓαΓILα\Gamma\models\alpha\Rightarrow\Gamma\vdash_{\texttt{IL}}\alpha.

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.