This chapter focuses on alternative logics. It discusses a hierarchy of logical reform. It presents case studies that illustrate particular aspects of the logical revisionism discussed in the chapter. The first case study is of intuitionistic logic. The second case study turns to quantum logic, a system proposed on empirical grounds as a resolution of the antinomies of quantum mechanics. The third case study is concerned with systems of relevance logic, which have been the subject of an especially detailed reform (...) program. Finally, the fourth case study is paraconsistent logic, perhaps the most controversial of serious proposals. (shrink)

This paper gives a propositional reformulation of the fixed-point problem posed by Gupta and Belnap, using the stipulation logic of Visser. After presenting a solution for clones of three-valued operators that include the constant functions, I determine the maximal three-valued clones with constants that have the fixed-point property, giving different characterizations of them.

É comumente aceito, atualmente, que Aristóteles não teria enfrentado ou tentado seriamente resolver o famoso paradoxo do mentiroso, embora ele tenha sido formulado por Eubúlides de Mileto, membro da escola megárica e rival filosófico de Aristóteles. No máximo, assim reza a visão tradicional, ele parece apenas fazer uma menção desse paradoxo nas Refutações sofísticas, Capítulo 25, talvez esboçando a sua solução. O meu intento, no presente artigo, é desafiar essa opinião geral mostrando que o Estagirita fornece uma explicação implícita para (...) duas versões do paradoxo do mentiroso, a saber, a versão autorreferencial (que pode ser apresentada pela declaração: “esta declaração é falsa”), e a versão anafórica (que pode ser apresentada por meio de duas declarações mutuamente referentes como estas: “a próxima declaração é verdadeira” e “a declaração anterior é falsa”). A minha alegação é que a solução aristotélica para essas duas versões do paradoxo encontra-se no núcleo de sua refutação de duas teses, as quais denominei como tese da synalethia (que defende que toda declaração é verdadeira) e como tese da sympseudia (que defende que toda declaração é falsa). Tal refutação é realizada no oitavo capítulo do quarto Livro da Metafísica, um texto até agora subestimado pelos intérpretes modernos, mesmo sendo a parte final de um dos mais importantes escritos de Aristóteles. A solução aristotélica, assim defendo, é levada a cabo por meio dos seguintes princípios: (i) toda declaração é sempre precedida por um operador de verdade da forma ‘é verdade que...’, ou seja, toda declaração, qualquer que seja o que ela possa declarar a mais, primariamente assevera a sua própria verdade; e, em conformidade com o princípio anterior, (ii) toda declaração que assevera a sua própria falsidade ou acarreta a verdade de sua contraditória é necessariamente falsa. Através desses princípios, a refutação de Aristóteles da synalethia e da sympseudia é bem-sucedida. Mostrarei que obtemos uma boa solução para as versões do mentiroso acima mencionadas (e implicitamente presentes nas posições refutadas), apenas aplicando esses mesmos princípios a elas. Esse tipo de solução ao mentiroso tanto quanto para as teses antes citadas é muito parecido com aquele explicitamente encontrado nas obras de diversos filósofos, a saber, Guilherme de Sherwood, Tomás Bradwardine, João Buridano, Alberto da Saxônia, Paulo Venetus, Charles S. Peirce e Arthur Prior. Assim, também defendo que essa linhagem tem as suas raízes na solução de Aristóteles. (shrink)

We identify a class of paradoxes that is neither set-theoretical nor semantical, but that seems to depend on intensionality. In particular, these paradoxes arise out of plausible properties of propositional attitudes and their objects. We try to explain why logicians have neglected these paradoxes, and to show that, like the Russell Paradox and the direct discourse Liar Paradox, these intensional paradoxes are recalcitrant and challenge logical analysis. Indeed, when we take these paradoxes seriously, we may need to rethink the commonly (...) accepted methods for dealing with the logical paradoxes. (shrink)

We introduce a variant of pointer structures with denotational semantics and show its equivalence to systems of boolean equations: both have the same solutions. Taking paradoxes to be statements represented by systems of equations (or pointer structures) having no solutions, we thus obtain two alternative means of deciding paradoxical character of statements, one of which is the standard theory of solving boolean equations. To analyze more adequately statements involving semantic predicates, we extend propositional logic with the assertion operator and give (...) its complete axiomatization. This logic is a sub-logic of statements in which the semantic predicates become internalized (for instance, counterparts of Tarski’s definitions and T-schemata become tautologies). Examples of analysis of self-referential paradoxes are given and the approach is compared to the alternative ones. (shrink)

Frege’s writings contain arguments for the thesis (i) that a thought expressed by a sentence S is a structured object whose composition pictures the composition of S, and for the thesis (ii) that a thought is an unstructured object. I will argue that Frege’s reasons for both (i) and (ii) are strong. Frege’s explanation of the difference in sense between logically equivalent sentences rests on assumption (i), while Frege’s claim that the same thought can be decomposed differently makes (ii) plausible. (...) Thoughts are supposed to do work that requires that they be structured and work that requires that they be unstructured. But this cannot be! While the standard response to this problem is to reject either (i) or (ii), I propose a charitable repair in the spirit of Frege’s theory that accepts both. The key idea can be found in Frege’s Basic Laws of Arithmetic(BL, GGA). Frege argues that the thought expressed by a sentence is determined by the truth-conditions that can be derived from the semantic axioms for the sentence constituents. The fact that the same axiomatic truth-condition can be derived in different ways from different semantic axioms suggests a Fregean solution of the dilemma: A thought is a type that is instantiated by all sequences of senses (decomposed thoughts) that have the same axiomatic truth-conditions. This allows for multiple decomposability of the same thought (for different decomposed thoughts can have the same axiomatic truth-conditions) and for a notion of containment (the decomposed thought contains those senses whose semantic axioms are needed in the derivation of the truth-conditions). My proposal combines the virtues of (i) and (ii) without inheriting their vices. (shrink)

According to the deflationary theory of truth, to assert that a statement is true is just to assert the statement itself. For example, to say that ‘snow is white’ is true, or that it is true that snow is white, is equivalent to saying simply that snow is white, and this, according to the deflationary theory, is all that can be said significantly about the truth of ‘snow is white’.

Three recent books have argued that Keynes’s philosophy, like Wittgenstein’s, underwent a radical foundational shift. It is argued that Keynes, like Wittgenstein, moved from an atomic Cartesian individualism to a more conventionalist, intersubjective philosophy. It is sometimes argued this was caused by Wittgenstein’s concurrent conversion. Further, it is argued that recognising this shift is important for understanding Keynes’s later economics. In this paper I argue that the evidence adduced for these theses is insubstantial, and other available evidence contradicts their claims.

The purpose of this note is to present a strong form of the liar paradox. It is strong because the logical resources needed to generate the paradox are weak, in each of two senses. First, few expressive resources required: conjunction, negation, and identity. In particular, this form of the liar does not need to make any use of the conditional. Second, few inferential resources are required. These are: (i) conjunction introduction; (ii) substitution of identicals; and (iii) the inference: From ¬(p (...) ∧ p), infer ¬ p. It is, interestingly enough, also essential to the argument that the ‘strong’ form of the diagonal lemma be used: the one that delivers a term λ such that we can prove: λ = ¬ T(⌈λ⌉); rather than just a sentence Λ for which we can prove: Λ ≡ ¬T(⌈Λ⌉). The truth-theoretic principles used to generate the paradox are these: ¬(S ∧ T(⌈¬S⌉); and ¬(¬S ∧ ¬T(⌈¬S⌉). These are classically equivalent to the two directions of the T-scheme, but they are intuitively weaker. The lesson I would like to draw is: There can be no consistent solution to the Liar paradox that does not involve abandoning truth-theoretic principles that should be every bit as dear to our hearts as the T-scheme. So we shall have to learn to live with the Liar, one way or another. (shrink)

We argue that it would seem to be a mistake to blame Liar-like paradox on certain features of the object language, since the effect can be created with very minimal object languages that contain none of the usual suspects (truth-like predicates, reference to their own truth-bearers, negation, etc.).

We sketch an account according to which the semantic concepts themselves are not pathological and the pathologies that attend the semantic predicates arise because of the intention to impose on them a role they cannot fulfill, that of expressing semantic concepts for a language that includes them. We provide a simplified model of the account and argue in its light that (i) a consequence is that our meaning intentions are unsuccessful, and such semantic predicates fail to express any concept, and (...) that (ii) in light of this it is incorrect to characterize the pathology simply as semantic inconsistency; a more nuanced view of the problem is needed. We also show that the defects of the semantic predicates need not undercut the use of a truth theory in a compositional semantics for a language containing them because the meaning theory per se need not involve commitment to the axioms of the truth theory it exploits. (shrink)

A view often expressed is that to classify the liar sentence as neither true nor false is satisfactory for the simple liar but not for the strengthened liar. I argue that in fact it is equally unsatisfactory for both liars. I go on to discuss whether, nevertheless, Kripke''s theory of truth represents an advance on that of Tarski.

Although the notion of common or mutual belief plays a crucial role in game theory, economics and social philosophy, no thoroughly representational account of it has yet been developed. In this paper, I propose two desiderata for such an account, namely, that it take into account the possibility of inconsistent data without portraying the human mind as logically and mathematically omniscient. I then propose a definition of mutual belief which meets these criteria. This account takes seriously the existence of computational (...) limitations. Finally, I point out that the epistemic logic (or theory) needed to make the definition work is subject to the Kaplan/Montague Paradox of the Knower. I argue that this is not a defect of the account, and I discuss briefly the bearing of recent work on the paradox of the Liar upon this problem. (shrink)

The general notions of object- and metalanguage are discussed and as a special case of this relation an arbitrary first order language with an infinite model is expanded by a predicate symbol T0 which is interpreted as truth predicate for . Then the expanded language is again augmented by a new truth predicate T1 for the whole language plus T0. This process is iterated into the transfinite to obtain the Tarskian hierarchy of languages. It is shown that there are natural (...) points for stopping this process. The sets which become definable in suitable hierarchies are investigated, so that the relevance of the Tarskian hierarchy to some subjects of philosophy of mathematics are clarified. (shrink)

About twenty-five years ago, Charles Parsons published a paper that began by asking why we still discuss the Liar Paradox. Today, the question seems all the more apt. In the ensuing years we have seen not only Parsons’ work (1974), but seminal work of Saul Kripke (1975), and a huge number of other important papers. Too many to list. Surely, one of them must have solved it! In a way, most of them have. Most papers on the Liar Paradox offer (...) some explanation of the behavior of paradoxical sentences, and most also offer some extension for the predicate ‘true’ that they think is adequate, at least in some restricted setting. But if this is a solution, then the problem we face is far from a lack of solutions; rather, we have an overabundance of conflicting ones. Kripke’s work alone provides us with uncountably many different extensions for the truth predicate. Even if it so happens that one of these is a conclusive solution, we do not seem to know which one, or why. We should also ask, given that we are faced with many technically elegant but contradictory views, if they are really all addressing the same problem. What we lack is not solutions, but a way to compare and evaluate the many ones we have. (shrink)

Tim Maudlin’s Truth and Paradox is terrific. In some sense its solution to the paradoxes is familiar—the book advocates an extension of what’s called the Kripke-Feferman theory (although the definition of validity it employs disguises this fact). Nonetheless, the perspective it casts on that solution is completely novel, and Maudlin uses this perspective to try to make the prima facie unattractive features of this solution seem palatable, indeed inescapable. Moreover, the book deals with many important issues that most writers on (...) the paradoxes never deal with, including issues about the application of the Gödel theorems to powerful theories that include our theory of truth. The book includes intriguing excursions into general metaphysics, e.g. on the nature of logic, facts, vagueness, and much more; and it’s lucid and lively, a pleasure to read. It will interest a wide range of philosophers. (shrink)

On the basis of elementary thinking about language functioning, a solution of truth paradoxes is given and a corresponding semantics of a truth predicate is founded. It is shown that it is precisely the two-valued description of the maximal intrinsic fixed point of the strong Kleene three-valued semantics.

Many topics have not been covered, in most cases because I don't know quite what to say about them. Would it be possible to add a decidability predicate to the language? What about stronger connectives, like exclusion negation or Lukasiewicz implication? Would an expanded language do better at expressing its own semantics? Would it contain new and more terrible paradoxes? Can the account be supplemented with a workable notion of inherent truth (see note 36)? In what sense does stage semantics (...) lie “between” fixed point and stability semantics? In what sense, exactly, are our semantical rules inconsistent? In what sense, if any, does their inconsistency resolve the problem of the paradoxes?The ideals of strength, grounding, and closure together define an intuitively appealing conception of truth. Nothing would be gained by insisting that it was the intuitive conception of truth, and in fact recent developments make me wonder whether such a thing exists. However that may be, until the alternatives are better understood it would be foolish to attempt to decide between them. Truth gives up her secrets slowly and grudgingly, and loves to confound our presumptions. (shrink)

Of the dozens of purported solutions to the liar paradox published in the past fifty years, the vast majority are "traditional" in the sense that they reject one of the premises or inference rules that are used to derive the paradoxical conclusion. Over the years, however, several philosophers have developed an alternative to the traditional approaches; according to them, our very competence with the concept of truth leads us to accept that the reasoning used to derive the paradox is sound. (...) That is, our conceptual competence leads us into inconsistency. I call this alternative the inconsistency approach to the liar. Although this approach has many positive features, I argue that several of the well-developed versions of it that have appeared recently are unacceptable. In particular, they do not recognize that if truth is an inconsistent concept, then we should replace it with new concepts that do the work of truth without giving rise to paradoxes. I outline an inconsistency approach to the liar paradox that satisfies this condition. (shrink)

I here investigate the sense in which diagonalization allows one to construct sentences that are self-referential. Truly self-referential sentences cannot be constructed in the standard language of arithmetic: There is a simple theory of truth that is intuitively inconsistent but is consistent with Peano arithmetic, as standardly formulated. True self-reference is possible only if we expand the language to include function-symbols for all primitive recursive functions. This language is therefore the natural setting for investigations of self-reference.

My task here is the first one. I do present a consistent formal system and claim that it provides a perfect model of natural languages such as English, but this system involves no surprises. It is none other than the standard framework of classical logic and model theory. The real weight of the argument lies in the claim that the classical framework—without alteration or addition—contains the resources to model what happens when we say in English ‘This sentence is not true’.

This paper canvasses the various dimensions along which theories of truth may disagree about the extent to which truth is minimal.

The paper shows how ideas that explain the sense of an expression as a method or algorithm for finding its reference, preshadowed in Frege’s dictum that sense is the way in which a referent is given, can be formalized on the basis of the ideas in Thomason (1980). To this end, the function that sends propositions to truth values or sets of possible worlds in Thomason (1980) must be replaced by a relation and the meaning postulates governing the behaviour of (...) this relation must be given in the form of a logic program. The resulting system does not only throw light on the properties of sense and their relation to computation, but also shows circular behaviour if some ingredients of the Liar Paradox are added. The connection is natural, as algorithms can be inherently circular and the Liar is explained as expressing one of those. Many ideas in the present paper are closely related to those in Moschovakis (1994), but receive a considerably lighter formalization. (shrink)

In this article, we study the prehistory of type theory up to 1910 and its development between Russell and Whitehead's Principia Mathematica ([71], 1910-1912) and Church's simply typed λ-calculus of 1940. We first argue that the concept of types has always been present in mathematics, though nobody was incorporating them explicitly as such, before the end of the 19th century. Then we proceed by describing how the logical paradoxes entered the formal systems of Frege, Cantor and Peano concentrating on Frege's (...) Grundgesetze der Arithmetik for which Russell applied his famous paradox and this led him to introduce the first theory of types, the Ramified Type Theory (RTT). We present RTT formally using the modern notation for type theory and we discuss how Ramsey, Hilbert and Ackermann removed the orders from RTT leading to the simple theory of types STT. We present STT and Church's own simply typed λ-calculus (λ → C) and we finish by comparing RTT, STT and λ → C. (shrink)

In Russell''s Ramified Theory of Types RTT, two hierarchical concepts dominate:orders and types. The use of orders has as a consequencethat the logic part of RTT is predicative.The concept of order however, is almost deadsince Ramsey eliminated it from RTT. This is whywe find Church''s simple theory of types (which uses the type concept without the order one) at the bottom of the Barendregt Cube rather than RTT. Despite the disappearance of orders which have a strong correlation with predicativity, predicative (...) logic still plays an influential role in Computer Science.An important example is the proof checker Nuprl, which is basedon Martin-Löf''s Type Theory which uses type universes. Those type universes,and also degrees of expressions in AUTOMATH, are closely related toorders. In this paper, we show that orders have not disappeared from modern logic and computer science, rather, orders play a crucial role in understanding the hierarchy of modern systems. In order to achieve our goal, we concentrate on a subsystem of Nuprl.The novelty of our paper lies in: (1) a modest revival of Russell's orders, (2) the placing of the historical system RTT underlying the famous Principia Mathematica in a context with a modern system of computer mathematics (Nuprl) and modern type theories (Martin-Löf''s type theory and PTSs), and (3) the presentation of acomplex type system (Nuprl) as a simple and compact PTS. (shrink)

A Husserlian phenomenological approach to logic treats concepts in terms of their experiential meaning rather than in terms of reference, sets of individuals, and sentences. The present article applies such an approach in turn to the reasoning operative in various paradoxes: the simple Liar, the complex Liar paradoxes, the Grelling-type paradoxes, and Gödel’s Theorem. It finds that in each case a meaningless statement, one generated by circular definition, is treated as if were meaningful, and consequently as either true or false, (...) although in fact it is neither. The situation is further complicated by the fact that the sentence used to express the meaningless statement is ambiguous, and may also be used to express a meaningful statement. The paradoxes result from a failure to distinguish between the two meanings the sentence may have. (shrink)

I survey some important semantical and axiomatic theories of self-referential truth. Kripke's fixed-point theory, the revision theory of truth and appraoches involving fuzzy logic are the main examples of semantical theories. I look at axiomatic theories devised by Cantini, Feferman, Freidman and Sheard. Finally some applications of the theory of self-referential truth are considered.

A common objection to hierarchical approaches to truth is that they fragment the concept of truth. This paper defends hierarchical approaches in general against the objection of fragmentation. It argues that the fragmentation required is familiar and unprob-lematic, via a comparison with mathematical proof. Furthermore, it offers an explanation of the source and nature of the fragmentation of truth. Fragmentation arises because the concept exhibits a kind of failure of closure under reflection. This paper offers a more precise characterization of (...) the reflection involved, first in the setting of formal theories of truth, and then in a more general setting. (shrink)

It is well known that the following features hold of AR + T under the strong Kleene scheme, regardless of the way the language is Gödel numbered: 1. There exist sentences that are neither paradoxical nor grounded. 2. There are 2ℵ0 fixed points. 3. In the minimal fixed point the weakly definable sets (i.e., sets definable as {n∣ A(n) is true in the minimal fixed point where A(x) is a formula of AR + T) are precisely the Π1 1 sets. (...) 4. In the minimal fixed point the totally defined sets (sets weakly defined by formulae all of whose instances are true or false) are precisely the ▵1 1 sets. 5. The closure ordinal for Kripke's construction of the minimal fixed point is ωCK 1. In contrast, we show that under the weak Kleene scheme, depending on the way the Gödel numbering is chosen: 1. There may or may not exist nonparadoxical, ungrounded sentences. 2. The number of fixed points may be any positive finite number, ℵ0, or 2ℵ0 . 3. In the minimal fixed point, the sets that are weakly definable may range from a subclass of the sets 1-1 reducible to the truth set of AR to the Π1 1 sets, including intermediate cases. 4. Similarly, the totally definable sets in the minimal fixed point range from precisely the arithmetical sets up to precisely the ▵1 1 sets. 5. The closure ordinal for the construction of the minimal fixed point may be ω, ωCK 1, or any successor limit ordinal in between. In addition we suggest how one may supplement AR + T with a function symbol interpreted by a certain primitive recursive function so that, irrespective of the choice of the Godel numbering, the resulting language based on the weak Kleene scheme has the five features noted above for the strong Kleene language. (shrink)

In a lengthy review article, C. Anthony Anderson criticizes the approach to property theory developed in Quality and Concept (1982). That approach is first-order, type-free, and broadly Russellian. Anderson favors Alonzo Church’s higher-order, type-theoretic, broadly Fregean approach. His worries concern the way in which the theory of intensional entities is developed. It is shown that the worries can be handled within the approach developed in the book but they remain serious obstacles for the Church approach. The discussion focuses on: (1) (...) the fine-grained/coarse-grained distinction, (2) proper names and definite descriptions, (3) the paradox of analysis and Mates’ puzzle, and (4) the logical, semantical, and intentional paradoxes. (shrink)

Philosophical work on truth covers two streams of inquiry, one concerning the nature (if any) of truth, the other concerning truth-related paradox, especially the Liar. For the most part these streams have proceeded fairly independently of each other. In his "Deflationary Truth and the Liar" (JPL 28:455-488, 1999) Keith Simmons argues that the two streams bear on one another in an important way; specifically, the Liar poses a greater problem for deflationary conceptions of truth than it does for inflationist conceptions. (...) We agree with Simmons on this point; however, we disagree with his main conclusion. In a nutshell, Simmons' main conclusion is that deflationists can solve the Liar only by compromising deflationism. If Simmons is right, then deflationists cannot solve the Liar paradox. In this paper we argue that, pace Simmons, there is an approach to the Liar that is available to deflationists, namely dialetheism. (shrink)

We begin with a brief explanation of our proof-theoretic criterion of paradoxicality—its motivation, its methods, and its results so far. It is a proof-theoretic account of paradoxicality that can be given in addition to, or alongside, the more familiar semantic account of Kripke. It is a question for further research whether the two accounts agree in general on what is to count as a paradox. It is also a question for further research whether and, if so, how the so-called Ekman (...) problem bears on the investigations here of the intensional paradoxes. Possible exceptions to the proof-theoretic criterion are Prior’s Theorem and Russell’s Paradox of Propositions—the two best-known ‘intensional’ paradoxes. We have not yet addressed them. We do so here. The results are encouraging. §1 studies Prior’s Theorem. In the literature on the paradoxes of intensionality, it does not enjoy rigorous formal proof of a Gentzenian kind—the kind that lends itself to proof-theoretic analysis of recondite features that might escape the attention of logicians using non-Gentzenian systems of logic. We make good that lack, both to render the criterion applicable to the formal proof, and to see whether the criterion gets it right. Prior’s Theorem is a theorem in an unfree, classical, quantified propositional logic. But if one were to insist that the logic employed be free, then Prior’s Theorem would not be a theorem at all. Its proof would have an undischarged assumption—the ‘existential presupposition’ that the proposition $$\forall p(Qp\!\rightarrow \!\lnot p)$$ ∀ p ( Q p → ¬ p ) exists. Call this proposition $$\vartheta $$ ϑ. §2 focuses on $$\vartheta $$ ϑ. We analyse a Priorean reductio of $$\vartheta $$ ϑ along with the possibilitate $$\Diamond \forall q(Qq\!\leftrightarrow \!(\vartheta \!\leftrightarrow \! q))$$ ◊ ∀ q ( Q q ↔ ( ϑ ↔ q ) ). The attempted reductio of this premise-pair, which is constructive, cannot be brought into normal form. The criterion says we have not straightforward inconsistency, but rather genuine paradoxicality. §3 turns to problems engendered by the proposition $$\exists p(Qp\wedge \lnot p)$$ ∃ p ( Q p ∧ ¬ p ) (call it $$\eta $$ η ) for the similar possibilitate $$\Diamond \forall q(Qq\!\leftrightarrow \!(\eta \!\leftrightarrow \! q))$$ ◊ ∀ q ( Q q ↔ ( η ↔ q ) ). The attempted disproof of this premise-pair—again, a constructive one—cannot succeed. It cannot be brought into normal form. The criterion says the premise-pair is a genuine paradox. In §4 we show how Russell’s Paradox of Propositions, like the Priorean intensional paradoxes, is to be classified as a genuine paradox by the proof-theoretic criterion of paradoxicality. (shrink)

I propose an approach to liar and Curry paradoxes inspired by the work of Roger Swyneshed in his treatise on insolubles (1330-1335). The keystone of the account is the idea that liar sentences and their ilk are false (and only false) and that the so-called ''capture'' direction of the T-schema should be restricted. The proposed account retains what I take to be the attractive features of Swyneshed's approach without leading to some worrying consequences Swyneshed accepts. The approach and the resulting (...) logic (called ''Swynish Logic'') are non-classical, but are consistent and compatible with many elements of the classical picture including modus ponens, modus tollens, and double-negation elimination and introduction. It is also compatible with bivalence and contravalence. My approach to these paradoxes is also immune to an important kind of revenge challenge that plagues some of its rivals. (shrink)

Let serious propositional contingentism (SPC) be the package of views which consists in (i) the thesis that propositions expressed by sentences featuring terms depend, for their existence, on the existence of the referents of those terms, (ii) serious actualism—the view that it is impossible for an object to exemplify a property and not exist—and (iii) contingentism—the view that it is at least possible that some thing might not have been something. SPC is popular and compelling. But what should we say (...) about possible worlds, if we accept SPC? Here, I first show that a natural view of possible worlds, well-represented in the literature, in conjunction with SPC is inadequate. Though I note various alternative ways of thinking about possible worlds in response to the first problem, I then outline a second more general problem—a master argument—which generally shows that any account of possible worlds meeting very minimal requirements will be inconsistent with compelling claims about mere possibilia which the serious propositional contingentist should accept. (shrink)

Non-well-founded set theories allow set-theoretic exotica that standard ZFC will not allow, such as a set that has itself as its sole member. We can distinguish plenitudinous non-well-founded set theories, such as Boffa set theory, that allow infinitely many such sets, from restrictive theories, such as Finsler-Aczel or AFA, that allow exactly one. Plenitudinous non-well-founded set theories face a puzzle: nothing seems to explain the identity or distinctness of various of the sets they countenance. In this paper I aim to (...) sharpen this puzzle, make clear who it does and does not apply to and, ultimately, to argue in favor of a plenitudinous theory like Boffa. (shrink)