Javascript must be enabled to continue!
Prawitz's completeness conjecture: A reassessment
View through CrossRef
AbstractIn 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.
Title: Prawitz's completeness conjecture: A reassessment
Description:
AbstractIn 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.
Related Results
Étude de la conjecture de Seymour sur le second voisinage
Étude de la conjecture de Seymour sur le second voisinage
Soit D un digraphe simple (sans cycle orienté de longueur 2 ). En 1990, P. Seymour a conjecturé que D a un sommet v avec un second voisinage extérieur au moins aussi grand que son ...
Dag Prawitz's theory of grounds
Dag Prawitz's theory of grounds
.
Dans la récente théorie des grounds, Prawitz développe ses investigations sémantiques dans la direction d’une analyse de l’origine et de la nature du pouvoir que ...
Borel Conjecture, dual Borel Conjecture, and other variants of the Borel Conjecture
Borel Conjecture, dual Borel Conjecture, and other variants of the Borel Conjecture
This survey article is about the Borel Conjecture and several variants (which are inspired by the Galvin-Mycielski-Solovay characterization of strong measure zero) such as the dual...
Rosenfeld’s conjecture
Rosenfeld’s conjecture
Conjecture de rosenfeld
Ma thèse de Doctorat est basée sur un sujet très intéressant en Théorie de Graphe : Le tournoi.En 1934, Rédei a prouvé que tout tournoi cont...
The Galois Brumer–Stark conjecture for SL2(????3)-extensions
The Galois Brumer–Stark conjecture for SL2(????3)-extensions
In a previous work, we stated a conjecture, called the Galois Brumer–Stark conjecture, that generalizes the (abelian) Brumer–Stark conjecture to Galois extensions. We also proved t...
A Note on Alon–Tarsi Shortest Cycle Cover Conjecture
A Note on Alon–Tarsi Shortest Cycle Cover Conjecture
ABSTRACT
The shortest cycle cover conjecture (SCC conjecture), proposed by Alon and Tarsi, asserts that every bridgeless cubic graph has a cycle cover with a tot...
Oriented paths in digraphs and the S-packing coloring of subcubic graph
Oriented paths in digraphs and the S-packing coloring of subcubic graph
Chemins orientés dans les graphes orientés et coloration S-packing des graphes subcubiques
Cette thèse de doctorat est divisée en deux parties principales: La parti...
The Complexity of Mathematics
The Complexity of Mathematics
The strong Goldbach's conjecture states that every even integer greater than 2 can be written as the sum of two primes. The conjecture that all odd numbers greater than 7 are the s...

