HOW MUCH PROPOSITIONAL LOGIC SUFFICES FOR ROSSER’S ESSENTIAL UNDECIDABILITY THEOREM? (Q5078818): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q368485 |
Changed an Item |
||
| Property / author | |||
| Property / author: Petr Cintula / rank | |||
Normal rank | |||
Revision as of 01:18, 14 February 2024
scientific article; zbMATH DE number 7531433
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | HOW MUCH PROPOSITIONAL LOGIC SUFFICES FOR ROSSER’S ESSENTIAL UNDECIDABILITY THEOREM? |
scientific article; zbMATH DE number 7531433 |
Statements
HOW MUCH PROPOSITIONAL LOGIC SUFFICES FOR ROSSER’S ESSENTIAL UNDECIDABILITY THEOREM? (English)
0 references
25 May 2022
0 references
undecidability
0 references
substructural logic
0 references
Robinson arithmetic
0 references
