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)
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
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, On arithmetic in the Cantor-Łukasiewicz fuzzy set theory, On contraction and the modal fragment