In Zwicker (1987) the hypergame paradox is introduced and studied. In this paper we continue this investigation, comparing the hypergame argument with the diagonal one, in order to find a proof schema. In particular, in Theorems 9 and 10 we discuss the complexity of the set of founded elements in a recursively enumerable relation on the set N of natural numbers, in the framework of reduction between relations. We also find an application in the theory of diagonalizable algebras and construct an undecidable formula.
Translating the hypergame Paradox; remarks on the set of founded elements of a relation
D'AGOSTINO, Giovanna
1996
Abstract
In Zwicker (1987) the hypergame paradox is introduced and studied. In this paper we continue this investigation, comparing the hypergame argument with the diagonal one, in order to find a proof schema. In particular, in Theorems 9 and 10 we discuss the complexity of the set of founded elements in a recursively enumerable relation on the set N of natural numbers, in the framework of reduction between relations. We also find an application in the theory of diagonalizable algebras and construct an undecidable formula.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
art%3A10.1007%2FBF00257385.pdf
non disponibili
Tipologia:
Documento in Post-print
Licenza:
Non pubblico
Dimensione
770.31 kB
Formato
Adobe PDF
|
770.31 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
