On Kinds of Indiscernibility in Logic and Metaphysics

06/20/2011
by   Adam Caulton, et al.
0

Using the Hilbert-Bernays account as a spring-board, we first define four ways in which two objects can be discerned from one another, using the non-logical vocabulary of the language concerned. (These definitions are based on definitions made by Quine and Saunders.) Because of our use of the Hilbert-Bernays account, these definitions are in terms of the syntax of the language. But we also relate our definitions to the idea of permutations on the domain of quantification, and their being symmetries. These relations turn out to be subtle---some natural conjectures about them are false. We will see in particular that the idea of symmetry meshes with a species of indiscernibility that we will call `absolute indiscernibility'. We then report all the logical implications between our four kinds of discernibility. We use these four kinds as a resource for stating four metaphysical theses about identity. Three of these theses articulate two traditional philosophical themes: viz. the principle of the identity of indiscernibles (which will come in two versions), and haecceitism. The fourth is recent. Its most notable feature is that it makes diversity (i.e. non-identity) weaker than what we will call individuality (being an individual): two objects can be distinct but not individuals. For this reason, it has been advocated both for quantum particles and for spacetime points. Finally, we locate this fourth metaphysical thesis in a broader position, which we call structuralism. We conclude with a discussion of the semantics suitable for a structuralist, with particular reference to physical theories as well as elementary model theory.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/25/2023

Vagueness in Predicates and Objects

Classical semantics assumes that one can model reference, predication an...
research
09/06/2022

A logical analysis of instrumentality judgments: means-end relations in the context of experience and expectations

This article proposes the use of temporal logic for an analysis of instr...
research
07/25/2022

Evolving Recursive Definitions with Applications to Dynamic Programming

Inspired by computability logic<cit.>, we refine recursive function defi...
research
12/16/2022

The Formal Theory of Monads, Univalently

We study the formal theory of monads, as developed by Street, in univale...
research
04/04/2023

Implementing Dynamic Programming in Computability Logic Web

We present a novel definition of an algorithm and its corresponding algo...
research
11/12/2019

Creating Auxiliary Representations from Charge Definitions for Criminal Charge Prediction

Charge prediction, determining charges for criminal cases by analyzing t...
research
01/27/2023

The Cartesian Closed Bicategory of Thin Spans of Groupoids

Recently, there has been growing interest in bicategorical models of pro...

Please sign up or login with your details

Forgot password? Click here to reset