Prawitz's completeness conjecture
A reassessment
Bibliographic Data
| ID | 20142832 |
|---|---|
| Authors | Peter Schroeder-Heister (0000-0001-7113-9972, University of Tübingen, corresponding author), Peter Schroeder‐Heister (Department of Computer Science University of Tübingen Tübingen Germany) |
| Year | 2024 |
| Volume | 90 |
| Issue | 5 |
| Pages | 492-514 |
| Publication date | 2024-10-01 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Theoria (JOURNAL) |
| Journal identifiers | ISSN: 0040-5825 • E-ISSN: 1755-2567 |
| Publisher | Wiley (PUBLISHER • GB) |
| DOI | 10.1111/theo.12541 |
| OpenAlex | W4402611240 |
| Language | EN |
| References cited | 30 |
In 1973, Dag Prawitz conjectured that the calculus of intuitionistic logic is complete with respect to his notion of validity of arguments. On the background of the recent disproof of this conjecture by Piecha, de Campos Sanz and Schroeder‐Heister, we discuss possible strategies of saving Prawitz's intentions. We argue that Prawitz's original semantics, which is based on the principal frame of all atomic systems, should be replaced with a general semantics, which also takes into account restricted frames of atomic systems. We discard the option of not considering extensions of atomic systems, but acknowledge the need to incorporate definitional atomic bases in the semantic framework. It turns out that ideas and results by Westerståhl on the Carnap categoricity of intuitionistic logic can be applied to Prawitz semantics. This implies that Prawitz semantics has a status of its own as a genuine, though incomplete, semantics of intuitionstic logic. An interesting side result is the fact that every formula satisfiable in general semantics is satisfiable in an axioms‐only frame (a frame whose atomic systems do not contain proper rules). We draw a parallel between this seemingly paradoxical result and Skolem's paradox in first‐order model theory
Combinatorics · Completeness (order theory) · Conjecture · Mathematical analysis · Mathematical economics · Computability, Logic, AI Algorithms · Logic, programming, and type systems · Logic, Reasoning, and Knowledge · Mathematics · Philosophy
| Highly cited | No |
|---|