GÖDEL'S INCOMPLETENESS THEOREM AND THE PHILOSOPHY OF OPEN SYSTEMS

, whose main feature is that they are always subject to unanticipated outcomesin their operation and can receive new information from outside at any time [cf. Hewitt 1991]. WhileGodel's incompleteness theorem has been widely used to refute the main contentions of Hilbert'sprogram, it does not seem to have been generally used to point out the inadequacy of a basic ingredientof that program - the concept of formal system as a closed system - and to stress the need to replace itby the concept of formal system as an open system.A partial exception seem to be provided by van Heijenoort who states:"The notion of formal system, introduced by Frege in 1879, had become by then the acceptedstandard of precision in the foundations of mathematics. It seemed to embody the Aristotelian ideal of aperfect deduction from first principles. Godel's results, by showing that mathematics cannot becompletely and consistently formalized in one system, shattered this ideal. The bounds of mathematicscannot be those of one formal system. Since mathematics has often been regarded as the standard ofrational knowledge that other sciences should strive to attain, Godel's theorems seem to acquiresignificance for the whole body of human knowledge; they certainly establish that the old ideal of adeductive system cannot be maintained" [van Heijenoort 1967: 356].Here van Heijenoort rightly points out the impact of Godel's result on the concept of formalsystem as a closed system but does not suggest any alternative to such a concept.In this paper, on the one hand, I want to stress the role of Godel's incompleteness theorem inshowing the inadequacy of the concept of formal system as a closed system, and, on the other hand, Iwant to point out the interest of the concept of formal system as an open system, which is essential bothfor current developments in artificial intelligence and for the emergence of a new paradigm of logic,alternative to mathematical logic:

[1]  F. I. G. RAWLINS Gödel's Theorem , 1960, Nature.

[2]  David Hilbert Neubegründung der Mathematik. Erste Mitteilung , 1922 .

[3]  G. Cambiano Platone e le tecniche , 1971 .

[4]  Jonathan Barnes,et al.  Aristotle's Theory of Demonstration , 1969 .

[5]  Carl Hewitt Metacritique of McDermott and the logicist approach , 1987 .

[6]  Hilary Putnam,et al.  The Philosophy of Mathematics: , 2019, The Mathematical Imagination.

[7]  Paola Mello,et al.  Objects as Communicating Prolog Units , 1987, ECOOP.

[8]  Henry M. Sheffer Principia Mathematica. Whitehead, Alfred North , Russell, Bertrand , 1926 .

[9]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[10]  William F. Clocksin,et al.  Programming in Prolog , 1987, Springer Berlin Heidelberg.

[11]  L. Wittgenstein Tractatus Logico-Philosophicus , 2021, Nordic Wittgenstein Review.

[12]  Solomon Feferman,et al.  Incompleteness along paths in progressions of theories , 1962, Journal of Symbolic Logic.

[13]  P. Bernays,et al.  Grundlagen der Mathematik , 1934 .

[14]  Carl Hewitt,et al.  Open Information Systems Semantics for Distributed Artificial Intelligence , 1991, Artif. Intell..

[15]  Paul Bernays Philosophy of mathematics: On platonism in mathematics , 1984 .

[16]  M. Dummett Frege: Philosophy of Language , 1973 .

[17]  R. H.,et al.  The Principles of Mathematics , 1903, Nature.

[18]  A. R. Turquette,et al.  Logic, Semantics, Metamathematics , 1957 .

[19]  K. Schutte Review: Paul Bernays, Die Philosophie der Mathematik und die Hilbertsche Beweistheorie , 1978 .

[20]  E. Zermelo Über den Begriff der Definitheit in der Axiomatik , .

[21]  Daniel G. Bobrow,et al.  Vulcan: Logical Concurrent Objects , 1987, Research Directions in Object-Oriented Programming.

[22]  F. Ramsey The foundations of mathematics , 1932 .

[23]  Kurt Gödel,et al.  On a hitherto unexploited extension of the finitary standpoint , 1980, J. Philos. Log..

[24]  P. Hertz Über Axiomensysteme für beliebige Satzsysteme , .

[25]  D. Hilbert Die Grundlegung der elementaren Zahlenlehre , 1931 .

[26]  G. B. M. Principia Mathematica , 1911, Nature.

[27]  D. Isaacson,et al.  Arithmetical truth and hidden higher-order concepts , 1985, Logic Colloquium.

[28]  B. Russell,et al.  Principia Mathematica Vol. I , 1910 .

[29]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[30]  Kurt Gödel,et al.  On Formally Undecidable Propositions of Principia Mathematica and Related Systems , 1966 .

[31]  H. Arbeláez,et al.  Korth cm. International business : environment and management. Prentice hall, inc, englewood cliffs, 1985, 2a ed , 1985 .

[32]  Warren D. Goldfarb,et al.  Logic in the twenties: the nature of the quantifier , 1979, Journal of Symbolic Logic.

[33]  J. Heijenoort Begriffsschrift, a formula language, modeled upon that of arithmetic, for pure thought GOTTLOB FREGE(1879) , 1970 .

[34]  K. Gödel Philosophy of mathematics: Russell's mathematical logic , 1984 .

[35]  On Herr Peano's Begriffsschrift and my own , 1969 .

[36]  Gerhard Barth,et al.  Reasoning Objects with Dynamic Knowledge Bases , 1989, EPIA.