The undecidability of Grišin's set theory

DOI10.1023/A:1025159016268zbMath1039.03040OpenAlexW1489876977MaRDI QIDQ1402586

Andrea Cantini

Publication date: 28 August 2003

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1025159016268

zbMATH Keywords

undecidabilitycontractioncut eliminationsubstructural logicset theorycombinatory logicnaive comprehensionsecond recursion theorem

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Cut-elimination and normal-form theorems (03F05) Nonclassical and second-order set theories (03E70) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Combinatory logic and lambda calculus (03B40)

Related Items (14)

Metatheory and dialetheism ⋮ On arithmetic in the Cantor-Łukasiewicz fuzzy set theory ⋮ Paraconsistent metatheory: new proofs with old tools ⋮ Stability and paradox in algorithmic logic ⋮ Distinguishing non-standard natural numbers in a set theory within Łukasiewicz logic ⋮ Analytic calculi for circular concepts by finite revision ⋮ Systems for non-reflexive consequence ⋮ On contraction and the modal fragment ⋮ Soft linear set theory ⋮ Some Comments and Replies ⋮ MODAL LOGIC WITHOUT CONTRACTION IN A METATHEORY WITHOUT CONTRACTION ⋮ Observations on the trivial world ⋮ Comprehension contradicts to the induction within Łukasiewicz predicate logic ⋮ Cut elimination for systems of transparent truth with restricted initial sequents

This page was built for publication: The undecidability of Grišin's set theory