Extensionality and Restriction in Naive Set Theory

被引:15
|
作者
Weber, Zach [1 ]
机构
[1] Univ Sydney, Sch Philosoph & Hist Inquiry, Sydney, NSW 2006, Australia
基金
澳大利亚研究理事会;
关键词
Naive set theory; paraconsistency; relevant logic; restricted quantification;
D O I
10.1007/s11225-010-9225-y
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. This paper considers the sub-problem of expressing extensional identity and the subset relation in paraconsistent, relevant solutions, in light of a recent proposal from Beall, Brady, Hazen, Priest and Resta [4]. The main result is that the proposal, in the context of an independently motivated formalization of naive set theory, leads to triviality.
引用
收藏
页码:87 / 104
页数:18
相关论文
共 50 条