We study the non-wellfounded sets as fixed points of substitution. For example, we show that ZFA implies that every function has a fixed point. As a corollary we determine for which functions f there is a function g such that . We also present a classification of non-wellfounded sets according to their branching structure.

We prove that if I is a partially ordered set in a countable transitive model M of ZFC then M can be extended by a generic sequence of reals a i , i ∈ I, such that ℵ M 1 is preserved and every a i is Sacks generic over $\mathfrak{M}[\langle \mathbf{a}_j: j . The structure of the degrees of M-constructibility of reals in the extension is investigated. As applications of the methods involved, we define a cardinal invariant to distinguish (...) product and iterated Sacks extensions, and give a short proof of a theorem (by Budinas) that in ω 2 -iterated Sacks extension of L the Burgess selection principle for analytic equivalence relations holds. (shrink)

A finitary characterization for non-well-founded sets with finite transitive closure is established in terms of a greatest fixpoint formula of the modal μ-calculus. This generalizes the standard result in the literature where a finitary modal characterization is provided only for wellfounded sets with finite transitive closure. The proof relies on the concept of automaton, leading then to new interlinks between automata theory and non-well-founded sets.

A complete list of Finsler, Scott and Boffa sets whose transitive closures contain 1, 2 and 3 elements is given. An algorithm for deciding the identity of hereditarily finite Scott sets is presented. Anti-well-founded sets, i. e., non-well-founded sets whose all maximal ∈-paths are circular, are studied. For example they form transitive inner models of ZFC minus foundation and empty set, and they include uncountably many hereditarily finite awf sets. A complete list of Finsler and (...) Boffa awf sets with 2 and 3 elements in their transitive closure is given. Next the existence of infinite descending ∈-sequences in Aczel universes is shown. Finally a theorem of Ballard and Hrbáček concerning nonstandard Boffa universes of sets is considerably extended. (shrink)

The iterative conception of set commonly is regarded as supporting the axioms of Zermelo-Fraenkel set theory (ZF). This paper presents a modified version of the iterative conception of set and explores the consequences of that modified version for set theory. The modified conception maintains most of the features of the iterative conception of set, but allows for some non-wellfounded sets. It is suggested that this modified iterative conception of set supports the axioms of Quine's set theory NF.

Aczel's theory of hypersets provides an interesting alternative to the standard view of sets as inductively constructed, well-founded objects, thus providing a convienent formalism in which to consider non-well-founded versions of classically well-founded constructions, such as the "circular logic" of [3]. This theory and ZFC are mutually interpretable; in particular, any model of ZFC has a canonical "extension" to a non-well-founded universe. The construction of this model does not immediately generalize to weaker set theories such as the theory of (...) admissible sets. In this paper, we formulate a version of Aczel's antifoundation axiom suitable for the theory of admissible sets. We investigate the properties of models of the axiom system KPU - , that is, KPU with foundation replaced by an appropriate strengthening of the extensionality axiom. Finally, we forge connections between "non-wellfounded sets over the admissible set A" and the fragment L A of the modal language L ∞. (shrink)

We approach the virtual reality phenomenon by studying its relationship to set theory. This approach offers a characterization of virtual reality in set theoretic terms, and we investigate the case where this is done using the wellfoundedness property. Our hypothesis is that non-wellfounded sets (so-called hypersets) give rise to a different quality of virtual reality than do familiar wellfounded sets. To elaborate this hypothesis, we describe virtual reality through Sommerhoff’s categories of first- and second-order self-awareness; introduced (...) as necessary conditions for consciousness in terms of higher cognitive functions. We then propose a representation of first- and second-order self-awareness through sets, and assume that these sets, which we call events, originally form a collection of wellfounded sets. Strong virtual reality characterizes virtual reality environments which have the limited capacity to create only events associated with wellfounded sets. In contrast, the logically weaker and more general concept of weak virtual reality characterizes collections of virtual reality mediated events altogether forming an entirety larger than any collection of wellfounded sets. By giving reference to Aczel’s hyperset theory we indicate that this definition is not empty because hypersets encompass wellfounded sets already. Moreover, we argue that weak virtual reality could be realized in human history through continued progress in computer technology. Finally, within a more general framework, we use Baltag’s structural theory of sets (STS) to show that within this hyperset theory Sommerhoff’s first- and second-order self-awareness as well as both concepts of virtual reality admit a consistent mathematical representation. To illustrate our ideas, several examples and heuristic arguments are discussed. (shrink)

This paper is a systematic exploration of non-wellfounded mereology. Motivations and applications suggested in the literature are considered. Some are exotic like Borges’ Aleph, and the Trinity; other examples are less so, like time traveling bricks, and even Geach’s Tibbles the Cat. The authors point out that the transitivity of non-wellfounded parthood is inconsistent with extensionality. A non-wellfounded mereology is developed with careful consideration paid to rival notions of supplementation and fusion. Two equivalent axiomatizations are given, and (...) are compared to classical mereology. We provide a class of models with respect to which the non-wellfounded mereology is sound and complete. (shrink)

Section 1 is devoted to the study of countable recursively saturated models with an automorphism moving every non-algebraic point. We show that every countable theory has such a model and exhibit necessary and sufficient conditions for the existence of automorphisms moving all non-algebraic points. Furthermore we show that there are many complete theories with the property that every countable recursively saturated model has such an automorphism. In Section 2 we apply our main theorem from Section 1 to models of Quine's (...) set theory New Foundations (NF) to answer an old consistency question. If NF is consistent, then it has a model in which the standard natural numbers are a definable subclass N of the model's set of internal natural numbers Nn. In addition, in this model the class of wellfounded sets is exactly $\bigcup_{n\in \mathbb{N}}\mathscr{P}^n(\varnothing)$. (shrink)

In a previous article on cosmological arguments, I have put forward a few examples of complete infinite and circular explanations, and argued that complete non-wellfounded explanations such as these might explain the present state of the world better than their well-founded theistic counterparts (Billon, 2021). Although my aim was broader, the examples I gave there implied merely causal explanations. In this article, I would like to do three things: • Specify some general informative conditions for complete and incomplete non- (...) class='Hi'>wellfounded causal explanations that can be used to assess candidate explanations and to generate new examples of complete non-wellfounded explanations. • Show that these conditions, which concern chains of causal explanations, easily generalize to chains of metaphysical, grounding explanations and even to chains involving other “determination relations” such as supervenience. • Apply these general conditions to the recent debates against the existence of nonwellfounded chains of grounds and show, with a couple of precise examples, that the latter can be complete, and that just like in the case of causal explanations, non-wellfoundedness can in fact be an aset rather than a liability. (shrink)

In this paper we study iterated circular multisets in a coalgebraic framework. We will produce two essentially different universes of such sets. The unisets of the first universe will be shown to be precisely the sets of the Scott universe. The unisets of the second universe will be precisely the sets of the AFA-universe. We will have a closer look into the connection of the iterated circular multisets and arbitrary trees. RID=""ID="" Mathematics Subject Classification (2000): 03B45, 03E65, (...) 03E70, 18A15, 18A22, 18B05, 68Q85 RID=""ID="" Key words or phrases: Multiset – Non-wellfounded set – Scott-universe – AFA – Coalgebra – Modal logic – Graded modalities. (shrink)

The paper explores the proof theory of non-wellfounded mereology with binary fusions and provides a cut-free sequent calculus equivalent to the standard axiomatic system.

Frege’s Basic Law V and its successor, Boolos’s New V, are axioms postulating abstraction operators: mappings from the power set of the domain into the domain. Basic Law V proved inconsistent. New V, however, naturally interprets large parts of second-order ZFC via a construction discovered by Boolos in 1989. This paper situates these classic findings about abstraction operators within the general theory of F-algebras and coalgebras. In particular, we show how Boolos’s construction amounts to identifying an initial F-algebra in a (...) certain category, we identify a natural coalgebraic dual to Boolos’s axiom which naturally interprets large parts of Aczel’s non-well-founded set theory via the construction of a certain terminal F-coalgebra, and we suggest a coalgebraic way forward for an abstraction-theoretic axiomatization of the real numbers. (shrink)

In this paper I propose a new approach to the foundation of mathematics: non-monotonic set theory. I present two completely different methods to develop set theories based on adaptive logics. For both theories there is a finitistic non-triviality proof and both theories contain (a subtle version of) the comprehension axiom schema. The first theory contains only a maximal selection of instances of the comprehension schema that do not lead to inconsistencies. The second allows for all the instances, also the inconsistent (...) ones, but restricts the conclusions one can draw from them in order to avoid triviality. The theories have enough expressive power to form a justification/explication for most of the established results of classical mathematics. They are therefore not limited by Gödel’s incompleteness theorems. This remarkable result is possible because of the non-recursive character of the final proofs of theorems of non-monotonic theories. I shall argue that, precisely because of the computational complexity of these final proofs, we cannot claim that non-monotonic theories are ideal foundations for mathematics. Nevertheless, thanks to their strength, first order language and the recursive dynamic (defeasible) proofs of theorems of the theory, the non-monotonic theories form (what I call) interesting pragmatic foundations. (shrink)

Let ZFB be ZF + "every set is the same size as a wellfounded set". Then the following are true. Every sentence true in every (Rieger-Bernays) permutation model of a model of ZF is a theorem of ZFB. (i.e.. ZFB is the theory of Rieger-Bernays permutation models of models of ZF) ZF and ZFAFA are both extensions of ZFB conservative for stratified formulæ. The class of models of ZFB is closed under creation of Rieger-Bernays permutation models.

The paper generalizes Van McGee's well-known result that there are many maximal consistent sets of instances of Tarski's schema to a number of non-classical theories of truth. It is shown that if a non-classical theory rejects some classically valid principle in order to avoid the truth-theoretic paradoxes, then there will be many maximal non-trivial sets of instances of that principle that the non-classical theorist could in principle endorse. On the basis of this it is argued that the idea (...) of classical recapture, which plays such an important role for non-classical logicians, can only be pushed so far. (shrink)

A semantics is presented for belief-revision in the face of common announcements to a group of agents that have beliefs about each other's beliefs. The semantics is based on the idea that possible worlds can be viewed as having an internal structure, representing the belief independent features of the world, and the respective belief states of the agents in a modular fashion. Modularity guarantees that changing one aspect of the world (a belief independent feature or a belief state) has no (...) effect on any other aspect of the world. This allows us to employ an AGM-style selection function to represent revision. The semantics is given a complete axiomatisation (identical to the axiomatisation found by Gerbrandy and Groeneveld for a semantics based on non-wellfounded set theory) for the special case of expansion. (shrink)

In this paper we extend to non-classical set theories the standard strategy of proving independence using Boolean-valued models. This extension is provided by means of a new technique that, combining algebras (by taking their product), is able to provide product-algebra-valued models of set theories. In this paper we also provide applications of this new technique by showing that: (1) we can import the classical independence results to non-classical set theory (as an example we prove the independence of $\mathsf {CH}$ ); (...) and (2) we can provide new independence results. We end by discussing the role of non-classical algebra-valued models for the debate between universists and multiversists and by arguing that non-classical models should be included as legitimate members of the multiverse. (shrink)

A semantics is presented for belief revision in the face of common announcements to a group of agents that have beliefs about each other’s beliefs. The semantics is based on the idea that possible worlds can be viewed as having an internal-structure, representing the belief independent features of the world, and the respective belief states of the agents in a modular fashion. Modularity guarantees that changing one aspect of the world (a belief independent feature or a belief state) has no (...) effect on any other aspect of the world. This allows us to employ an AGM-style selection function to represent revision. The semantics is given a complete axiomatisation (identical to the axiomatisation found by Gerbrandy and Groeneveld for a semantics based on non-wellfounded set theory) for the special case of expansion. (shrink)

The paper addresses the widely held position that the Third Man regress in the Parmenides is caused at least in part by the self-predicational aspect of Plato's Ideas. I offer a critique of the logic behind this type of interpretation, and argue that if the Ideas are construed as genuinely applying to themselves, then the regress is dissolved. Furthermore, such an interpretation can be made technically precise by modeling Platonic Universals as non-wellfounded sets. This provides a solution to (...) the Third Man regress, and allows a consistent reading of both self-predication and the singularity of the respective Forms. (shrink)

We present a case study for the debate between the American and the Australian plans, analyzing a crucial aspect of negation: expressivity within a theory. We discuss the case of non-classical set theories, presenting three different negations and testing their expressivity within algebra-valued structures for ZF-like set theories. We end by proposing a minimal definitional account of negation, inspired by the algebraic framework discussed.

We consider foundational questions related to the definition of functions by corecursion. This method is especially suited to functions into the greatest fixed point of some monotone operator, and it is most applicable in the context of non-wellfounded sets. We review the work on the Special Final Coalgebra Theorem of Aczel [1] and the Corecursion Theorem of Barwise and Moss [4]. We offer a condition weaker than Aczel's condition of uniformity on maps, and then we prove a result (...) relating the operators satisfying the new condition to the smooth operators of [4]. (shrink)

The main claim of this paper is that the boundary between scientific and non scientific knowledge does exist -- which means several things. First, it's not the case that anything goes: some irrationalists have been mistaken into acceptance of that wrong conclusion because they have remarked that, however the boundary might be drawn, some important scientific developments would fall afoul of the standards entitling a research practice to count as scientific. Second, the boundary is not an imaginary one, that is (...) to say besides what is scientific and what is unscientific there also is what lies at the boundary, certain research practices which are neither wholly scientific nor fully unscientific. Third, studying what is science is itself a kind of research belonging to the boundary, since the methods available in that research are not as strictly rigorous as those used in science proper; in fact, all of philosophy is included in the boundary in question. Fourth, the boundary (and in fact science itself) displays a characteristic structure pertaining to what are by now usually called «non wellfounded sets» -- sets, that is, which are somehow or other involved in themselves, whether as members, or as members of members or so on; the significance of the last thesis is that the best way of approaching philosophy of science is not standard set theory, but theories allowing non wellfounded sets are preferable. Fifth, and last, admission of the boundary's existence compels us to go beyond standard classical logic and to look for a more suitable logic, as for instance some kind of fuzzy paraconsistent logic. (shrink)

We solve a longstanding question of Soare by showing that if ${\mathbf d}$ is a non-low $_2$ computably enumerable degree then ${\mathbf d}$ contains a c.e. set with no r-maximal c.e. superset.

The rationalization of a choice function, in terms of assumptions that involve expansion or contraction properties of the feasible set, over non-finite sets is analyzed. Schwartz's results, stated in the finite case, are extended to this more general framework. Moreover, a characterization result when continuity conditions are imposed on the choice function, as well as on the binary relation that rationalizes it, is presented.

Let be a countable first‐order language and be an ‐structure. “Definable set” means a subset of M which is ‐definable in with parameters. A set is said to be immune if it is infinite and does not contain any infinite definable subset. X is said to be partially immune if for some definable A, is immune. X is said to be totally non‐immune if for every definable A, and are not immune. Clearly every definable set is totally non‐immune. Here we (...) ask whether the converse is true and prove that it is false for every countable structure whose class of definable sets satisfies a mild condition. We investigate further the possibility of an alternative construction of totally non‐immune non‐definable sets with the help of a subclass of immune sets, the class of cohesive sets, as well as with the help of a generalization of definable sets, the semi‐definable ones (the latter being naturally defined in models of arithmetic). Finally connections are found between totally non‐immune sets and generic classes in nonstandard models of arithmetic. (shrink)

This is a review of Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena, written by Jon Barwise and Lawrence Moss and published by CSLI Publications in 1996.

We prove that there is a structure, indeed a linear ordering, whose degree spectrum is the set of all non-hyperarithmetic degrees. We also show that degree spectra can distinguish measure from category.

To examine the ethical issues involved in governmental decisions with potential health risks, we review the history of the decision to raise the interurban speed limit in Israel in light of its impact on road death and injury. In 1993, the Israeli Ministry of Transportation initiated an “experiment” to raise the interurban speed limit from 90 to 100 kph. The “experiment” did not include a protocol and did not specify cut-off points for early termination in the case of adverse results. (...) After the raise in the speed limit, the death toll on interurban roads rose as a result of a sudden increase in speeds and case fatality rates. The committee's decision is a case study in unfettered human experimentation and public health risks when the setting is non-medical and lacks a defined ethical framework. The case study states the case for extending Helsinki type safeguards to experimentation in non-medical settings. (shrink)

The study was conducted to unveil social connectedness of the older adults in non-urban societies in Ghana, and the ecological and social inclusion theories underpinned the study. The descriptive cross-sectional survey was undertaken based on the positivist school of thought. Older adults who were 60 years or more, participated in the study. Older Adults’ Social Connectedness Questionnaire was designed to gather data to answer the research questions and test the hypothesis. Frequency counts and percentages, mean and standard deviation and independent (...) samples t-test were the analytical tools employed for the data analysis. The study unveiled, inter alia, that the older adults tend to enjoy moderate level of social connectedness and the major groups of people they frequently socially interact with are relatives, religious group members, neighbours and friends. The study also unveiled that religious activities, phone calls, cultural and social activities are the principal conduits for the older adults’ social interaction with significant others. Finally, the study establ ished a difference in the level of social connectedness of the male and female older adults. It is reckoned that the older adults in the rural settings need more and intensive social interactions to serve as impetus for longevity. (shrink)

Conditionals are basic for human reasoning. In our paper, we present two experiments, which for the first time systematically compare how people reason about indicative conditionals (Experiment 1) and counterfactual conditionals (Experiment 2) in causal and non-causal task settings (N = 80). The main result of both experiments is that conditional probability is the dominant response pattern and thus a key ingredient for modeling causal, indicative, and counterfactual conditionals. In the paper, we will give an overview of the main experimental (...) results and discuss their relevance for understanding how people reason about conditionals. (shrink)

*These notes were folded into the published paper "Probability and nonclassical logic*. Revising semantics and logic has consequences for the theory of mind. Standard formal treatments of rational belief and desire make classical assumptions. If we are to challenge the presuppositions, we indicate what is kind of theory is going to take their place. Consider probability theory interpreted as an account of ideal partial belief. But if some propositions are neither true nor false, or are half true, or whatever—then it’s (...) far from clear that our degrees of belief in it and its negation should sum to 1, as classical probability theory requires (?, cf.). There are extant proposals in the literature for generalizing (categorical) probability theory to a non-classical setting, and we will use these below. But subjective probabilities themselves stand in functional relations to other mental states, and we need to trace the knock-on consequences of revisionism for this interrelationship (arguably, degrees of belief only count as kinds of belief in virtue of standing in these functional relationships). (shrink)

The paper is dedicated to the 80th birthday of the outstanding Russian logician A.V. Kuznetsov. It is addressing a history of the ideas and research conducted by him in non-classical and intermediate logics.