Trial and error mathematics: Dialectical systems and completions of theories

This paper is part of a project that is based on the notion of a dialectical system, introduced by Magari as a way of capturing trial and error mathematics. In Amidei et al. (2016, Rev. Symb. Logic, 9, 1–26) and Amidei et al. (2016, Rev. Symb. Logic, 9, 299–324), we investigated the expressive and computational power of dialectical systems, and we compared them to a new class of systems, that of quasi-dialectical systems, that enrich Magari’s systems with a natural mechanism of revision. In the present paper we consider a third class of systems, that of p-dialectical systems, that naturally combine features coming from the two other cases. We prove several results about p-dialectical systems and the sets that they represent. Then we focus on the completions of first order theories. In doing so, we consider systems with connectives, i.e. systems that encode the rules of classical logic. We show that any consistent system with connectives represents the completion of a given theory. We prove that dialectical and q-dialectical systems coincide with respect to the completions that they can represent. Yet, p-dialectical systems are more powerful; we exhibit a p-dialectical system representing a completion of Peano Arithmetic that is neither dialectical nor q-dialectical

Analisi e sviluppi della filosofia della matematica di Roberto Magari: algoritmi per tentativi ed errori e piccole probabilità

[Excerpt from the preface]: Questa tesi approfondisce e sviluppa in modo originale due contributi logico-matematici di Roberto Magari, algebrista e componente di quella ristretta cerchia di matematici e di filosofi cui si deve la rinascita della logica matematica nell’Italia dei primi anni sessanta del secolo scorso

Logic and probabilistic systems

3reservedmixedMONTAGNA F; SIMI G; SORBI AMontagna, Franco; Simi, Giulia; Sorbi, Andre