On a positive set theory with inequality

DOI10.1002/malq.201010022zbMath1250.03112OpenAlexW2021719812MaRDI QIDQ3096082

Giacomo Lenzi

Publication date: 7 November 2011

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201010022

zbMATH Keywords

inequalitycomprehensionpositive set theoryweak extensionality

Mathematics Subject Classification ID

Consistency and independence results (03E35) Nonclassical and second-order set theories (03E70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Naive set theory with extensionality in partial logic and in paradoxical logic
• Studies on the axiom of comprehension
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• The consistency problem for positive comprehension principles
• A positive set theory with equality revisited
• Metarecursive sets
• Π₁¹ Sets, ω-Sets, and metacompleteness
• The Meta-R.E. sets, but not the Π₁¹ sets, can be enumerated without repetition

This page was built for publication: On a positive set theory with inequality