One superintuitionistic calculus of propositions (Q1097259)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1097259 |
scientific article; zbMATH DE number 4033704
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One superintuitionistic calculus of propositions |
scientific article; zbMATH DE number 4033704 |
Statements
One superintuitionistic calculus of propositions (English)
0 references
1985
0 references
This paper deals with a propositional superintuitionistic logic L treated in \textit{S. V. Popov}'s paper [Algebra Logika 20, 654-706 (1981; Zbl 0528.03028)]. Though Popov presented L as an example of an undecidable logic, the author proves that a problem mentioned to be undecidable in Popov's proof is decidable. The author comments that the undecidability of L remains still open.
0 references
intermediate logic
0 references
propositional superintuitionistic logic
0 references
0.8039812445640564
0 references
0.7970119118690491
0 references
0.7619647979736328
0 references
0.7602471709251404
0 references
