HOW MUCH PROPOSITIONAL LOGIC SUFFICES FOR ROSSER’S ESSENTIAL UNDECIDABILITY THEOREM? (Q5078818)

From MaRDI portal
Revision as of 06:45, 16 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    25 May 2022
    0 references
    undecidability
    0 references
    substructural logic
    0 references
    Robinson arithmetic
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references