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 Thcorcms 9 and 10 we discuss the complexity of the set of founded elements in a recursively enumerable relation on the set JJ of natural numbers, in the framework of reduction between relations. We also find an application in the theory of diagonahzable algebras and construct an undecidable formula.
Translating the hypergame paradox: remarks on the set of founded elements of a relation / Bernardi, Claudio; D'Agostino, G.. - In: JOURNAL OF PHILOSOPHICAL LOGIC. - ISSN 0022-3611. - STAMPA. - 25:(1996), pp. 545-557. [10.1007/BF00257385]
Translating the hypergame paradox: remarks on the set of founded elements of a relation
BERNARDI, Claudio;
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 Thcorcms 9 and 10 we discuss the complexity of the set of founded elements in a recursively enumerable relation on the set JJ of natural numbers, in the framework of reduction between relations. We also find an application in the theory of diagonahzable algebras and construct an undecidable formula.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
