[Zurück]


Zeitschriftenartikel:

L. San Mauro, J. Amidei, D. Pianigiani, A. Sorbi:
"Trial and error mathematics II: Dialectical sets and quasidialectical sets, their degrees, and their distribution";
Review Of Symbolic Logic, 9 (2016), 4; S. 810 - 835.



Kurzfassung englisch:
This paper is a continuation of Amidei, Pianigiani, San Mauro, Simi, & Sorbi (2016), where we have introduced the quasidialectical systems, which are abstract deductive systems designed to provide, in line with Lakatos´ views, a formalization of trial and error mathematics more adherent to the real mathematical practice of revision than Magari´s original dialectical systems. In this paper we prove that the two models of deductive systems (dialectical systems and quasidialectical systems) have in some sense the same information content, in that they represent two classes of sets (the dialectical sets and the quasidialectical sets, respectively), which have the same Turing degrees (namely, the computably enumerable Turing degrees), and the same enumeration degrees (namely, the ${\rm{\Pi }}_1^0$ enumeration degrees). Nonetheless, dialectical sets and quasidialectical sets do not coincide. Even restricting our attention to the so-called loopless quasidialectical sets, we show that the quasidialectical sets properly extend the dialectical sets. As both classes consist of ${\rm{\Delta }}_2^0$ sets, the extent to which the two classes differ is conveniently measured using the Ershov hierarchy: indeed, the dialectical sets are ω -computably enumerable (close inspection also shows that there are dialectical sets which do not lie in any finite level; and in every finite level n ≥ 2 of the Ershov hierarchy there is a dialectical set which does not lie in the previous level); on the other hand, the quasidialectical sets spread out throughout all classes of the hierarchy (close inspection shows that for every ordinal notation a of a nonzero computable ordinal, there is a quasidialectical set lying in ${\rm{\Sigma }}_a^{ - 1}$ , but in none of the preceding levels).

Erstellt aus der Publikationsdatenbank der Technischen Universität Wien.