Prawitz's conjecture on completeness of intuitionistic logic for the theory of grounds
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 be an operational type, and suppose that is a universal operation on grounds of this type. For each , let be when has empty domain, and otherwise let be a derivation from to , where and are respectively the domain and co-domain of . Let be the inference with premises and conclusion , and let be the co-domain of . The bindings of and agree: binds and at index exactly when binds and discharges on . Prawitz's conjecture. If there is a universal operation on grounds of operational type , then the corresponding inference is derivable in intuitionistic logic, . This conjecture is the completeness question for with respect to the theory of grounds: correctness is established, while the conjecture would imply the converse implication .
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.