In this paper the view is developed that classes should not be understood as individuals, but, rather, as "classes as many" of individuals. To correlate classes with individuals "labelling" and "colabelling" functions are introduced and sets identified with a certain subdomain of the classes on which the labelling and colabelling functions are mutually inverse. A minimal axiomatization of the resulting system is formulated and some of its extensions are related to various systems of set theory, (...) including nonwellfounded set theories. (shrink)

We introduce a new sheaf-theoretic construction called the ideal completion of a category and investigate its logical properties. We show that it satisfies the axioms for a category of classes in the sense of Joyal and Moerdijk [17], so that the tools of algebraic set theory can be applied to produce models of various elementary set theories. These results are then used to prove the conservativity of different set theories over various classical and constructive type theories.

This paper constructs models of intuitionistic set theory in suitable categories. First, a Basic Intuitionistic Set Theory (BIST) is stated, and the categorical semantics are given. Second, we give a notion of an ideal over a category, using which one can build a model of BIST in which a given topos occurs as the sets. And third, a sheaf model is given of a Basic Intuitionistic Class Theory conservatively extending BIST. The paper extends the results in [2] by introducing (...) a new and perhaps more natural notion of ideal, and in the class theory of part three. (shrink)

Hamkins and Kikuchi (2016, 2017) show that in both set theory and class theory the definable subset ordering of the universe interprets a complete and decidable theory. This paper identifies the minimum subsystem of,, that ensures that the definable subset ordering of the universe interprets a complete theory, and classifies the structures that can be realised as the subset relation in a model of this set theory. Extending and refining Hamkins and Kikuchi's result for class theory, a complete extension,, of (...) the theory of infinite atomic boolean algebras and a minimum subsystem,, of are identified with the property that if is a model of, then is a model of, where M is the underlying set of, is the unary predicate that distinguishes sets from classes and is the definable subset relation. These results are used to show that that decides every 2‐stratified sentence of set theory and decides every 2‐stratified sentence of class theory. (shrink)

This paper calculates, in a precise way, the complexity of the index sets for three classes of computable structures: the class $K_{\omega _{1}^{\mathit{CK}}}$ of structures of Scott rank $\omega _{1}^{\mathit{CK}}$ , the class $K_{\omega _{1}^{\mathit{CK}}+1}$ of structures of Scott rank $\omega _{1}^{\mathit{CK}}+1$ , and the class K of all structures of non-computable Scott rank. We show that I(K) is m-complete $\Sigma _{1}^{1},\,I(K_{\omega _{1}^{\mathit{CK}}})$ is m-complete $\Pi _{2}^{0}$ relative to Kleen's O, and $I(K_{\omega _{1}^{\mathit{CK}}+1})$ is m-complete $\Sigma _{2}^{0}$ relative (...) to O. (shrink)

Concepts and methods originating in one discipline can distort the structure of another when they are applied to the latter. I exemplify this mostly with reference to systematic biology, especially problems which have arisen in relation to the nature of species. Thus the received views of classes, individuals (which term I suggest be replaced by units to avoid misunderstandings), and sets are all inapplicable, but each can be suitably modified. The concept of fuzzy set was developed to deal (...) with species and I defend its applicability. Taxa at all levels are real and participate in biological processes. Analysis of cause and pattern provides the deep structure in which metabiology is grounded; violation of this principle has led to diverse errors in biology. (shrink)

This article studies three most basic systems of truth as well as their subsystems over set theory ZF possibly with AC or the axiom of global choice GC, and then correlates them with subsystems of Morse–Kelley class theory MK. The article aims at making an initial step towards the axiomatic study of truth in set theory in connection with class theory. Some new results on the side of class theory, such as conservativity, forcing and some forms of the reflection principle, (...) are also presented. The equivalence results among systems of truth and classes obtained in this article are summarized in Theorem 104 , Theorem 107 and Theorem 108. (shrink)

When viewed as the most comprehensive theory of collections, set theory leaves no room for classes. But the vocabulary of classes, it is argued, provides us with compact and, sometimes, irreplaceable formulations of largecardinal hypotheses that are prominent in much very important and very interesting work in set theory. Fortunately, George Boolos has persuasively argued that plural quantification over the universe of all sets need not commit us to classes. This paper suggests that we retain the (...) vocabulary of classes, but explain that what appears to be singular reference to classes is, in fact, covert plural reference to sets. (shrink)

We investigate the index sets associated with the degree structures of computable sets under the parameterized reducibilities introduced by the authors. We solve a question of Peter Cholakand the first author by proving the fundamental index sets associated with a computable set A, {e : W e ≤ q u A} for q∈ {m, T} are Σ4 0 complete. We also show hat FPT(≤ q n ), that is {e : W e computable and ≡ q n (...) ?}, is Σ4 0 complete. We also look at computable presentability of these classes. (shrink)

This paper, accessible for a general philosophical audience having only some fleeting acquaintance with set-theory and category-theory, concerns the philosophy of mathematics, specifically the bearing of category-theory on the foundations of mathematics. We argue for six claims. (I) A founding theory for category-theory based on the primitive concept of a set or a class is worthwile to pursue. (II) The extant set-theoretical founding theories for category-theory are conceptually flawed. (III) The conceptual distinction between a set and a class can be (...) seen to be formally codified in Ackermann's axiomatisation of set-theory. (IV) A slight but significant deductive extension of Ackermann's theory of sets and classes founds Cantorian set-theory as well as category-theory, and therefore can pass as a founding theory of the whole of mathematics. (V) The extended theory does not suffer from the conceptual flaws of the extant set-theoretical founding theories. (VI) The extended theory is not only conceptually but also logically superior to the competing set-theories because its consistency can be proved on the basis of weaker assumptions than the consistency of the competition. (shrink)

This text unites the logical and philosophical aspects of set theory in a manner intelligible both to mathematicians without training in formal logic and to logicians without a mathematical background. It combines an elementary level of treatment with the highest possible degree of logical rigor and precision. Starting with an explanation of all the basic logical terms and related operations, the text progresses through a stage-by-stage elaboration that proves the fundamental theorems of finite sets. It focuses on the Bernays (...) theory of finite classes and finite sets, exploring the system's basis and development, including Stage I and Stage II theorems, the theory of finite ordinals, and the theory of finite classes and finite sets. This volume represents an excellent text for undergraduates studying intermediate or advanced logic as well as a fine reference for professional mathematicians. (shrink)

Let K 0 λ be the class of structures $\langle\lambda, , where $A \subseteq \lambda$ is disjoint from a club, and let K 1 λ be the class of structures $\langle\lambda, , where $A \subseteq \lambda$ contains a club. We prove that if $\lambda = \lambda^{ is regular, then no sentence of L λ+κ separates K 0 λ and K 1 λ . On the other hand, we prove that if $\lambda = \mu^+,\mu = \mu^{ , and a forcing axiom (...) holds (and ℵ L 1 = ℵ 1 if μ = ℵ 0 ), then there is a sentence of L λλ which separates K 0 λ and K 1 λ. (shrink)

In this article the idea of random variables over the set theoretic universe is investigated. We explore what it can mean for a random set to have a specific probability of belonging to an antecedently given class of sets, or, in other words, to have a specific probability of having a given set-theoretic property.

A class K of structures is controlled if for all cardinals λ, the relation of L∞,λ-equivalence partitions K into a set of equivalence classes . We prove that no pseudo-elementary class with the independence property is controlled. By contrast, there is a pseudo-elementary class with the strict order property that is controlled 69–88).

Let K$^0_\lambda$ be the class of structures $\langle\lambda,<, A\rangle$, where $A \subseteq \lambda$ is disjoint from a club, and let K$^1_\lambda$ be the class of structures $\langle\lambda,<,A\rangle$, where $A \subseteq \lambda$ contains a club. We prove that if $\lambda = \lambda^{<\kappa}$ is regular, then no sentence of L$_{\lambda+\kappa}$ separates K$^0_\lambda$ and K$^1_\lambda$. On the other hand, we prove that if $\lambda = \mu^+,\mu = \mu^{<\mu}$, and a forcing axiom holds, then there is a sentence of L$_{\lambda\lambda}$ which separates K$^0_\lambda$ and (...) K$^1_\lambda$. (shrink)

The aim of the paper is to give a new definition of real number. The logical type of any number defined is that of the function B = h(A) which assigns to a class of sets A a class of sets B. I give some conditions which the function h has to fulfill to be considered as number; an intuitive sense of the conditions is as follows: a function, which is number, assigns a class of sets of (...) measure h·m to a class A of sets of equal measure, where m is the measure of A. (shrink)

REF is the statement that every stationary subset of a cardinal reflects, unless it fails to do so for a trivial reason. The main theorem, presented in Sect. 0, is that under suitable assumptions it is consistent that REF and there is a κ which is κ+n -supercompact. The main concepts defined in Sect. 1 are PT, which is a certain statement about the existence of transversals, and the “bad” stationary set. It is shown that supercompactness (and even the failure (...) of PT) implies the existence of non-reflecting stationary sets. E.g., if REF then for manyλ ⌝ PT(λ, ℵ1). In Sect. 2 it is shown that Easton-support iteration of suitable Levy collapses yield a universe with REF if for every singular λ which is a limit of supercompacts the bad stationary set concentrates on the “right” cofinalities. In Sect. 3 the use of oracle c.c. (and oracle proper—see [Sh-b, Chap. IV] and [Sh 100, Sect. 4]) is adapted to replacing the diamond by the Laver diamond. Using this, a universe as needed in Sect. 2 is forced, where one starts, and ends, with a universe with a proper class of supercompacts. In Sect. 4 bad sets are handled in ZFC. For a regular λ {δ<+ : cfδ<λ} is good. It is proved in ZFC that ifλ=cfλ>ℵ1 then {α<+ : cfα<λ} is the union of λ sets on which there are squares. (shrink)

We extend the notion of limitwise monotonic functions to include arbitrary computable domains. We then study which sets and degrees are support increasing limitwise monotonic on various computable domains. As applications, we provide a characterization of the sets S with computable increasing η-representations using support increasing limitwise monotonic sets on ℚ and note relationships between the class of order-computable sets and the class of support increasing limitwise monotonic sets on certain domains.

The article rebutts Michael Kremer’s contention that Russell’s contextual definition of set-theoretic language in Principia Mathematica constituted the ontological achievement of eliminating commitment to classes. Although Russell’s higher-order quantifiers, used in the definition, need not range over classes, none of the plausible substitutes provide a solid basis for eliminating them. This point is used to defend the presentation, in The Dawn of Analysis, of Russell’s logicist reduction, using a first-order version of naive set theory.

Do political concerns belong in psychodynamic treatment? How do class and politics shape the unconscious? The effects of an increasingly polarized, insecure and threatening world mean that the ideologically enforced split between the political order and personal life is becoming difficult to sustain. This book explores the impact of the social and political domains at the individual level. The contributions included in this volume describe how issues of class and politics, and the intense emotions they engender, emerge in the clinical (...) setting and how psychotherapists can respectfully address them rather than deny their significance. They demonstrate how clinicians need to take into account the complex convergences between psychic and social reality in the clinical setting in order to help their patients understand the anxiety, fear, insecurity and anger caused by the complex relations of class and power. This examination of the psychodynamics of terror and aggression and the unconscious defences employed to deny reality offers powerful insights into the microscopic unconscious ways that ideology is enacted and lived. _Psychoanalysis, Class and Politics_ will be of interest to all mental health professionals interested in improving their understanding of the ideological factors that impede or facilitate critical and engaged citizenship. It has a valuable contribution to make to the psychoanalytic enterprise, as well as to related scholarly and professional disciplines. (shrink)

We improve results of Marczewski, Frankiewicz, Brown, and others comparing the σ-ideals of measure zero, meager, Marczewski measure zero, and completely Ramsey null sets; in particular, we remove CH from the hypothesis of many of Brown's constructions of sets lying in some of these ideals but not in others. We improve upon work of Marczewski by constructing, without CH, a nonmeasurable Marczewski measure zero set lacking the property of Baire. We extend our analysis of σ-ideals to include the (...) completely Ramsey null sets relative to a Ramsey ultrafilter and obtain all 32 possible examples of sets in some ideals and not others, some under the assumption of MA, but most in ZFC alone. We also improve upon the known constructions of a Marczewski measure zero set which is not Ramsey by using a set theoretic hypothesis which is weaker than those used by other authors. We give several consistency proofs: one concerning the relative sizes of the covering numbers for the meager sets and the completely Ramsey null sets; another concerning the size of non(CRU 0); and a third concerning the size of add(CRU 0). We also study those classes of perfect sets which are bases for the class of always first category sets. (shrink)

We give several characterizations of Schnorr trivial sets, including a new lowness notion for Schnorr triviality based on truth-table reducibility. These characterizations allow us to see not only that some natural classes of sets, including maximal sets, are composed entirely of Schnorr trivials, but also that the Schnorr trivial sets form an ideal in the truth-table degrees but not the weak truth-table degrees. This answers a question of Downey, Griffiths and LaForte.

Let$ \le _c $be computable the reducibility on computably enumerable equivalence relations. We show that for every ceerRwith infinitely many equivalence classes, the index sets$\left\{ {i:R_i \le _c R} \right\}$,$\left\{ {i:R_i \ge _c R} \right\}$, and$\left\{ {i:R_i \equiv _c R} \right\}$are${\rm{\Sigma }}_3^0$complete, whereas in caseRhas only finitely many equivalence classes, we have that$\left\{ {i:R_i \le _c R} \right\}$is${\rm{\Pi }}_2^0$complete, and$\left\{ {i:R \ge _c R} \right\}$ is${\rm{\Sigma }}_2^0$complete. Next, solving an open problem from [1], we prove that the (...) index set of the effectively inseparable ceers is${\rm{\Pi }}_4^0$complete. Finally, we prove that the 1-reducibility preordering on c.e. sets is a${\rm{\Sigma }}_3^0$complete preordering relation, a fact that is used to show that the preordering relation$ \le _c $on ceers is a${\rm{\Sigma }}_3^0$complete preordering relation. (shrink)

Analyzing the effective content of the Lebesgue density theorem played a crucial role in some recent developments in algorithmic randomness, namely, the solutions of the ML-covering and ML-cupping problems. Two new classes of reals emerged from this inquiry: thepositive density pointswith respect toeffectively closed sets of reals, and a proper subclass, thedensity-one points. Bienvenu, Hölzl, Miller, and Nies have shown that the Martin-Löf random positive density points are exactly the ones that do not compute the halting problem. Treating (...) this theorem as our starting point, we present several new results that shed light on how density, randomness, and computational strength interact. (shrink)

A many-one degree is functional if it contains the index set of some class of partial recursive functions but does not contain an index set of a class of r.e. sets. We give a natural embedding of the r.e. m-degrees into the functional degrees of 0'. There are many functional degrees in 0' in the sense that every partial-order can be embedded. By generalizing, we show there are many functional degrees in every complete Turning degree. There is a natural (...) tie between the studies of index sets and partial-many-one reducibility. Every partial-many-one degree contains one or two index sets. (shrink)

The present paper is a contribution to the history of logic and its philosophy toward the mid-20th century. It examines the interplay between logic, type theory and set theory during the 1930s and 40s, before the reign of first-order logic, and the closely connected issue of the fate of logicism. After a brief presentation of the emergence of logicism, set theory, and type theory, Quine’s work is our central concern, since he was seemingly the most outstanding logicist around 1940, though (...) he would shortly abandon that viewpoint and promote first-order logic as all of logic. Quine’s class-theoretic systems NF and ML, and his farewell to logicism, are examined. The last section attempts to summarize the motives why set theory was preferred to other systems, and first orderlogic won its position as the paradigm logic system after the great War. (shrink)

1. If A is strongly amorphous , then its power set P is dually Dedekind infinite, i. e., every function from P onto P is injective. 2. The class of “inexhaustible” sets is not closed under supersets unless AC holds.

This paper presents a new approach to the class-theoretic paradoxes. In the first part of the paper, I will distinguish classes from sets, describe the function of class talk, and present several reasons for postulating type-free classes. This involves applications to the problem of unrestricted quantification, reduction of properties, natural language semantics, and the epistemology of mathematics. In the second part of the paper, I will present some axioms for type-free classes. My approach is loosely based (...) on the Gödel–Russell idea of limited ranges of significance. It is shown how to derive the second-order Dedekind–Peano axioms within that theory. I conclude by discussing whether the theory can be used as a solution to the problem of unrestricted quantification. In an appendix, I prove the consistency of the class theory relative to Zermelo–Fraenkel set theory. (shrink)

In this thesis, we study the least fixed point principle in a constructive setting. A constructive theory of functions and sets has been developed by Feferman. This theory deals both with sets and with functions over sets as independent notions. In the language of Feferman's theory, we are able to formulate the least fixed point principle for monotone inductive definitions as: every operation on classes to classes which satisfies the monotonicity condition has a least fixed (...) point. This is called the principle of monotone inductive definition. Furthermore, we may formulate this principle in a uniform way as: there is an operation which maps a monotone operation to its least fixed point. This is called the principle of uniform monotone inductive definition. Feferman raised the question of the strength of the principle of monotone inductive definition when adjoined to his theory . This question is our primary concern in this thesis. ;Our main results are the consistency of both the principle of monotone inductive definition and the principle of uniform monotone inductive definition adjoined to his theory, and the proof theoretical equivalence between the principle of monotone inductive definition with Feferman's system without the inductive generation axiom and the system of the Pi-one-one Comprehension Axiom. Determination of the proof-theoretical strength of the principle of monotone inductive definition adjoined to Feferman's theory still remains open. ;The consistency of both the principle of monotone inductive definition and the principle of uniform monotone inductive definition with Feferman's theory will be achieved by constructing their models in set theoretical sense. The proof theoretical equivalence between the principle of monotone inductive definition with Feferman's system without the inductive generation axiom and the system of the Pi-one-one Comprehension Axiom can be obtained by a careful examination of the model construction for the principle of monotone inductive definition with Feferman's system without the inductive generation axiom, which is parallel to the model construction for the principle of monotone inductive definition with his theory. (shrink)

Critique of set-theory as a founding theory of category-theory. Proposal of a theory of sets and classes as an adequate founding theory of mathematics and by implication of category-theory. This theory is a slight extension of Ackermann's theory of 1956.

The propositional calculus AoC, “Algebra of Classes”,and the extended propositional calculus EAC, “Extended Algebra ofClasses” are introduced in this paper. They are extensions, by additionalpropositional functions which are not invariant under the biconditional,of the corresponding classical propositional systems. Theirorigin lies in an analysis, motivated by Cantor’s concept of the cardinalnumbers, of A. P. Morse’s impredicative, polysynthetic set theory.

An effectively closed set, or ${\Pi^{0}_{1}}$ class, may viewed as the set of infinite paths through a computable tree. A numbering, or enumeration, is a map from ω onto a countable collection of objects. One numbering is reducible to another if equality holds after the second is composed with a computable function. Many commonly used numberings of ${\Pi^{0}_{1}}$ classes are shown to be mutually reducible via a computable permutation. Computable injective numberings are given for the family of ${\Pi^{0}_{1}}$ (...) class='Hi'>classes and for the subclasses of decidable and of homogeneous ${\Pi^{0}_{1}}$ classes. However no computable numberings exist for small or thin classes. No computable numbering of trees exists that includes all computable trees without dead ends. (shrink)