The undecidability of Grišin's set theory
From MaRDI portal
Publication:1402586
DOI10.1023/A:1025159016268zbMath1039.03040MaRDI QIDQ1402586
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
undecidability; contraction; cut elimination; substructural logic; set theory; combinatory logic; naive comprehension; second recursion theorem
03D35: Undecidability and degrees of sets of sentences
03F05: Cut-elimination and normal-form theorems
03E70: Nonclassical and second-order set theories
03B47: Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics)
03B40: Combinatory logic and lambda calculus
Related Items
Metatheory and dialetheism, MODAL LOGIC WITHOUT CONTRACTION IN A METATHEORY WITHOUT CONTRACTION, Systems for non-reflexive consequence, Analytic calculi for circular concepts by finite revision, Stability and paradox in algorithmic logic, Distinguishing non-standard natural numbers in a set theory within Łukasiewicz logic, Soft linear set theory, Comprehension contradicts to the induction within Łukasiewicz predicate logic, Observations on the trivial world, Cut elimination for systems of transparent truth with restricted initial sequents, Paraconsistent metatheory: new proofs with old tools, On arithmetic in the Cantor-Łukasiewicz fuzzy set theory, Some Comments and Replies, On contraction and the modal fragment