Permutation invariance is often presented as the correct criterion for logicality. The basic idea is that one can demarcate the realm of logic by isolating specific entities—logical notions or constants—and that permutation invariance would provide a philosophically motivated and technically sophisticated criterion for what counts as a logical notion. The thesis of permutation invariance as a criterion for logicality has received considerable attention in the literature in recent decades, and much of the debate is (...) developed against the background of ideas put forth by Tarski in a 1966 lecture (Tarski 1966/1986). But as noted by Tarski himself in the lecture, the permutation invariance criterion yields a class of putative ‘logical constants’ that are essentially only sensitive to the number of elements in classes of individuals. Thus, to hold the permutation invariance thesis essentially amounts to limiting the scope of logic to quantificational phenomena, which is controversial at best and possibly simply wrong. In this paper, I argue that permutation invariance is a misguided approach to the nature of logic because it is not an adequate formal explanans for the informal notion of the generality of logic. In particular, I discuss some cases of undergeneration of the criterion, i.e. the fact that it excludes from the realm of logic operators that we have good reason to regard as logical, especially some modal operators. (shrink)

In this article I expound an understanding of the quantum mechanics of so-called “indistinguishable” systems in which permutation invariance is taken as a symmetry of a special kind, namely the result of representational redundancy. This understand- ing has heterodox consequences for the understanding of the states of constituent systems in an assembly and for the notion of entanglement. It corrects widespread misconceptions about the inter-theoretic relations between quantum mechanics and both classical particle mechanics and quantum field theory. The (...) most striking of the heterodox consequences are: that fermionic states ought not always to be considered entangled; it is possible for two fermions or two bosons to be discerned using purely monadic quantities; and that fermions may always be so discerned. (shrink)

The purpose of this short article is to build on the work of Ghirardi, Marinatto and Weber and Ladyman, Linnebo and Bigaj, in supporting a redefinition of en- tanglement for “indistinguishable” systems, particularly fermions. According to the proposal, non-separability of the joint state is insufficient for entanglement. The re- definition is justified by its physical significance, as enshrined in three biconditionals whose analogues hold of “distinguishable” systems.

There is an extensive philosophical literature on the interrelated issues of identity, individuality, and distinguishability. Out of this discussion has arisen a concept called “permutation invariance” that is asserted to apply to quantum systems. I argue that in fact there is no such invariance, and that the best way to understand the permutation of labels in the symmetrized states is as an exchange of haecceities, rather than as an exchange of essences equivalent to permutation (...) class='Hi'>invariance. I argue that the strongest notion of haecceity (i.e., "classical haecceity") does not apply at the quantum level, but that in order to properly account for the need for symmetrization in quantum systems, a weaker kind of haecceity must be involved, which I call quantum haecceity. (shrink)

Physical theories continue to be interpreted in terms of particles. The idea of a particle required modification with the advent of quantum theory, but remains central to scientific explanation. Particle ontologies also have the virtue of explaining basic epistemic features of the world, and so remain appealing for the scientific realist. However, particle ontologies are untenable when coupled with the empirically necessary postulate of permutation invariance—the claim that permuting the roles of particles in a representation of a physical (...) state results in a representation of the same physical state. I demonstrate that any theory which is permutation invariant in this sense is incompatible with a particle ontology. (shrink)

The idea that the world is made of particles — little discrete, interacting objects that compose the material bodies of everyday experience — is a durable one. Following the advent of quantum theory, the idea was revised but not abandoned. It remains manifest in the explanatory language of physics, chemistry, and molecular biology. Aside from its durability, there is good reason for the scientific realist to embrace the particle interpretation: such a view can account for the prominent epistemic fact that (...) only limited knowledge of a portion of the material universe is needed in order to make reliable predictions about that portion. Thus, particle interpretations can support an abductive argument from the epistemic facts in favor of a realist reading of physical theory. However, any particle interpretation with this property is untenable. The empirical adequacy of modern particle theories requires adoption of a postulate known as permutation invariance — the claim that interchanging the role of two particles of the same kind in a dynamical state description results in a description of the identical state. It is the central claim of this essay that PI is incompatible with any particle interpretation strong enough to account for the epistemic facts. This incompatibility extends across all physical theories. To frame and motivate the inconsistency argument, I begin by fixing the relevant notion of particle. To single out those accounts of greatest appeal to the realist, I develop the logically weakest particle ontology that entails the epistemic fact that the world is piecewise predictable, an ontology I call ‘minimal atomism’. The entire series of scientific conceptions of the particle, from Newton’s mechanically interacting corpuscles to the ‘centers of force’ in classical field theories, all comport with MA. As long as PI is left out, even quantum mechanics can be viewed this way. To assess the impact of PI on this picture, I present a framework for rigorously connecting interpretations to physical theories. In particular, I represent MA as a set of formal conditions on the models of physical theories, the mathematical structures taken to represent states of the world. I also formulate PI — originally introduced as a postulate of non-relativistic quantum mechanics — in theory independent terms. With all of these pieces in hand, I am then able to present a proof of the inconsistency of PI and MA. In the second part of the essay, I survey responses to the inconsistency result open to the scientific realist. The two most plausible approaches involve abandoning particles in one way or another. The first alternative interpretation considered takes the property bearing objects of the world to be regions of space rather than particles. In this view, the properties once attributed to particles in quantum states are attributed instead to one or more regions of space. PI no longer obtains in this case, at least not as a statement about the permutation symmetry of property bearers. Rather, the new interpretation naturally imposes an analogous constraint on quantum states. The second major approach to evading the inconsistency result is to dispense with objects altogether. This is the recommendation of so-called ‘Ontic Structural Realism’. The central OSR thesis is that structure rather than entities are the basic ontological components of the world. OSR is intended to embrace the ‘miracle’ argument in favor of scientific realism while avoiding the pessimistic meta-induction. I demonstrate that one principal motivation for OSR based on the under-determination of interpretations in QM is actually dissolved by the incompatibility result. At the same time, I suggest reasons to think that OSR fares no better with respect to the pessimistic meta-induction than traditional realism does. Thus, while PI and MA may be incompatible, object ontologies remain the best option for the realist. (shrink)

We consider the possible cardinalities of the following three cardinal invariants which are related to the permutation group on the set of natural numbers: the least cardinal number of maximal cofinitary permutation groups; the least cardinal number of maximal almost disjoint permutation families; the cofinality of the permutation group on the set of natural numbers.We show that it is consistent with that ; in fact we show that in the Miller model.

There has been considerable recent philosophical debate over the implications of many particle quantum mechanics for the metaphysics of individuality (cf. Huggett [1997]). In this paper I look at things from a rather different perspective: by investigating the significance of permutation symmetry. I consider how various philosophical positions link up to the physical postulate of the indistinguishability of permuted states-permutation invariance-and how this postulate is used to explain quantum statistics. I offer an explanation of the statistics that (...) relies on the neglected parallel between permutations and covariant spatial transformation. And I explore the parallel, showing that a further kind of symmetry explains why permutations are invariant when spatial symmetries are not. (shrink)

What are logical notions? According to a very popular proposal, a logical notion is something invariant under some “transformation” of objects, usually permutations or isomorphisms. The first chapter is about extending “invariance” accounts of logicality to intensional notions, by asking for invariance under arbitrary permutations of both possible worlds and objects. I discuss the results one gets in this extended theory of invariance, and how to fix many technical issues. The second chapter is about setting out a (...) better theory of logicality. I discuss the limits of invariance frameworks, and the need for a theory of logicality with a more solid philosophical ground. I believe that the concept of information can play a major role in defining what logic is and what logical notions are. I spell out this intuition, by designing a new test for logicality. A notion is logical iff it behaves in a certain way, by checking only “structural aspects of information”, and it does so under arbitrary transformations of its “informational inputs”. In the last chapter I explore some interesting features of my theory. I show how, contrary to standard invariance, in mine logical notions tend to stay persistent across different models of information. I also spell out an intermediate notion of quasi-logicality to make sense of the formality of “world-sensitive” notions: notions whose behaviour changes across worlds. I finally propose a case study: deontic modals. I discuss how one can argue for their quasi-logicality, in my framework. The dissertation is concluded with a technical appendix, in which I prove that my theory is a restriction of standard permutation invariance when we model the space of information in a certain way: as a set of complete powersets of some sets. (shrink)

The dual character of invariance under transformations and definability by some operations has been used in classical works by, for example, Galois and Klein. Following Tarski, philosophers of logic have claimed that logical notions themselves could be characterized in terms of invariance. In this article, we generalize a correspondence due to Krasner between invariance under groups of permutations and definability in L∞∞ so as to cover the cases that are of interest in the logicality debates, getting McGee’s (...) theorem about quantifiers invariant under all permutations and definability in pure L∞∞ as a particular case. We also prove some optimality results along the way, regarding the kinds of relations which are needed so that every subgroup of the full permutation group is characterizable as a group of automorphisms. (shrink)

What is a logical constant? The question is addressed in the tradition of Tarski's definition of logical operations as operations which are invariant under permutation. The paper introduces a general setting in which invariance criteria for logical operations can be compared and argues for invariance under potential isomorphism as the most natural characterization of logical operations.

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)

The logical status of abstraction principles, and especially Hume’s Principle, has been long debated, but the best currently availeble tool for explicating a notion’s logical character—permutation invariance—has not received a lot of attention in this debate. This paper aims to fill this gap. After characterizing abstraction principles as particular mappings from the subsets of a domain into that domain and exploring some of their properties, the paper introduces several distinct notions of permutation invariance for such principles, (...) assessing the philosophical significance of each. (shrink)

In his 1974 paper “Popper’s qualitative theory of verisimilitude” published in the British Journal for the Philosophy of Science David Miller gave his so called ‘Weather Example’ to argue that the Hamming distance between constituents is flawed as a measure of proximity to truth since the former is not, unlike the latter, translation invariant. In this present paper we generalise David Miller’s Weather Example in both the unary and polyadic cases, characterising precisely which permutations of constituents/atoms can be effected by (...) translations. In turn this suggests a meta-principle of the rational assignment of subjective probabilities, that rational principles should be preserved under translations, which we formalise and give a particular characterisation of in the context of Unary Pure Inductive Logic. (shrink)

Fine and Antonelli introduce two generalizations of permutation invariance — internal invariance and simple/double invariance respectively. After sketching reasons why a solution to the Bad Company problem might require that abstraction principles be invariant in one or both senses, I identify the most fine-grained abstraction principle that is invariant in each sense. Hume’s Principle is the most fine-grained abstraction principle invariant in both senses. I conclude by suggesting that this partially explains the success of Hume’s Principle, (...) and the comparative lack of success in reconstructing areas of mathematics other than arithmetic based on non-invariant abstraction principles. (shrink)

In Pure Inductive Logic, the rational principle of Predicate Exchangeability states that permuting the predicates in a given language L and replacing each occurrence of a predicate in an L-sentence phi according to this permutation should not change our belief in the truth of phi. In this paper we study when a prior probability function w on a purely unary language L satisfying Predicate Exchangeability also satisfies the principle of Unary Language Invariance.

The problem of logical constants consists in finding a principled way to draw the line between those expressions of a language that are logical and those that are not. The criterion of invariance under permutation, attributed to Tarski, is probably the most common answer to this problem, at least within the semantic tradition. However, as the received view on the matter, it has recently come under heavy attack. Does this mean that the criterion should be amended, or maybe (...) even that it should be abandoned? I shall review the different types of objections that have been made against invariance as a logicality criterion and distinguish between three kinds of objections, skeptical worries against the very relevance of such a demarcation, intensional warnings against the level at which the criterion operates, and extensional quarrels against the results that are obtained. I shall argue that the first two kinds of objections are at least partly misguided and that the third kind of objection calls for amendment rather than abandonment. (shrink)

On a widespread naturalist view, the meanings of mathematical terms are determined, and can only be determined, by the way we use mathematical language—in particular, by the basic mathematical principles we’re disposed to accept. But it’s mysterious how this can be so, since, as is well known, minimally strong first-order theories are non-categorical and so are compatible with countless non-isomorphic interpretations. As for second-order theories: though they typically enjoy categoricity results—for instance, Dedekind’s categoricity theorem for second-order PA and Zermelo’s quasi-categoricity (...) theorem for second-order ZFC—these results require full second-order logic. So appealing to these results seems only to push the problem back, since the principles of second-order logic are themselves non-categorical: those principles are compatible with restricted interpretations of the second-order quantifiers on which Dedekind’s and Zermelo’s results are no longer available. In this paper, we provide a naturalist-friendly, non-revisionary solution to an analogous but seemingly more basic problem—Carnap’s Categoricity Problem for propositional and first-order logic—and show that our solution generalizes, giving us full second-order logic and thereby securing the categoricity or quasi-categoricity of second-order mathematical theories. Briefly, the first-order quantifiers have their intended interpretation, we claim, because we’re disposed to follow the quantifier rules in an open-ended way. As we show, given this open-endedness, the interpretation of the quantifiers must be permutation-invariant and so, by a theorem recently proved by Bonnay and Westerståhl, must be the standard interpretation. Analogously for the second-order case: we prove, by generalizing Bonnay and Westerståhl’s theorem, that the permutation invariance of the interpretation of the second-order quantifiers, guaranteed once again by the open-endedness of our inferential dispositions, suffices to yield full second-order logic. (shrink)

The paper provides a new argument against the classical invariance criterion for logical terms: if all terms with a permutation invariant extension qualify as logical, then for any arbitrary true contingent sentence K of the meta-language, there would be a logically true object-language sentence 'φ' such that K follows from the sentence 'φ is true'. Thus, many logically true sentences would be a posteriori. To prevent this fatal consequence, we propose to alter the invariance criterion: not only (...) the term's extension, but also its semantic clause must satisfy certain invariance conditions. The paper ends with the observation that the new criterion makes explicit the dependency of the classification of terms into logical and non-logical ones at the different levels of the Tarskian hierarchy of languages. (shrink)

In this paper I discuss some metaphysical consequences of an unorthodox approach to the problem of the identity and individuality of “indistinguishable” quantum particles. This approach is based on the assumption that the only admissible way of individuating separate components of a given system is with the help of the permutation-invariant qualitative properties of the total system. Such a method of individuation, when applied to fermionic compositions occupying so-called GMW-nonentangled states, yields highly implausible consequences regarding the number of distinct (...) components of a given composite system. I specify the problem in detail, and I consider several strategies of solving it. The preferred solution of the problem is based on the premise that spatial location should play a privileged role in identifying and making reference to quantum-mechanical systems. (shrink)

We take Carnap’s problem to be to what extent standard consequence relations in various formal languages fix the meaning of their logical vocabulary, alone or together with additional constraints on the form of the semantics. This paper studies Carnap’s problem for basic modal logic. Setting the stage, we show that neighborhood semantics is the most general form of compositional possible worlds semantics, and proceed to ask which standard modal logics (if any) constrain the box operator to be interpreted as in (...) relational Kripke semantics. Except when restricted to finite domains, no modal logic characterizes all the Kripkean interpretation of P. Moreover, we show that, in contrast with the case of first-order logic, the obvious requirement of permutation invariance is not adequate in the modal case. After pointing out some known facts about modal logics that nevertheless force the Kripkean interpretation, we focus on another feature often taken to embody the gist of modal logic: locality. We show that invariance under point-generated subframes (properly defined) does single out the Kripkean interpretations, but only among topological interpretations, not in general. Finally, we define a notion of bisimulation invariance — another aspect of locality — that, together with a reasonable closure condition, gives the desired general result. Along the way, we propose a new perspective on normal neighborhood frames as filter frames, consisting of a set of worlds equipped with an accessibility relation, and a free filter at every world. (shrink)

The ways in which space-time points and elementary particles are modeled share a curious feature: neither seems to specify which basic object has which properties. This chapter sketches the motivation for this claim and searches for an explanation for it. After reviewing several proposals, it argues for a view according to which objects occupy their place in a given relational structure essentially. This view, which is termed minimal structural essentialism, provides a metaphysical grounding for the physical equivalence of models related (...) by permutation. An interesting consequence of this position is that space-time points and elemental particles turn out to be individuals, albeit of a rather different sort than has traditionally been considered. (shrink)

Quantum indistinguishability directly relates to the philosophical debate on the notions of identity and individuality. They are crucial for our understanding of multipartite quantum systems. Furthermore, the correct interpretation of this feature of quantum theory has implications that transcend fundamental science and philosophy, given that quantum indistinguishability is a resource in quantum information theory. Most of the conceptual analysis of quantum indistinguishability is restricted to studying the permutational invariance of quantum states, the concomitant quantum statistics and their entanglement. Here, (...) we analyse the role of indistinguishability and non-individuality in other areas of quantum theory. We start by analysing how a very peculiar use of indistinguishability underlies Feynman’s rules for summing amplitudes in interference phenomena. Next, we study how quantum indistinguishability is underestimated in several topics of debate in the quantum physics literature, such as the Einstein–Podolsky–Rosen argument, Bell’s inequalities and the Bell–Kochen–Specker theorem. Finally, we argue that an ontology of truly indistinguishable entities can serve as a basis for a quantum ontology that can give interesting answers to the interpretational problems of quantum mechanics. We claim that, in addition to superposition, contextuality and entanglement, indistinguishability (understood in a robust ontological sense) is one of the central features of quantum physics. -/- . (shrink)

We demonstrate that the quantum-mechanical description of composite physical systems of an arbitrary number of similar fermions in all their admissible states, mixed or pure, for all finite-dimensional Hilbert spaces, is not in conflict with Leibniz's Principle of the Identity of Indiscernibles (PII). We discern the fermions by means of physically meaningful, permutation-invariant categorical relations, i.e. relations independent of the quantum-mechanical probabilities. If, indeed, probabilistic relations are permitted as well, we argue that similar bosons can also be discerned in (...) all their admissible states; but their categorical discernibility turns out to be a state-dependent matter. In all demonstrated cases of discernibility, the fermions and the bosons are discerned (i) with only minimal assumptions on the interpretation of quantum mechanics; (ii) without appealing to metaphysical notions, such as Scotusian haecceitas, Lockean substrata, Postian transcendental individuality or Adamsian primitive thisness; and (iii) without revising the general framework of classical elementary predicate logic and standard set theory, thus without revising standard mathematics. This confutes: (a) the currently dominant view that, provided (i) and (ii), the quantum-mechanical description of such composite physical systems always conflicts with PII; and (b) that if PII can be saved at all, the only way to do it is by adopting one or other of the thick metaphysical notions mentioned above. Among the most general and influential arguments for the currently dominant view are those due to Schrodinger, Margenau, Cortes, Dalla Chiara, Di Francia, Redhead, French, Teller, Butterfield, Giuntini, Mittelstaedt, Castellani, Krause and Huggett. We review them succinctly and critically as well as related arguments by van Fraassen and Massimi. (shrink)

This article develops an analogy proposed by Stachel between general relativity (GR) and quantum mechanics (QM) as regards permutation invariance. Our main idea is to overcome Pooley's criticism of the analogy by appeal to paraparticles. In GR, the equations are (the solution space is) invariant under diffeomorphisms permuting spacetime points. Similarly, in QM the equations are invariant under particle permutations. Stachel argued that this feature—a theory's ‘not caring which point, or particle, is which’—supported a structuralist ontology. Pooley criticizes (...) this analogy: in QM the (anti-)symmetrization of fermions and bosons implies that each individual state (solution) is fixed by each permutation, while in GR a diffeomorphism yields in general a distinct, albeit isomorphic, solution. We define various versions of structuralism, and go on to formulate Stachel's and Pooley's positions, admittedly in our own terms. We then reply to Pooley. Though he is right about fermions and bosons, QM equally allows more general types of particle symmetry, in which states (vectors, rays, or density operators) are not fixed by all permutations (called ‘paraparticle states’). Thus Stachel's analogy is revived. (shrink)

Logic is a celebrated representation language because of its formal generality. But there are two senses in which a logic may be considered general, one that concerns a technical ability to discriminate between different types of individuals, and another that concerns constitutive norms for reasoning as such. This essay embraces the former, permutation-invariance conception of logic and rejects the latter, Fregean conception of logic. The question of how to apply logic under this pure invariantist view is addressed, and (...) a methodology is given. The pure invariantist view is contrasted with logical pluralism, and a methodology for applied logic is demonstrated in remarks on a variety of issues concerning non-monotonic logic and non-monotonic inference, including Charles Morgan’s impossibility results for non-monotonic logic, David Makinson’s normative constraints for non-monotonic inference, and Igor Douven and Timothy Williamson’s proposed formal constraints on rational acceptance. (shrink)

How best to think about quantum systems under permutation invariance is a question that has received a great deal of attention in the literature. But very little attention has been paid to taking seriously the proposal that permutation invariance reflects a representational redundancy in the formalism. Under such a proposal, it is far from obvious how a constituent quantum system is represented. Consequently, it is also far from obvious how quantum systems compose to form assemblies, i.e. (...) what is the formal structure of their relations of parthood, overlap and fusion. In this paper, I explore one proposal for the case of fermions and their assemblies. According to this proposal, fermionic assemblies which are not entangled—in some heterodox, but natural sense of ‘entangled’—provide a prima facie counterexample to classical mereology. This result is puzzling; but, I argue, no more intolerable than any other available interpretative option. (shrink)

Let X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{X }$$\end{document} be a set of outcomes, and let I\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{I }$$\end{document} be an infinite indexing set. This paper shows that any separable, permutation-invariant preference order \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$$$\end{document} on XI\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{X }^\mathcal{I }$$\end{document} admits an additive representation. That is: there exists a linearly ordered abelian group (...) R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{R }$$\end{document} and a ‘utility function’ u:X⟶R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$u:\mathcal{X }{{\longrightarrow }}\mathcal{R }$$\end{document} such that, for any x,y∈XI\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf{x},\mathbf{y}\in \mathcal{X }^\mathcal{I }$$\end{document} which differ in only finitely many coordinates, we have x≽y\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf{x}\succcurlyeq \mathbf{y}$$\end{document} if and only if ∑i∈Iu-u≥0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sum _{i\in \mathcal{I }} \left[u-u\right]\ge 0$$\end{document}. Importantly, and unlike almost all previous work on additive representations, this result does not require any Archimedean or continuity condition. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$$$\end{document} also satisfies a weak continuity condition, then the paper shows that, for anyx,y∈XI\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf{x},\mathbf{y}\in \mathcal{X }^\mathcal{I }$$\end{document}, we have x≽y\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf{x}\succcurlyeq \mathbf{y}$$\end{document} if and only if ∗∑i∈Iu≥∗∑i∈Iu\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${}^*\!\sum _{i\in \mathcal{I }} u\ge {}^*\!\sum _{i\in \mathcal{I }}u$$\end{document}. Here, ∗∑i∈Iu\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${}^*\!\sum _{i\in \mathcal{I }} u$$\end{document} represents a nonstandard sum, taking values in a linearly ordered abelian group ∗R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${}^*\!\mathcal{R }$$\end{document}, which is an ultrapower extension of R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal{R }$$\end{document}. The paper also discusses several applications of these results, including infinite-horizon intertemporal choice, choice under uncertainty, variable-population social choice and games with infinite strategy spaces. (shrink)

Ontic structuralism or ontic structural realism in the philosophy of physics can be broadly considered as an interpretative strategy providing a set of conceptual and metaphysical tools—or, more ambitiously, an ontological framework—in order to account for central features of current fundamental physics. This article aims to review the main structuralist interpretative moves in the context of our two best fundamental physical theories of matter and spacetime, namely, quantum theory and general relativity. We highlight in particular the structuralist understanding of (...) class='Hi'>permutation invariance, entanglement and nonlocality in quantum theory, and of the dynamical features of spacetime, diffeomorphism invariance and background independence in general relativity. (shrink)

The significance of Max Black’s indistinguishable spheres for the nature of particles in quantum mechanics is discussed, focusing in particular on the use of the idea of weak indiscernibility. It is argued that there can be four such Black spheres but that five are impossible. It follows from this that Black’s example cannot serve as a model for indistinguishability in physics. But Black’s discussion of his spheres gave rise to the idea of weak discernibility and it is argued that such (...) predicates are unsatisfiable in the way intended. The underlying problem with weak discernibility spreads out to also undermine the whole notion that indistinguishability rests on a notion of the permutation invariance of particles. A better foundation is indicated. (shrink)

Dissipative structures consisting of a few macrovariables arise out of a sea of reversible microvariables. Unexpected residual effects of the massive underlying reversibility, on the macrolevel, cannot therefore be excluded. In the age of molecular-dynamics simulations, explicit dissipative structures like excitable systems (“explicit observers”) can be generated in a computer from first reversible principles. A class of classical, 1-D Hamiltonian systems of chaotic type is considered which has the asset that the trajectorial behavior in phase space can be understood geometrically. (...) If, as natural, the number of particle types is much smaller than that of particles, the Gibbs symmetry must be taken into account. The permutation invariance drastically changes the behavior in phase space (quasi-periodization). The explicit observer becomes effectively reversible on a short time scale. In consequence, his ability to measure microscopic motions is suspended in a characteristic fashion. Unlike quantum mechanics whose “holistic” nature cannot be transcended, the present holistic (internal-interface) effects—mimicking the former to some extent—can be understood fully in principle. (shrink)

This dissertation is about the meaning of phrases like "That man" or "This bag". These phrases are described as Complex Demonstratives. There is a difference of opinion regarding whether these phrases are directly referential or quantificational. I have weighed the arguments regarding this debate in the dissertation. I have concluded that there are cogent arguments to believe that such phrases are quantificational. However, one cannot retain the insights of the directly referential account inside the quantificational account. That is a creditable (...) move, but the move abandons a crucial property of quantifiers: permutation invariance. Since that is the case, I have suggested that given the evidence at hand, and the examination of the evidence in the dissertation, we may settle for a simpler theory that does not accommodate the intuitions of the direct referentialist. Those intuitions have to be accounted for through the intentions of a speaker when she utters phrases using complex demonstratives. (shrink)

The treatment of identical particles in quantum mechanics rests on two (related) principles: the spin-statistics connection and the Symmetrization Postulate. In light of recent theories (such as q-deformed commutators) that allow for ‘small’ violations of the spin-statistics connection and the Symmetrization Postulate, we revisit the issue of how quantum mechanics deals with identical particles and how it supports or fails to support various philosophical stances concerning individuality. As a consequence of the expanded possibilities for quantum statistics, we argue that (...) class='Hi'>permutation symmetry is best formulated as a formal property of the state function describing the system of particles rather than as a property of the individual particles. 1 Introduction 2 Philosophical background 2.1 Important terminology 2.1.1 Identity 2.1.2 Indistinguishability 2.1.3 Indiscernibility 2.2 When are particles indistinguishable? 2.3 The Principle of the Identity of Indiscernibles and quantum mechanics 2.4 The Principle of the Identity of Indiscernibles and logic 2.5 Particle history 2.6 Transcendental individuality 3 Some quantum formalism 3.1 The Principle of Permutation Invariance and the Symmetrization Postulate 3.2 The configuration-space approach 3.3 Commutators and anticommutators, and identical particle statistics 3.4 Q-mutators 4 Identical particle statistics: a holistic point of view 5 Conclusions. (shrink)

There is an extensive philosophical literature on the interrelated issues of identity, individuality, and distinguishability in quantum systems. A key consideration is whether quantum systems are subject to a strong form of individuality termed ``haecceity'' (from the Latin for ``this-ness''). I argue that the traditional, strong form of haecceity does not apply at the quantum level, but that in order to properly account for the need for symmetrization in quantum systems, a weaker kind of haecceity must be involved, which I (...) call quantum haecceity. In the process, I also question some generally accepted tenets of the current debate, such as the idea that symmetrization of states for identical quanta must be postulated and reflects permutation invariance. Instead, I note that a perturbative Hamiltonian is required for exchange effects, which suggests that the need for symmetrization arises from specific physical conditions. (shrink)

The relation of global supervenience is widely appealed to in philosophy. In slogan form, it is explained as follows: a class of properties A supervenes on a class of properties B if no two worlds differ in the distribution of A-properties without differing in the distribution of B-properties. It turns out, though, that there are several ways to cash out that slogan. Three different proposals have been discussed in the literature. In this paper, I argue that none of them is (...) adequate. Furthermore, I present a puzzle that reveals a tension in our concept of global supervenience. (shrink)

In this paper I consider the question of whether absolute discernibility is attainable in symmetric languages. Simon Saunders has proven that all facts expressible in first-order language with identity can be equivalently stated within its symmetric sublanguage. I use this result to show specifically how particles of the same type can be absolutely discerned in the permutation-invariant language of the quantum theory of many particles.

A family of symmetries of polyadic inductive logic are described which in turn give rise to the purportedly rational Permutation Invariance Principle stating that a rational assignment of probabilities should respect these symmetries. An equivalent, and more practical, version of this principle is then derived.

This paper argues for a different logical form for complex demonstratives, given that the quantificational account is correct. In itself that is controversial, but two aspects will be assumed. Firstly, there are arguments to believe that complex demonstratives have quantificational uses. Specifically, there are syntactic arguments. Secondly, a uniform semantics is preferable to a semantics of ambiguity. Given this, the proposed logical forms for complex demonstratives that are prevalent do not respect a fundamental property of quantifiers: permutation invariance. (...) The reason for this is the attempt to retain, in the logical forms proposed, the strong intuitions of reference that uses of complex demonstratives display. The paper suggests that the directly referential intuitions surrounding complex demonstratives cannot be taken to be part of the semantics of the expression. There appears to be no need to do so, either. The paper defends the new logical form against various objections. (shrink)

Both bosons and fermions satisfy a strong version of Leibniz’s Principle of the Identity of Indiscernibles (PII), and so are ontologically on a par with respect to the PII. This holds for non-entangled, non-product states and for physically entangled states—as it has been established in previous work. In this paper, the Leibniz strategy is completed by including the (bosonic) symmetric product states. A new understanding of Pauli’s Exclusion Principle is provided, which distinguishes bosons from fermions in a peculiar ontological way. (...) Finally, the program as a whole is defended against substantial objections. (shrink)

We initiate the study of reducts of relational structures up to primitive positive interdefinability: After providing the tools for such a study, we apply these tools in order to obtain a classification of the reducts of the logic of equality. It turns out that there exists a continum of such reducts. Equivalently, expressed in the language of universal algebra, we classify those locally closed clones over a countable domain which contain all permutations of the domain.

Tarski and Mautner proposed to characterize the "logical" operations on a given domain as those invariant under arbitrary permutations. These operations are the ones that can be obtained as combinations of the operations on the following list: identity; substitution of variables; negation; finite or infinite disjunction; and existential quantification with respect to a finite or infinite block of variables. Inasmuch as every operation on this list is intuitively "logical", this lends support to the Tarski-Mautner proposal.

Here is an account of logical consequence inspired by Bolzano and Tarski. Logical validity is a property of arguments. An argument is a pair of a set of interpreted sentences (the premises) and an interpreted sentence (the conclusion). Whether an argument is logically valid depends only on its logical form. The logical form of an argument is fixed by the syntax of its constituent sentences, the meanings of their logical constituents and the syntactic differences between their non-logical constituents, treated as (...) variables. A constituent of a sentence is logical just if it is formal in meaning, in the sense roughly that its application is invariant under permutations of individuals.1 Thus ‘=’ is a logical constant because no permutation maps two individuals to one or one to two; ‘∈’ is not a logical constant because some permutations interchange the null set and its singleton. Truth functions, the usual quantifiers and bound variables also count as logical constants. An argument is logically valid if and only if the conclusion is true under every assignment of semantic values to variables (including all non-logical expressions) under which all its premises are true. A sentence is logically true if and only if the argument with no premises of which it is the conclusion is logically valid, that is, if and only if the sentence is true under every assignment of semantic values to variables. An interpretation assigns values to all variables. (shrink)

We introduce a new theorem in social choice theory built on a path integral approach which will show that, under some reasonable conditions, there is a unique way to aggregate individual preferences based on fuzzy sets into a social preference based on probabilities, and that this way is invariant under any permutation of alternatives. We then apply this theorem to the case of democratic decision making with data of the behaviour and voting preferences of voting agents and show that (...) there is a tradeoff between fairness and efficiency and that no voting system can achieve both simultaneously. (shrink)

The paper starts with an examination and critique of Tarski’s wellknown proposed explication of the notion of logical operation in the type structure over a given domain of individuals as one which is invariant with respect to arbitrary permutations of the domain. The class of such operations has been characterized by McGee as exactly those definable in the language L∞,∞. Also characterized similarly is a natural generalization of Tarski’s thesis, due to Sher, in terms of bijections between domains. My main (...) objections are that on the one hand, the Tarski-Sher thesis thus assimilates logic to mathematics, and on the other hand fails to explain the notion of same logical operation across domains of different sizes. A new notion of homomorphism invariant operation over functional type structures (with domains M0 of individuals and {T, F} at their base) is introduced to accomplish the latter. The main result is that an operation is definable from.. (shrink)

We study a transfinite iteration of the ordinal Hessenberg natural sum obtained by taking suprema at limit stages. We show that such an iterated natural sum differs from the more usual transfinite ordinal sum only for a finite number of iteration steps. The iterated natural sum of a sequence of ordinals can be obtained as a mixed sum (in an order‐theoretical sense) of the ordinals in the sequence; in fact, it is the largest mixed sum which satisfies a finiteness condition. (...) We introduce other infinite natural sums which are invariant under permutations and show that all the sums under consideration coincide in the countable case. (shrink)