Games Iteration Numbers: A Philosophical Introduction to Computability Theory

Possati, Luca M

ISBN 10: 1848902980 / ISBN 13: 9781848902985

Edité par College Publications, 2019

A propos de cet article

Unread book in perfect condition.

N° de réf. du vendeur 35164965

Détails bibliographiques

• Titre: Games Iteration Numbers: A Philosophical Introduction to Computability Theory
• Éditeur: College Publications
• Date de parution: 2019
• Langue: anglais
• ISBN à 10 chiffres: 1848902980
• ISBN à 13 chiffres: 9781848902985
• Reliure: Couverture souple
• État de l'article: As New

A propos de ce titre

Synopsis

Is it possible to conceive two perfectly identical objects? Is identity even possible without

individuality? How would a perfectly symmetrical universe be? The current philosophical debate on identity, and in particular on the necessity of the Leibniz's principle of the identity of indiscernibles, is complex and multi-faceted. Recent works have indicated that the problem becomes increasingly complex if we apply it to mathematical objects. Is it possible to speak of 'identity' for numbers? How can we identify numbers?

Drawing on philosophical accounts on identity and individuality in contemporary metaphysics (analytic and continental), this book explores a new path. The author argues that an identity without individuality is possible. By means of a critique of the idea of the identity of indiscernibles, the book formulates the concept of 'manifold identity', through the concept of 'iteration'. Iteration is a specific transgression of the identity of indiscernibles arising from the collision of two forms of identity: qualitative identity and numerical identity. Nonetheless, a pair of perfectly identical objects is still a paradox, a contradiction.

The first thesis of the book is that iteration is a paraconsistent and dialethetical logical structure, which allows for true contradiction. The author applies recent works in non-standard logic and dialetheism (Priest, Routley, Berto) to illustrate how we can make sense of the idea that objects can be perfectly identical but discernible.

The second thesis of the book is that iteration is the basis of enumerability and computability. A 'computable object' is an object constructed on the basis of an iterative logic. It is possible to re-

interpret all the primary concepts of computability theory through the logic of iteration.