What makes necessary truths true? I argue that all truth supervenes on how things are, and that necessary truths are no exception. What makes them true are proofs. But if so, the notion of proof needs to be generalized to include verification-transcendent proofs, proofs whose correctness exceeds our ability to verify it. It is incumbent on me, therefore, to show that arguments, such as Dummett's, that verification- truth is not compatible with the theory of meaning, are mistaken. The answer is (...) that what we can conceive and construct far outstrips our actual abilities. I conclude by proposing a proof-theoretic account of modality, rejecting a claim of Armstrong's that modality can reside in non-modal truthmakers. (shrink)

In this paper, I will defend a new compositional semantics for single-domain free logic. This semantics makes use of a distinction between the semantic value of a singular term and its semantic referent. The semantic value of a singular term is conceived of as a set that either contains the semantic referent or no element at all. The semantic referent is the object that the term designates. Before I will introduce this new semantics for single-domain predicate and an S5-type modal (...) logic in detail, I will present five related problems of compositionality of the standard semantics for these logical systems. After that I will show in detail how my new proposed alternative semantics can be used to solve nearly all of the outlined five problems. (shrink)

In this paper, I will show that typical formal semantic reconstructions of the rigidity of proper names neglect the important aspect that the rigidity of names is determined by our ordinary use of a name relative to the actual world. This fact was clearly pointed out by Kripke, but overlooked by the subsequent discussion concerning this topic. Based on this diagnosis, I will distinguish three different actualized notions of rigidity. Firstly, I will introduce two different new varieties of known versions (...) of rigidity; namely, actualized persistent and actualized obstinate rigidity. Secondly, I will make use of the tools provided by free logic and introduce a new and overlooked version of rigidity, which I will call actually restricted rigidity. Against this background, I will argue that we have different options to formally model the rigidity of proper names in natural languages. Which option we choose, mainly depends on our philosophical background assumptions. For someone who believes in non-existent objects and the possibility of naming such objects, it is the best choice to hold that proper names are actually obstinately rigid designators. For someone who rejects non-existent objects and the possibility of naming such objects, actually restricted rigidity is a better choice than actualized persistent rigidity. (shrink)

In this paper I aim to defend a version of the view that ‘exist’ expresses primarily a property of individual objects, a property that each of them has. In the first section, I will distinguish the three main types of rival conceptions concerning the semantic status of ‘exist’ that will define the subsequent discussion. In the second section it will be shown that the best explanation of our overall use of ‘exist’ in natural language requires the treatment of ‘exist’ as (...) a predicate that can be applied to individual objects. The third section will be concerned with the problem of the semantic analysis of negative singular existential sentences that contain proper names. I will briefly defend a specific solution to this problem that makes use of a single-domain free logic. In the following sections, I will try to defend this view of existence in more detail. That is, I will deal with three different specific challenges that prima facie seem to speak against the proposed view and for some rival alternatives; and I will show how these challenges can be met. (shrink)

A crucial question here is what, exactly, the conditional in the naive truth/set comprehension principles is. In 'Logic of Paradox', I outlined two options. One is to take it to be the material conditional of the extensional paraconsistent logic LP. Call this "Strategy 1". LP is a relatively weak logic, however. In particular, the material conditional does not detach. The other strategy is to take it to be some detachable conditional. Call this "Strategy 2". The aim of the present essay (...) is to investigate Stragey 1. It is not to advocate it. The work is simply an extended exploration of the strategy, its strengths, its weaknesses, and the various dierent ways in which it may be implemented. In the first part of the paper I will set up the appropriate background details. In the second, I will look at the strategy as it applies to the semantic paradoxes. In the third I will look at how it applies to the set-theoretic paradoxes. (shrink)

This paper addresses the question of what is distinctive about classical mathematics. The answer given is that it depends on a certain notion of conditionality, which is best understood as telling us something about the structure of the mathematics in question, and not something about the logical particle ‘if’.

The article looks at the structure of impossible worlds, and their deployment in the analysis of some intentional notions. In particular, it is argued that one can, in fact, conceive anything, whether or not it is impossible. Thus a semantics of conceivability requires impossible worlds.

The paper describes a new way of thinking about conditionals, in terms of information transfer between worlds. This way of looking at things provides an answer to some of the standard problems concerning conditionals, and undercuts the claim that indicative and subjunctive conditionals are distinct.

In 1928 Ivan Orlov published a remarkable paper which contains the first formulation of a relevant logic. The paper remained largely unknown to English-speakers until this discovery of relevant log...

Towards NonBeing (Priest, 2005) gives a noneist account of the semantics of intentional operators and predicates. The semantics for intentional operators are modelled on those for the , is given and assessed.

Many people hold that there is a distinctive notion of metaphysical necessity. In this paper I explain why I am skeptical about the view. I examine the sorts of considerations that are adduced for it, and argue that they meet equal and opposite considerations.

1.1 In standard modal logics, the worlds are 2-valued in the following sense: there are 2 values that a sentence may take at a world. Technically, however, there is no reason why this has to be the case. The worlds could be many-valued. This paper presents one simple approach to a major family of many-valued modal logics, together with an illustration of why this family is philosophically interesting.

This note is an analysis of the paradox given by Myers. It is shown, assuming that the resources available in paraconsistent logic may be applied, how the conclusion of the paradox may be perfectly acceptable, but that the argument is, nonetheless, invalid. This provides a dialethic solution to the paradox.

There is at present a certain dispute about counterfactuals taking place. What is at issue is whether counterfactuals with necessarily false antecedents are all true. Some hold that such counterfactuals are vacuously true, appearances notwithstanding. Let us call such people vacuists. Others hold that some counterfactuals with necessarily false antecedents are true; some are false: it just depends on their contents. Let us call such people non-vacuists. As a notable representative of the vacuists, I will take Tim Williamson. On the (...) other side, I will take the position defended by Berto, French, Priest, and Ripley. I will argue (unsurprisingly) that the better choice is Non-Vacuism. That, however, is a subsidiary aim of this paper. The main point is to illustrate the method of theory-choice. (shrink)

Logic, in one of the many sense of that term, is a theory about what follows from what and why. Arguably, the correct theory has to be determined by abduction. Over recent years, so called logical anti-exceptionalists have investigated this matter. Current discussions have been restricted to deductive logic. However, there are also, of course, various forms of non-deductive reasoning. Indeed, abduction itself is one of these. What is to be said about the way of choosing the best theory of (...) non-deductive inferences? It would seem clear that an anti-exceptionalist should hold that essentially the same method of choice should apply to non-deductive logic. A number of issues need to be faced in the process, not the least of which is the circularity involved in an abductive justification for a theory of abduction. This paper discusses matters. (shrink)

In 1948 Jaśkowski introduced the first discussive logic. The main technical idea was to take what holds to be what is true at some possible world. Some 2,000 years earlier, Jain philosophers had advocated a similar idea, in their doctrine of _syādvāda_. Of course, these philosophers had no knowledge of contemporary logical notions; but the techniques pioneered by Jaśkowski can be deployed to make the Jain ideas mathematically precise. Moreover, Jain ideas suggest a new family of many-valued discussive logics. In (...) this paper, I will explain all these matters. (shrink)

IntroductionCurry’s paradox is well known.See, e.g., Priest , ch. 6. It comes in both set theoretic and semantic versions. Here we will concentrate on the semantic versions. Historically, these have deployed the notion of truth. Those who wish to endorse an unrestricted T-schema have mainly endorsed a logic which rejects the principle of Absorption, \\models A\rightarrow B\). High profile logics of this kind are certain relevant logics; these have semantics which show how and why this principle is not valid. Of (...) more recent times, paradoxes which are clearly in the same family have been appearing; but these concern the notion of validity itself. The standard semantics of relevant logics seem powerless to address these. But they can. This note shows how. The upshot can be seen as a return to the roots of relevant logic, in a sense to become clear.BackgroundThe Usual Curry ParadoxesLet us start with a couple of standard forms of the paradox. I .. (shrink)

By a pure modal logic of names we mean a quantifier-free formulation of such a logic which includes not only traditional categorical, but also modal categorical sentences with modalities de re and which is an extension of Propositional Logic. For categorical sentences we use two interpretations: a “natural” one; and Johnson and Thomason’s interpretation, which is suitable for some reconstructions of Aristotelian modal syllogistic :271–284, 1989; Thomason in J Philos Logic 22:111–128, 1993 and J Philos Logic 26:129–141, 1997. In both (...) cases we use Johnson-like models. We also analyze different kinds of versions of PMLN, for both general and singular names. We present complete tableau systems for the different versions of PMLN. These systems enable us to present some decidability methods. It yields “strong decidability” in the following sense: for every inference starting with a finite set of premises we can specify a finite number of steps to check whether it is logically valid. This method gives the upper bound of the cardinality of models needed for the examination of the validity of a given inference. (shrink)

The main goal of this paper is to provide an abstract framework for constructing proof systems for various many-valued logics. Using the framework it is possible to generate strongly complete proof systems with respect to any finitely valued deterministic and non-deterministic logic. I provide a couple of examples of proof systems for well-known many-valued logics and prove the completeness of proof systems generated by the framework.

Free logics are a family of first-order logics which came about as a result of examining the existence assumptions of classical logic (Hintikka _The Journal of Philosophy_, _56_, 125–137 1959 ; Lambert _Notre Dame Journal of Formal Logic_, _8_, 133–144 1967, 1997, 2001 ). What those assumptions are varies, but the central ones are that (i) the domain of interpretation is not empty, (ii) every name denotes exactly one object in the domain and (iii) the quantifiers have existential import. Free (...) logics reject the claim that names need to denote in (ii). _Positive_ free logic concedes that some atomic formulas containing non-denoting names (including self-identity) are true, _negative_ free logic treats them as uniformly false, and _neutral_ free logic as taking a third value. There has been a renewed interest in analyzing proof theory of free logic in recent years, based on intuitionistic logic in Maffezioli and Orlandelli (_Bulletin of the Section of Logic_, _48_(2), 137–158 2019 ) as well as classical logic in Pavlović and Gratzl (_Journal of Philosophical Logic_, _50_, 117–148 2021 ), there for the positive and negative variants. While the latter streamlines the presentation of free logics and offers a more unified approach to the variants under consideration, it does not cover neutral free logic, since there is some lack of both clear formal intuitions on the semantic status of formulas with empty names, as well as a satisfying account of the conditional in this context. We discuss extending the results to this third major variant of free logics. We present a series of G3 sequent calculi adapted from Fjellstad (_Studia Logica_, _105_(1), 93–119 2017, _Journal of Applied Non-Classical Logics_, _30_(3), 272–289 2020 ), which possess all the desired structural properties of a good proof system, including admissibility of contraction and all versions of the cut rule. At the same time, we maintain the unified approach to free logics and moreover argue that greater clarity of intuitions is achieved once neutral free logic is conceptualized as consisting of two sub-varieties. (shrink)

ABSTRACTI offer a simple‐minded analysis of presupposition in which if a sentence has a presupposition, then both that sentence and its negation logically entail the presupposition; and in which sentence with failed presuppositions are neither true nor false. This account naturally generates an analysis of what it takes to disagree and what it takes to be at fault in a disagreement. A simple generalization gives rise to the possibility of disagreements in which no party is at fault, as is required (...) by leading theories on predicates of taste. (shrink)

Theories where truth is a naive concept fall under the following dilemma: either the theory is subject to Curry’s Paradox, which engenders triviality, or the theory is not trivial but the resulting conditional is too weak. In this paper we explore a number of theories which arguably do not fall under this dilemma. In these theories the conditional is characterized in terms of non-deterministic matrices. These non-deterministic theories are similar to infinitely-valued Łukasiewicz logic in that they are consistent and their (...) conditionals are quite strong. The difference is the following: while Łukasiewicz logic is \-inconsistent, the non-deterministic theories might turn out to be \-consistent. (shrink)

We formulate a Hilbert-style axiomatic system and a tableau calculus for the STIT-based logic of imagination recently proposed in Wansing. Completeness of the axiom system is shown by the method of canonical models; completeness of the tableau system is also shown by using standard methods.

Various four- and three-valued modal propositional logics are studied. The basic systems are modal extensions BK and BS4 of Belnap and Dunn's four-valued logic of firstdegree entailment. Three-valued extensions of BK and BS4 are considered as well. These logics are introduced semantically by means of relational models with two distinct evaluation relations, one for verification and the other for falsification. Axiom systems are defined and shown to be sound and complete with respect to the relational semantics and with respect to (...) twist structures over modal algebras. Sound and complete tableau calculi are presented as well. Moreover, a number of constructive non-modal logics with strong negation are faithfully embedded into BS4, into its three-valued extension B3S4, or into temporal BS4, BtS4. These logics include David Nelson's three-valued logic N3, the four-valued logic N4 bottom, the connexive logic C, and several extensions of bi-intuitionistic logic by strong negation. (shrink)

Earlier algebraic semantics for Belnapian modal logics were defined in terms of twist-structures over modal algebras. In this paper we introduce the class of BK -lattices, show that this class coincides with the abstract closure of the class of twist-structures, and it forms a variety. We prove that the lattice of subvarieties of the variety of BK -lattices is dually isomorphic to the lattice of extensions of Belnapian modal logic BK . Finally, we describe invariants determining a twist-structure over a (...) modal algebra. (shrink)

Despite the tendency to be otherwise, some non-classical logics are known to validate formulas that are invalid in classical logic. A subclass of such systems even possesses pairs of a formula and its negation as theorems, without becoming trivial. How should these provable contradictions be understood? The present paper aims to shed light on aspects of this phenomenon by taking as samples the constructive connexive logic C, which is obtained by a simple modification of a system of constructible falsity, namely (...) N4, as well as its non-constructive extension C3. For these systems, various observations concerning provable contradictions are made, using mainly a proof-theoretic approach. The topics covered in this paper include: how new contradictions are found from parts of provable contradictions; how to characterise provable contradictions in C3 that are constructive; how contradictions can be seen from the relative viewpoint of strong implication; and as an appendix an attempt at generating provable contradictions in C3. (shrink)

En este artículo discutimos la tesis de Jc Beall según la cual no hay negación lógica. Evaluamos la solidez del argumento con el que defiende su tesis y presentamos dos razones para rechazar una de sus premisas: que la negación tiene que ser excluyente o exhaustiva. La primera razón involucra una presentación alternativa de las reglas de la negación en sistemas de secuentes diferentes al que Beall presupone. La segunda razón establece que la negación no tiene que ser excluyente o (...) exhaustiva. (shrink)

The purpose of this paper is to explore the issue of how the validity of the parallel inference is possible in view of its deep semantic-syntactic structure. I fi...

Many mathematicians are platonists: they believe that the axioms of mathematics are true because they express the structure of a nonspatiotemporal, mind independent, realm. But platonism is plagued by a philosophical worry: it is unclear how we could have knowledge of an abstract, realm, unclear how nonspatiotemporal objects could causally affect our spatiotemporal cognitive faculties. Here I aim to make room in our metaphysical picture of the world for the causal relevance of abstracta.

When we forgive, we do so for reasons. One challenge for forgiveness theorists is to explain which reasons are reasons to forgive and which are not. This paper argues that we forgive in response to a perceived change of heart on the part of the offender. The argument proceeds in four steps. First, I show that we forgive for reasons. Second, I argue that forgiveness requires the right kind of reason. Third, I show that these two points explain a common (...) distinction between forgiving and letting go and, in doing so, solve a problem facing many accounts of forgiveness. Finally, I consider candidate reasons to forgive and argue that all of them are either the wrong kind of reason or are instances of a more general reason of the right kind, namely, a perceived change of heart. (shrink)

Graham Priest has argued that the fruits of classical set theory can be obtained by naive means through a puzzling piece of reasoning often known as the bootstrapping argument. I will demonstrate that the bootstrapping involved is best understood as viciously circular and thus, that these fruits remain forbidden. The argument has only one rehearsal in print and it is quite subtle. This paper provides reconstruction of the argument based on Priest and attempts some fixes and alternative construals to get (...) around some elementary problems. Despite these efforts, the argument remains unconvincing. (shrink)

This paper explores the idea that Descartes’ cogito is a kind of diagonal argument. Using tools from modal logic, it reviews some historical antecedents of this idea from Slezak and Boos and culminates in an orginal result classifying the exact structure of belief frames capable of supporting diagonal arguments and our reconstruction of the cogito.

This paper begins an analysis of the real line using an inconsistency-tolerant (paraconsistent) logic. We show that basic field and compactness properties hold, by way of novel proofs that make no use of consistency-reliant inferences; some techniques from constructive analysis are used instead. While no inconsistencies are found in the algebraic operations on the real number field, prospects for other non-trivializing contradictions are left open.

This paper distinguishes between two types of persuasive force arguments can have in terms of two different connections between arguments and inferences. First, borrowing from Pinto, an arguer's invitation to inference directly persuades an addressee if the addressee performs an inference that the arguer invites. This raises the question of how invited inferences are determined by an invitation to inference. Second, borrowing from Sorenson, an arguer's invitation to inference indirectly persuades an addressee if the addressee performs an inference guided by (...) the argument even though it is uninvited. This raises the question of how an invitation to inference can guide inferences that the arguer does not use the argument to invite. Focusing on belief-inducing inference, the primary aims here are to clarify what is necessary for an addressee's belief-inducing inference to be invited by an argument used as an instrument of persuasion; and to highlight the capacity of arguments to guide such inferences. The paper moves beyond Pinto's discussion by using Boghossian's Taking Condition in service of and in way that illustrates how epistemically bad arguments can rationally persuade addressees of their conclusions. (shrink)

Berkeley’s ‘master argument’ for idealism has been the subject of extensive criticism. Two of his strongest critics, A.N. Prior and J.L. Mackie, argue that due to various logical confusions on the part of Berkeley, the master argument fails to establish his idealist conclusion. Prior argues that Berkeley’s argument ‘proves too little’ in its conclusion, while Mackie contends that Berkeley confuses two different kinds of self-refutation in his argument. This paper proposes a defence of the master argument based on intuitionistic argument. (...) It begins by giving a brief exposition of the master argument and Prior's and Mackie's criticism. The following section explains why we might read the master argument along intuitionistic lines. The final section demonstrates that, according to intuitionistic logic, Berkeley's argument withstands the criticisms of Prior and Mackie. (shrink)

This paper sets out three programmes that attempt to use relevant logic as the basis for a philosophy of mathematics. Although these three programmes do not exhaust the possible approaches to mathematics through relevant logic, they are fairly representative of the current state of the field. The three programmes are compared and their relative strengths and weaknesses set out. At the end of the paper I examine the consequences of adopting each programme for the realist debate about mathematical objects.

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.

Motivated by weaknesses with traditional accounts of logical epistemology, considerable attention has been paid recently to the view, known as anti-exceptionalism about logic, that the subject matter and epistemology of logic may not be so different from that of the recognised sciences. One of the most prevalent claims made by advocates of AEL is that theory choice within logic is significantly similar to that within the sciences. This connection with scientific methodology highlights a considerable challenge for the anti-exceptionalist, as two (...) uncontentious claims about scientific theories are that they attempt to explain a target phenomenon and prove their worth through successful predictions. Thus, if this methodological AEL is to be viable, the anti-exceptionalist will need a reasonable account of what phenomena logics are attempting to explain, how they can explain, and in what sense they can be said to issue predictions. This paper makes sense of the anti-exceptionalist proposal with a new account of logical theory choice, logical predictivism, according to which logics are engaged in both a process of prediction and explanation. (shrink)

It is often held that identity properties like the property of being identical to Paris are intrinsic. It is also often held that, while some logically uninstantiable properties are intrinsic, some logically uninstantiable properties are non-intrinsic. The combination of these views, however, raises a problem, since virtually every existing account of intrinsicality fails to analyse a notion of intrinsicality on which both these views are true. In this paper, I argue that, given the orthodox theory of counterlogicals, there is no (...) notion of intrinsicality on which both these views are true. If this argument is sucessful, then, at least given orthodoxy about counterlogicals, we face no challenge in analysing a notion of intrinsicality on which both these views are true, since there is no such notion. In addition, if we are also convinced that there is a notion of intrinsicality on which one of these views is true and a notion of intrinsicality on which the other of these views is true, we should hold that there is more than one notion of intrinsicality. (shrink)

This paper sets out a semantics for C.I. Lewis's logic S2 based on the ontology of his 1923 paper ‘Facts, Systems, and the Unity of the World’. In that article, worlds are taken to be maximal consistent systems. A system, moreover, is a collection of facts that is closed under logical entailment and conjunction. In this paper, instead of defining systems in terms of logical entailment, I use certain ideas in Lewis's epistemology and philosophy of logic to define a class (...) of models in which systems are taken to be primitive elements but bear certain relations to one another. I prove soundness and completeness for S2 over this class of models and argue that this semantics makes sense of at least a substantial fragment of Lewis's logical theory. (shrink)

According to a widely shared generic conception of inferential justification—‘the standard conception’—an agent is inferentially justified in believing that p only if she has antecedently justified beliefs in all the non-redundant premises of a good argument for p. This conception tends to serve as the starting-point in contemporary debates about the nature and scope of inferential justification: as neutral common ground between various competing, more specific, conceptions. But it’s a deeply problematic starting-point. This paper explores three questions that haven’t been (...) given the attention they deserve, that complicate the application of the standard conception to cases, and that reveal it to be underspecified at the core—in ways that aren’t resolved but inherited by more specific (extant) versions of it. The goal isn’t to answer the questions, but to articulate them, explain what turns on them, and invite a critical re-examination of the standard conception. (shrink)

Frege introduced the notion of pragmatic force as what distinguishes statements from questions. This distinction was elaborated by Wittgenstein in his later works, and systematised as an account of different kinds of speech acts in formal dialogue theory by Hamblin. It lies at the heart of the inferential semantics more recently developed by Brandom. The present paper attempts to sketch some of the relations between these developments.

There is a natural story about what logic is that sees it as tied up with two operations: a ‘throw things into a bag’ operation and a ‘closure’ operation. In a pair of recent papers, Jc Beall has fleshed out the account of logic this leaves us with in more detail. Using Beall’s exposition as a guide, this paper points out some problems with taking the second operation to be closure in the usual sense. After pointing out these problems, I (...) then turn to fixing them in a restricted case and modulo a few simplifying assumptions. In a followup paper, the simplifications and restrictions will be removed. (shrink)

Our aim is to model the behaviour of a cognitive agent trying to solve a complex problem by dividing it into sub-problems, but failing to solve some of these sub-problems. We use the powerful framework of erotetic search scenarios combined with Kleene’s strong three-valued logic. ESS, defined on the grounds of Inferential Erotetic Logic, has appeared to be a useful logical tool for modelling cognitive goal-directed processes. Using the logical tools of ESS and the three-valued logic, we will show how (...) an agent could solve the initial problem despite the fact that the sub-problems remain unsolved. Thus our model not only indicates missing information but also specifies the contexts in which the problem-solving process may end in success despite the lack of information. We will also show that this model of problem solving may find use in an analysis of natural language dialogues. (shrink)

This article introduces, studies, and applies a new system of logic which is called ‘HYPE’. In HYPE, formulas are evaluated at states that may exhibit truth value gaps and truth value gluts. Simple and natural semantic rules for negation and the conditional operator are formulated based on an incompatibility relation and a partial fusion operation on states. The semantics is worked out in formal and philosophical detail, and a sound and complete axiomatization is provided both for the propositional and the (...) predicate logic of the system. The propositional logic of HYPE is shown to contain first-degree entailment, to have the Finite Model Property, to be decidable, to have the Disjunction Property, and to extend intuitionistic propositional logic conservatively when intuitionistic negation is defined appropriately by HYPE’s logical connectives. Furthermore, HYPE’s first-order logic is a conservative extension of intuitionistic logic with the Constant Domain Axiom, when intuitionistic negation is again defined appropriately. The system allows for simple model constructions and intuitive Euler-Venn-like diagrams, and its logical structure matches structures well-known from ordinary mathematics, such as from optimization theory, combinatorics, and graph theory. HYPE may also be used as a general logical framework in which different systems of logic can be studied, compared, and combined. In particular, HYPE is found to relate in interesting ways to classical logic and various systems of relevance and paraconsistent logic, many-valued logic, and truthmaker semantics. On the philosophical side, if used as a logic for theories of type-free truth, HYPE is shown to address semantic paradoxes such as the Liar Paradox by extending non-classical fixed-point interpretations of truth by a conditional as well-behaved as that of intuitionistic logic. Finally, HYPE may be used as a background system for modal operators that create hyperintensional contexts, though the details of this application need to be left to follow-up work. (shrink)

Philosophers disagree whether composition as identity entails mereological universalism. Bricker :264–294, 2016) has recently considered an argument which concludes that composition as identity supports universalism. The key step in this argument is the thesis that any objects are identical to some object, which Bricker justifies with the principle of the universality of identity. I will spell out this principle in more detail and argue that it has an unexpected consequence. If the universality of identity holds, then composition as identity not (...) only leads us to universalism, but also leads to the view that there are no mereological atoms. (shrink)