Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1408.1672

Grades of Discrimination: Indiscernibility, symmetry, and relativity

Tim Button
View original source ↗Read source document ↗Export metadata ↓

Abstract

There are several relations which may fall short of genuine identity, but which behave like identity in important respects. Such grades of discrimination have recently been the subject of much philosophical and technical discussion. This paper aims to complete their technical investigation. Grades of indiscernibility are defined in terms of satisfaction of certain first-order formulas. Grades of symmetry are defined in terms of symmetries on a structure. Both of these families of grades of discrimination have been studied in some detail. However, this paper also introduces grades of relativity, defined in terms of relativeness correspondences. This paper explores the relationships between all the grades of discrimination, exhaustively answering several natural questions that have so far received only partial answers. It also establishes which grades can be captured in terms of satisfaction of object-language formulas, and draws connections with definability theory.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Tim Button. 2014-08-07. Grades of Discrimination: Indiscernibility, symmetry, and relativity. https://doi.org/10.1215/00294527-2017-0007

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗