Light Affine Set Theory: A Naive Set Theory of Polynomial Time

In [7], a naive set theory is introduced based on a polynomial time logical system, Light Linear Logic (LLL). Although it is reasonably claimed that the set theory inherits the intrinsically polytime character from the underlying logic LLL, the discussion there is largely informal, and a formal justification of the claim is not provided sufficiently. Moreover, the syntax is quite complicated in that it is based on a non-traditional hybrid sequent calculus which is required for formulating LLL.In this paper, we consider a naive set theory based on Intuitionistic Light Affine Logic (ILAL), a simplification of LLL introduced by [1], and call it Light Affine Set Theory (LAST). The simplicity of LAST allows us to rigorously verify its polytime character. In particular, we prove that a function over {0, 1}* is computable in polynomial time if and only if it is provably total in LAST.     

Aggregate Theory Versus Set Theory

Maddy's (1990) arguments against Aggregate Theory were undermined by the shift in her position in 1997. The present paper considers Aggregate Theory in the light of this, and the recent search for `New Axioms for Mathematics'. If Set Theory is the part-whole theory of singletons, then identifying singletons with their single members collapses Set Theory into Aggregate Theory. But if singletons are not identical to their single members, then they are not extensional objects and so are not a basis for Science. Either way, the Continuum Hypothesis has no physical interest.     

Arithmetical Set Theory

It is well known that number theory can be interpreted in the usual set theories, e.g. ZF, NF and their extensions. The problem I posed for myself was to see if, conversely, a reasonably strong set theory could be interpreted in number theory. The reason I am interested in this problem is, simply, that number theory is more basic or more concrete than set theory, and hence a more concrete foundation for mathematics. A partial solution to the problem was accomplished by WTN in [2], where it was shown that a predicative set theory could be interpreted in a natural extension of pure number theory, PN, (i.e. classical first-order Peano Arithmetic). In this paper, we go a step further by showing that a reasonably strong fragment of predicative set theory can be interpreted in PN itself. We then make an attempt to show how to develop predicative fragments of mathematics in PN.If one wishes to know what is meant by reasonably strong and fragment please read on.     

A Set Theory with Support for Partial Functions

Partial functions can be easily represented in set theory as certain sets of ordered pairs. However, classical set theory provides no special machinery for reasoning about partial functions. For instance, there is no direct way of handling the application of a function to an argument outside its domain as in partial logic. There is also no utilization of lambda-notation and sorts or types as in type theory. This paper introduces a version of von-Neumann-Bernays-Gödel set theory for reasoning about sets, proper classes, and partial functions represented as classes of ordered pairs. The underlying logic of the system is a partial first-order logic, so class-valued terms may be nondenoting. Functions can be specified using lambda-notation, and reasoning about the application of functions to arguments is facilitated using sorts similar to those employed in the logic of the IMPS Interactive Mathematical Proof System. The set theory is intended to serve as a foundation for mechanized mathematics systems.     

The Axioms of Set Theory

In this paper I argue for the view that the axioms of ZF are analytic truths of a particular concept of set. By this I mean that these axioms are true by virtue only of the meaning attached to this concept, and, moreover, can be derived from it. Although I assume that the object of ZF is a concept of set, I refrain from asserting either its independent existence, or its dependence on subjectivity. All I presuppose is that this concept is given to us with a certain sense as the objective focus of a ”phenomenologically reduced“ intentional experience. The concept of set that ZF describes, I claim, is that of a multiplicity of coexisting elements that can, as a consequence, be a member of another multiplicity. A set is conceived as a quantitatively determined collection of objects that is, by necessity, ontologically dependent on its elements, which, on the other hand, must exist independently of it. A close scrutiny of the essential characters of this conception seems to be sufficient to ground the set-theoretic hierarchy and the axioms of ZF. This revised version was published online in August 2006 with corrections to the Cover Date.     

Ideal Objects for Set Theory

Journal of Philosophical Logic - In this paper, we argue for an instrumental form of existence, inspired by Hilbert’s method of ideal elements. As a case study, we consider the existence of...     

The Undecidability of Grisin's Set Theory

We investigate a contractionless naive set theory, due to Grisin [11]. We prove that the theory is undecidable.     

The Open-Endedness of the Set Concept and the Semantics of Set Theory

Some philosophers have argued that the open-endedness of the set concept has revisionary consequences for the semantics and logic of set theory. I consider (several variants of) an argument for this claim, premissed on the view that quantification in mathematics cannot outrun our conceptual abilities. The argument urges a non-standard semantics for set theory that allegedly sanctions a non-classical logic. I show that the views about quantification the argument relies on turn out to sanction a classical semantics and logic after all. More generally, this article constitutes a case study in whether the need to account for conceptual progress can ever motivate a revision of semantics or logic. I end by expressing skepticism about the prospects of a so-called non-proof-based justification for this kind of revisionism about set theory.     

Concept Grounding and Knowledge of Set Theory

C. S. Jenkins has recently proposed an account of arithmetical knowledge designed to be realist, empiricist, and apriorist: realist in that what’s the case in arithmetic doesn’t rely on us being any particular way; empiricist in that arithmetic knowledge crucially depends on the senses; and apriorist in that it accommodates the time-honored judgment that there is something special about arithmetical knowledge, something we have historically labeled with ‘a priori’. I’m here concerned with the prospects for extending Jenkins’s account beyond arithmetic—in particular, to set theory. After setting out the central elements of Jenkins’s account and entertaining challenges to extending it to set theory, I conclude that a satisfactory such extension is unlikely.     

Extensionality and Restriction in Naive Set Theory

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 Restall [4]. The main result is that the proposal, in the context of an independently motivated formalization of naive set theory, leads to triviality.     

Wittgenstein on Set Theory and the Enormously Big

Wittgenstein's conception of infinity can be seen as continuing the tradition of the potential infinite that begins with Aristotle. Transfinite cardinals in set theory might seem to render the potential infinite defunct with the actual infinite now given mathematical legitimacy. But Wittgenstein's remarks on set theory argue that the philosophical notion of the actual infinite remains philosophical and is not given a mathematical status as a result of set theory. The philosophical notion of the actual infinite is not to be found in the mathematics of set theory, only in a certain associated philosophy – what Wittgenstein calls a certain kind of “prose”.     

The Simple Consistency of Naive Set Theory using Metavaluations

The main aim is to extend the range of logics which solve the set-theoretic paradoxes, over and above what was achieved by earlier work in the area. In doing this, the paper also provides a link between metacomplete logics and those that solve the paradoxes, by finally establishing that all M1-metacomplete logics can be used as a basis for naive set theory. In doing so, we manage to reach logics that are very close in their axiomatization to that of the logic R of relevant implication. A further aim is the use of metavaluations in a new context, expanding the range of application of this novel technique, already used in the context of negation and arithmetic, thus providing an alternative to traditional model theoretic approaches.     

Ontology,Set Theory,and the Paraphrase Challenge

Journal of Philosophical Logic - In many ontological debates there is a familiar challenge. Consider a debate over X s. The “small” or anti-X side tries to show that they can paraphrase...     

粗糙集在项目认知属性标定中的应用

认知诊断是新一代测量理论的核心, 对形成性教学评估具有重要意义。项目认知属性标定是认知诊断中一项基础而重要的工作,现有的项目认知属性辅助标定方法的研究工作很少, 并且在应用上存在诸多局限。课堂评估是认知诊断应用的理想场所,但课堂评估中项目的选取具有随意性, 教师难以在短时间内准确标识项目认知属性。本研究首次提出采用粗糙集方法对项目认知属性进行标定, 该方法无需太多被试和项目, 亦无需已知项目参数, 且能当场诊断出结果, 适于采用纸笔测验的课堂评估。通过Monte Carlo模拟研究表明：采用粗糙集方法能迅速地对项目认知属性进行标定, 并具有较高的标定准确率; 而且, 项目认知属性越少、或被试估计判准率越高、或失误率越小则项目认知属性标定的准确率越高。粗糙集方法的引入, 对拓展认知诊断的应用范围, 真正实现其辅助性教学功能, 具有重要作用。     

Modal Deduction in Second-Order Logic and Set Theory - II

In this paper, we generalize the set-theoretic translation method for poly-modal logic introduced in [11] to extended modal logics. Instead of devising an ad-hoc translation for each logic, we develop a general framework within which a number of extended modal logics can be dealt with. We first extend the basic set-theoretic translation method to weak monadic second-order logic through a suitable change in the underlying set theory that connects up in interesting ways with constructibility; then, we show how to tailor such a translation to work with specific cases of extended modal logics.     

Aesthetics and the Dream of Objectivity: Notes from Set Theory

In this paper, we consider various ways in which aesthetic value bears on, if not serves as evidence for, the truth of independent statements in set theory.

... the aesthetic issue, which in practice will also for me be the decisive factor—John von Neumann, letter to Carnap, 1931     

A Basic TAT Set

The 10 TAT cards judged most valuable for a basic test set were selected by a total of 170 highly experienced psychologists. The judges' choices, separately determined for adults and children, were very consistent. For example, 86.7% of judges in the adult series and 92.5% of judges in the child series listed Picture 1 (Boy-Violin) within their first 10 choices. Rankings of the 10 most frequently chosen cards were closely parallel in the adult and child series. Utilizing these findings a recommended Basic TAT set of eight cards (Pictures 1, 2, 3BM, 4, 6BM, 7BM, 13MF, 8BM) is proposed to enhance development of the TAT for clinical research and teaching purposes.