Study, with text of the Yogasūtra of Patañjali, text on Yoga philosophy.

O objetivo deste artigo é apresentar a analogia básica entre arquitetura e retórica antiga a partir dos tratados De Architectura, de Vitrúvio, e o De Oratore, de Cícero. A analogia se verifica na definição do artífice, dos gêneros e partes das técnicas e dos fins de cada uma delas. Para tanto, tomaram-se como referência as fontes do tratado vitruviano, que menciona a influência de Varrão na gramática, de Lucrécio na filosofia e de Cícero no método oratório. A analogia com Cícero (...) serve tanto para conferir autoridade ao modelo de arquiteto vitruviano quanto para diferenciar a arquitetura das demais ciências, sobretudo a filosofia, objeto de debate na obra ciceroniana. (shrink)

As is well known, any preorder R on a set U induces an Alexandrov topology on U. In some interesting cases related to data mining an Alexandrov topology can be transformed into different types of logico-algebraic models. In some cases, (pre)topological operators provided by Pointless Topology may define a topological space on U even if R is not a preorder. If this is the case, then we call R a crypto-preorder. The paper studies the conditions under which a relation R (...) is a crypto-preorder and how to transform a crypto-preorder into a proper preorder. (shrink)

This paper aims to pay tribute to Figal’s comprehensive and innovative analysis of the artwork and beauty, while challenging both his realist position on the immediacy of meaning and his monist stance that reduces sublimity to beauty. To enquire into the origin of aesthetic feelings and sense, and thus, to break the hermeneutic circle, we first trace the origin of this reduction to the reception of Burke’s concept of the sublime by Mendelssohn and Kant. We then recur to Husserl and (...) Dufrenne to trace the origin of the sense of the feeling of sublimity in the realm of affectivity or sensuousness. This genesis takes place in passive experience, where we identify an excess of sensuous sense over categorial meaning that is constitutive of the affective sense that our bodily sensations give to hyletic material. It is argued that this sensuous excess evokes a sublime experience in the phenomenological sense, involving an affective and disruptive bodily experience and an endless process of sense formation. Affective or sensuous sense is thus an event that irreversibly affects the bodily surface. To elucidate this phenomenon, we draw on the theoretical framework of Breton and Bataille, positing it as a form-transgressive ‘convulsive’ sublime, which we then illustrate in the architectural works of Tschumi and Eisenman. In short, we have retrieved the origin of aesthetic experience and redefined the feeling of the sublime as a phenomenological ‘convulsive’ sublimity. (shrink)

It is shown that the notion of the partition of a set can be used to describe in a uniform way the meaning of the expression the same, in its basic uses in transitive and ditransitive sentences. Some formal properties of the function denoted by the same, which follow from such a description are indicated. These properties indicate similarities and differences between functions denoted by the same and generalised quantifiers.

Problems for strict and convex Bayesianism are discussed. A set-based Bayesianism generalizing convex Bayesianism and intervalism is proposed. This approach abandons not only the strict Bayesian requirement of a unique real-valued probability function in any decision-making context but also the requirement of convexity for a set-based representation of uncertainty. Levi's E-admissibility decision criterion is retained and is shown to be applicable in the nonconvex case.

Causal set theory and the theory of linear structures (which has recently been developed by Tim Maudlin as an alternative to standard topology) share some of their main motivations. In view of that, I raise and answer the question how these two theories are related to each other and to standard topology. I show that causal set theory can be embedded into Maudlin’s more general framework and I characterise what Maudlin’s topological concepts boil down to when applied to discrete linear (...) structures that correspond to causal sets. Moreover, I show that all topological aspects of causal sets that can be described in Maudlin’s theory can also be described in the framework of standard topology. Finally, I discuss why these results are relevant for evaluating Maudlin’s theory. The value of this theory depends crucially on whether it is true that (a) its conceptual framework is as expressive as that of standard topology when it comes to describing well-known continuous as well as discrete models of spacetime and (b) it is even more expressive or fruitful when it comes to analysing topological aspects of discrete structures that are intended as models of spacetime. On the one hand, my theorems support (a): the theory is rich enough to incorporate causal set theory and its definitions of topological notions yield a plausible outcome in the case of causal sets. On the other hand, the results undermine (b): standard topology, too, has the conceptual resources to capture those topological aspects of causal sets that are analysable within Maudlin’s framework. This fact poses a challenge for the proponents of Maudlin’s theory to prove it fruitful. (shrink)

Every set can been thought of as a directed graph whose edge relation is ∈. We show that many natural examples of directed graphs of this kind are indivisible: for every infinite κ, for every indecomposable λ, and every countable model of set theory. All of the countable digraphs we consider are orientations of the countable random graph. In this way we find indivisible well‐founded orientations of the random graph that are distinct up to isomorphism, and ℵ1 that are distinct (...) up to siblinghood. (shrink)

We study the degrees of unsolvability of sets which are cohesive . We answer a question raised by the first author in 1972 by showing that there is a cohesive set A whose degree a satisfies a' = 0″ and hence is not high. We characterize the jumps of the degrees of r-cohesive sets, and we show that the degrees of r-cohesive sets coincide with those of the cohesive sets. We obtain analogous results for strongly hyperimmune and strongly hyperhyperimmune sets (...) in place of r-cohesive and cohesive sets, respectively. We show that every strongly hyperimmune set whose degree contains either a Boolean combination of ∑2 sets or a 1-generic set is of high degree. We also study primitive recursive analogues of these notions and in this case we characterize the corresponding degrees exactly. MSC: 03D30, 03D55. (shrink)

Set-theoretic pluralism is an increasingly influential position in the philosophy of set theory (Balaguer [1998], Linksy and Zalta [1995], Hamkins [2012]). There is considerable room for debate about how best to formulate set-theoretic pluralism, and even about whether the view is coherent. But there is widespread agreement as to what there is to recommend the view (given that it can be formulated coherently). Unlike set-theoretic universalism, set-theoretic pluralism affords an answer to Benacerraf’s epistemological challenge. The purpose of this paper is (...) to determine what Benacerraf’s challenge could be such that this view is warranted. I argue that it could not be any of the challenges with which it has been traditionally identified by its advocates, like of Benacerraf and Field. Not only are none of the challenges easier for the pluralist to meet. None satisfies a key constraint that has been placed on Benacerraf’s challenge. However, I argue that Benacerraf’s challenge could be the challenge to show that our set-theoretic beliefs are safe – i.e., to show that we could not have easily had false ones. Whether the pluralist is, in fact, better positioned to show that our set-theoretic beliefs are safe turns on a broadly empirical conjecture which is outstanding. If this conjecture proves to be false, then it is unclear what the epistemological argument for set-theoretic pluralism is supposed to be. (shrink)

Michael Potter presents a comprehensive new philosophical introduction to set theory. Anyone wishing to work on the logical foundations of mathematics must understand set theory, which lies at its heart. Potter offers a thorough account of cardinal and ordinal arithmetic, and the various axiom candidates. He discusses in detail the project of set-theoretic reduction, which aims to interpret the rest of mathematics in terms of set theory. The key question here is how to deal with the paradoxes that bedevil set (...) theory. Potter offers a strikingly simple version of the most widely accepted response to the paradoxes, which classifies sets by means of a hierarchy of levels. What makes the book unique is that it interweaves a careful presentation of the technical material with a penetrating philosophical critique. Potter does not merely expound the theory dogmatically but at every stage discusses in detail the reasons that can be offered for believing it to be true. Set Theory and its Philosophy is a key text for philosophy, mathematical logic, and computer science. (shrink)

Answer-set programming (ASP) has emerged as a declarative programming paradigm where problems are encoded as logic programs, such that the so-called answer sets of theses programs represent the solutions of the encoded problem. The efficiency of the latest ASP solvers reached a state that makes them applicable for problems of practical importance. Consequently, problems from many different areas, including diagnosis, data integration, and graph theory, have been successfully tackled via ASP. In this work, we present such ASP-encodings for problems associated (...) to abstract argumentation frameworks (AFs) and generalisations thereof. Our encodings are formulated as fixed queries, such that the input is the only part depending on the actual AF to process. We illustrate the functioning of this approach, which is underlying a new argumentation system called ASPARTIX in detail and show its adequacy in terms of computational complexity. (shrink)

Critical-set views avoid the Repugnant Conclusion by subtracting some constant from the welfare score of each life in a population. These views are thus sensitive to facts about biographical identity: identity between lives. In this paper, I argue that questions of biographical identity give us reason to reject critical-set views and embrace the total view. I end with a practical implication. If we shift our credences towards the total view, we should also shift our efforts towards ensuring that humanity survives (...) for the long term. (shrink)

In this paper we explore a connection between descriptive set theory and inner model theory. From descriptive set theory, we will take a countable, definable set of reals, A. We will then show that , where is a canonical model from inner model theory. In technical terms, is a “mouse”. Consequently, we say that A is a mouse set. For a concrete example of the type of set A we are working with, let ODnω1 be the set of reals which (...) are ∑n definable over the model Lω1 , from an ordinal parameter. In this paper we will show that for all n 1, ODnω1 is a mouse set. Our work extends some similar results due to D.A. Martin, J.R. Steel, and H. Woodin. Several interesting questions in this area remain open. (shrink)

The iterative conception of set is typically considered to provide the intuitive underpinnings for ZFCU (ZFC+Urelements). It is an easy theorem of ZFCU that all sets have a definite cardinality. But the iterative conception seems to be entirely consistent with the existence of “wide” sets, sets (of, in particular, urelements) that are larger than any cardinal. This paper diagnoses the source of the apparent disconnect here and proposes modifications of the Replacement and Powerset axioms so as to allow for the (...) existence of wide sets. Drawing upon Cantor’s notion of the absolute infinite, the paper argues that the modifications are warranted and preserve a robust iterative conception of set. The resulting theory is proved consistent relative to ZFC + “there exists an inaccessible cardinal number.”. (shrink)

Call a quantifier unrestricted if it ranges over absolutely all things: not just over all physical things or all things relevant to some particular utterance or discourse but over absolutely everything there is. Prima facie, unrestricted quantification seems to be perfectly coherent. For such quantification appears to be involved in a variety of claims that all normal human beings are capable of understanding. For instance, some basic logical and mathematical truths appear to involve unrestricted quantification, such as the truth that (...) absolutely everything is self-identical and the truth that the empty set has absolutely no members. Various metaphysical views too appear to involve unrestricted quantification, such as the physicalist view that absolutely everything is physical. (shrink)

For regular sets in Euclidean space, previous work has identified twelve ‘basic’ computability notions to which many previous notions considered in literature were shown to be equivalent. With respect to those basic notions we now investigate on the computability of natural operations on regular sets: union, intersection, complement, convex hull, image, and pre-image under suitable classes of functions. It turns out that only few of these notions are suitable in the sense of rendering all those operations uniformly computable.

This paper analyzes concepts of independence and assumptions of convexity in the theory of sets of probability distributions. The starting point is Kyburg and Pittarelli’s discussion of “convex Bayesianism” (in particular their proposals concerning E-admissibility, independence, and convexity). The paper offers an organized review of the literature on independence for sets of probability distributions; new results on graphoid properties and on the justification of “strong independence” (using exchangeability) are presented. Finally, the connection between Kyburg and Pittarelli’s results and recent developments (...) on the axiomatization of non-binary preferences, and its impact on “complete” independence, are described. (shrink)

Meeting the net zero emission targets set by many states after the Paris Agreement to help keep global warming well below 2°C above pre-industrial levels will require carbon dioxide removal technologies (CDRs). Several moral concerns arise if the contribution of CDRs to achieving net zero is not specified, but such concerns can be met by defining a permissible target for CDRs. This paper proposes a framework for defining the permissible contribution of CDRs to the net zero targets of individual states. (...) The framework identifies three categories of emissions for which the permissibility of CDRs varies depending on the ethical costs of both emission abatement and CDRs. We argue that a) luxury emissions should be reduced without using CDRs; b) emissions for full membership in society should be abated by structural efforts, although using CDRs is permissible, given certain conditions; and c) CDRs are permissible for residual emissions because otherwise net zero targets cannot be reached. (shrink)

This is an introduction to set theory and logic that starts completely from scratch. The text is accompanied by many methodological remarks and explanations.

Public sphere is an important idea of Habermas in the early research, which guided his latter research, especially in political philosophy field. According to Habermas’ research on public sphere, this paper researches public sphere’s significance in solving the legalization crisis of capitalism and remedying the democratic theory of bourgeoisie. Public sphere idea set up a new model of the democratic theory, deliberative democracy, which is better than democracy of both liberalism and republicanism, and become the most important theme of Habermas (...) in theory and practice. (shrink)

The multiverse view in set theory, introduced and argued for in this article, is the view that there are many distinct concepts of set, each instantiated in a corresponding set-theoretic universe. The universe view, in contrast, asserts that there is an absolute background set concept, with a corresponding absolute set-theoretic universe in which every set-theoretic question has a definite answer. The multiverse position, I argue, explains our experience with the enormous range of set-theoretic possibilities, a phenomenon that challenges the universe (...) view. In particular, I argue that the continuum hypothesis is settled on the multiverse view by our extensive knowledge about how it behaves in the multiverse, and as a result it can no longer be settled in the manner formerly hoped for. (shrink)

Our aim is to show that translating the modal graphs of Moretti’s “n-opposition theory” (2004) into set theory by a suited device, through identifying logical modal formulas with appropriate subsets of a characteristic set, one can, in a constructive and exhaustive way, by means of a simple recurring combinatory, exhibit all so-called “logical bi-simplexes of dimension n” (or n-oppositional figures, that is the logical squares, logical hexagons, logical cubes, etc.) contained in the logic produced by any given modal graph (an (...) exhaustiveness which was not possible before). In this paper we shall handle explicitly the classical case of the so-called 3(3)-modal graph (which is, among others, the one of S5), getting to a very elegant tetraicosahedronal geometrisation of this logic. (shrink)

Philosophers of science since Nagel have been interested in the links between intertheoretic reduction and explanation, understanding and other forms of epistemic progress. Although intertheoretic reduction is widely agreed to occur in pure mathematics as well as empirical science, the relationship between reduction and explanation in the mathematical setting has rarely been investigated in a similarly serious way. This paper examines an important particular case: the reduction of arithmetic to set theory. I claim that the reduction is unexplanatory. In (...) defense of this claim, I offer evidence from mathematical practice, and I respond to contrary suggestions due to Steinhart, Maddy, Kitcher and Quine. I then show how, even if set-theoretic reductions are generally not explanatory, set theory can nevertheless serve as a legitimate foundation for mathematics. Finally, some implications of my thesis for philosophy of mathematics and philosophy of science are discussed. In particular, I suggest that some reductions in mathematics are probably explanatory, and I propose that differing standards of theory acceptance might account for the apparent lack of unexplanatory reductions in the empirical sciences. (shrink)

In light of the close connection between the ontological hierarchy of set theory and the ideological hierarchy of type theory, Øystein Linnebo and Agustín Rayo have recently offered an argument in favour of the view that the set-theoretic universe is open-ended. In this paper, we argue that, since the connection between the two hierarchies is indeed tight, any philosophical conclusions cut both ways. One should either hold that both the ontological hierarchy and the ideological hierarchy are open-ended, or that neither (...) is. If there is reason to accept the view that the set-theoretic universe is open-ended, that will be because such a view is the most compelling one to adopt on the purely ontological front. (shrink)

In Setting Limits, Daniel Callahan advances the provocative thesis that age be a limiting factor in decisions to allocate certain kinds of health services to the elderly. However, when one looks at available data, one discovers that there are many more elderly women than there are elderly men, and these older women are poorer, more apt to live alone, and less likely to have informal social and personal supports than their male counterparts. Older women, therefore, will make the heaviest (...) demand on health care resources. If age were to become a limiting factor, as Dr. Callahan sug-gests it should, the limits that will be set are limits that will affect women more dras” tically than they affect men. This review essay examines the implications of Callahan's thesis for elderly women. (shrink)

In this contribution, I explore the possibility of characterizing the emergence of time in causal set theory (CST) in terms of the growing block universe (GBU) metaphysics. I show that although GBU seems to be the most intuitive time metaphysics for CST, it leaves us with a number of interpretation problems, independently of which dynamics we choose to favor for the theory —here I shall consider the Classical Sequential Growth and the Covariant model. Discrete general covariance of the CSG dynamics (...) does not allow us to individuate a single history of the universe (defined by a causal history of different causal sets), thereby making the claim that ‘the past exists’ at best problematic. In addition, because the evolution of the universe in CSG dynamics leads to an outward branching causal tree, it becomes impossible to determine a proper ‘line of becoming’, thereby blurring the presentists’ claim that only the present exists. Similarly, the covariant approach runs into the same, if not even more severe problems, since each configuration of the universe would amount to a set of possible causal sets, thereby making the individuation of a single configuration of the universe —and thus the physical interpretation of the theory— implausible. (shrink)

This is a survey of work on set-theoretical invariance criteria for logicality. It begins with a review of the Tarski-Sher thesis in terms, first, of permutation invariance over a given domain and then of isomorphism invariance across domains, both characterized by McGee in terms of definability in the language L∞,∞. It continues with a review of critiques of the Tarski-Sher thesis, and a proposal in response to one of those critiques via homomorphism invariance. That has quite divergent characterization results depending (...) on its formulation, one in terms of FOL, the other by Bonnay in terms of L∞,∞, both without equality. From that we move on to a survey of Bonnay’s work on similarity relations between structures and his results that single out invariance with respect to potential isomorphism among all such. Turning to the critique that calls for sameness of meaning of a logical operation across domains, the paper continues with a result showing that the isomorphism invariant operations that are absolutely definable with respect to KPU−Inf are exactly those definable in full FOL; this makes use of an old theorem of Manders. The concluding section is devoted to a critical discussion of the arguments for set-theoretical criteria for logicality. (shrink)

I introduce an effective enumeration of all effective enumerations of classes of r. e. sets and define with this the index set IE of injectively enumerable classes. It is easy to see that this set is ∑5 in the Arithmetical Hierarchy and I describe a proof for the ∑5-hardness of IE.

This exploration of a notorious mathematical problem is the work of the man who discovered the solution. Written by an award-winning professor at Stanford University, it employs intuitive explanations as well as detailed mathematical proofs in a self-contained treatment. This unique text and reference is suitable for students and professionals. 1966 edition. Copyright renewed 1994.

We consider a set-theoretic version of mereology based on the inclusion relation ⊆ and analyze how well it might serve as a foundation of mathematics. After establishing the non-definability of ∈ from ⊆, we identify the natural axioms for ⊆-based mereology, which constitute a finitely axiomatizable, complete, decidable theory. Ultimately, for these reasons, we conclude that this form of set-theoretic mereology cannot by itself serve as a foundation of mathematics. Meanwhile, augmented forms of set-theoretic mereology, such as that obtained by (...) adding the singleton operator, are foundationally robust. (shrink)

Sets are central to mathematics and its foundations, but what are they? In this book Luca Incurvati provides a detailed examination of all the major conceptions of set and discusses their virtues and shortcomings, as well as introducing the fundamentals of the alternative set theories with which these conceptions are associated. He shows that the conceptual landscape includes not only the naïve and iterative conceptions but also the limitation of size conception, the definite conception, the stratified conception and the graph (...) conception. In addition, he presents a novel, minimalist account of the iterative conception which does not require the existence of a relation of metaphysical dependence between a set and its members. His book will be of interest to researchers and advanced students in logic and the philosophy of mathematics. (shrink)

The paper investigates inaccessible set axioms and their consistency strength in constructive set theory. In ZFC inaccessible sets are of the form Vκ where κ is a strongly inaccessible cardinal and Vκ denotes the κth level of the von Neumann hierarchy. Inaccessible sets figure prominently in category theory as Grothendieck universes and are related to universes in type theory. The objective of this paper is to show that the consistency strength of inaccessible set axioms heavily depend on the context in (...) which they are embedded. The context here will be the theory CZF− of constructive Zermelo–Fraenkel set theory but without -Induction . Let INAC be the statement that for every set there is an inaccessible set containing it. CZF−+INAC is a mathematically rich theory in which one can easily formalize Bishop style constructive mathematics and a great deal of category theory. CZF−+INAC also has a realizability interpretation in type theory which gives its theorems a direct computational meaning. The main result presented here is that the proof theoretic ordinal of CZF−+INAC is a small ordinal known as the Feferman–Schütte ordinal Γ0. (shrink)

Psychological essentialism is a cognitive bias through which human beings conceive the entities around them as having inner essences and basic natures. Social scientists routinely generate flawed inferences because their methods require the truth of psychological essentialism. This article develops set-theoretic analysis as a scientific-constructivist approach that overcomes the bias of psychological essentialism. With this approach, the “sets” of set-theoretic analysis are mental phenomena that establish boundaries and identify similarities and differences among entities whose natural kind composition is not known. (...) The approach is illustrated through a consideration of research on intelligence, race, and poverty in the United States. (shrink)

Suppose that the members of a group each hold a rational set of judgments on some interconnected questions, and imagine that the group itself has to form a collective, rational set of judgments on those questions. How should it go about dealing with this task? We argue that the question raised is subject to a difficulty that has recently been noticed in discussion of the doctrinal paradox in jurisprudence. And we show that there is a general impossibility theorem that that (...) difficulty illustrates. Our paper describes this impossibility result and provides an exploration of its significance. The result naturally invites comparison with Kenneth Arrow's famous theorem (Arrow, 1963 and 1984; Sen, 1970) and we elaborate that comparison in a companion paper (List and Pettit, 2002). The paper is in four sections. The first section documents the need for various groups to aggregate its members' judgments; the second presents the discursive paradox; the third gives an informal statement of the more general impossibility result; the formal proof is presented in an appendix. The fourth section, finally, discusses some escape routes from that impossibility. (shrink)

Bringsjord (1985) argues that the definition W of possible worlds as maximal possible sets of propositions is incoherent. Menzel (1986a) notes that Bringsjord’s argument depends on the Powerset axiom and that the axiom can be reasonably denied. Grim (1986) counters that W can be proved to be incoherent without Powerset. Grim was right. However, the argument he provided is deeply flawed. The purpose of this note is to detail the problems with Grim’s argument and to present a sound alternative argument (...) for his conclusion – basically the argument Russell gave to establish a well-known paradox in The Principles of Mathematics. (shrink)