163 research outputs found

    Busy beavers gone wild

    Full text link
    We show some incompleteness results a la Chaitin using the busy beaver functions. Then, with the help of ordinal logics, we show how to obtain a theory in which the values of the busy beaver functions can be provably established and use this to reveal a structure on the provability of the values of these functions

    Freedom, Anarchy and Conformism in Academic Research

    Get PDF
    In this paper I attempt to make a case for promoting the courage of rebels within the citadels of orthodoxy in academic research environments. Wicksell in Macroeconomics, Brouwer in the Foundations of Mathematics, Turing in Computability Theory, Sraffa in the Theories of Value and Distribution are, in my own fields of research, paradigmatic examples of rebels, adventurers and non-conformists of the highest caliber in scientific research within University environments. In what sense, and how, can such rebels, adventurers and non-conformists be fostered in the current University research environment dominated by the cult of 'picking winners'? This is the motivational question lying behind the historical outlines of the work of Brouwer, Hilbert, Bishop, Veronese, Gödel, Turing and Sraffa that I describe in this paper. The debate between freedom in research and teaching, and the naked imposition of 'correct' thinking, on potential dissenters of the mind, is of serious concern in this age of austerity of material facilities. It is a debate that has occupied some of the finest minds working at the deepest levels of foundational issues in mathematics, metamathematics and economic theory. By making some of the issues explicit, I hope it is possible to encourage dissenters to remain courageous in the face of current dogmasNon-conformist research, economic theory, mathematical economics, 'Hilbert's Dogma', Hilbert's Program, computability theory

    Complete Issue 24, 2001

    Get PDF

    The Wonder of Colors and the Principle of Ariadne

    Get PDF
    The Principle of Ariadne, formulated in 1988 ago by Walter Carnielli and Carlos Di Prisco and later published in 1993, is an infinitary principle that is independent of the Axiom of Choice in ZF, although it can be consistently added to the remaining ZF axioms. The present paper surveys, and motivates, the foundational importance of the Principle of Ariadne and proposes the Ariadne Game, showing that the Principle of Ariadne, corresponds precisely to a winning strategy for the Ariadne Game. Some relations to other alternative. set-theoretical principles are also briefly discussed

    Phase Transitions for Gödel Incompleteness

    Get PDF
    Gödel's first incompleteness result from 1931 states that there are true assertions about the natural numbers which do not follow from the Peano axioms. Since 1931 many researchers have been looking for natural examples of such assertions and breakthroughs have been obtained in the seventies by Jeff Paris (in part jointly with Leo Harrington and Laurie Kirby) and Harvey Friedman who produced first mathematically interesting independence results in Ramsey theory (Paris) and well-order and well-quasi-order theory (Friedman). In this article we investigate Friedman style principles of combinatorial well-foundedness for the ordinals below epsilon_0. These principles state that there is a uniform bound on the length of decreasing sequences of ordinals which satisfy an elementary recursive growth rate condition with respect to their Gödel numbers. For these independence principles we classify (as a part of a general research program) their phase transitions, i.e. we classify exactly the bounding conditions which lead from provability to unprovability in the induced combinatorial well-foundedness principles. As Gödel numbering for ordinals we choose the one which is induced naturally from Gödel's coding of finite sequences from his classical 1931 paper on his incompleteness results. This choice makes the investigation highly non trivial but rewarding and we succeed in our objectives by using an intricate and surprising interplay between analytic combinatorics and the theory of descent recursive functions. For obtaining the required bounds on count functions for ordinals we use a classical 1961 Tauberian theorem by Parameswaran which apparently is far remote from Gödel's theorem

    Axiom of Choice, Maximal Independent Sets, Argumentation and Dialogue Games

    Get PDF
    In this work we investigate infinite structures. We discuss the importance, meaning and temptation of the axiom of choice and equivalent formulations with respect to graph theory, abstract argumentation and dialogue games. Emphasis is put on maximal independent sets in graph theory as well as preferred semantics in abstract argumentation

    Strong Types for Direct Logic

    Get PDF
    This article follows on the introductory article “Direct Logic for Intelligent Applications” [Hewitt 2017a]. Strong Types enable new mathematical theorems to be proved including the Formal Consistency of Mathematics. Also, Strong Types are extremely important in Direct Logic because they block all known paradoxes[Cantini and Bruni 2017]. Blocking known paradoxes makes Direct Logic safer for use in Intelligent Applications by preventing security holes. Inconsistency Robustness is performance of information systems with pervasively inconsistent information. Inconsistency Robustness of the community of professional mathematicians is their performance repeatedly repairing contradictions over the centuries. In the Inconsistency Robustness paradigm, deriving contradictions has been a progressive development and not “game stoppers.” Contradictions can be helpful instead of being something to be “swept under the rug” by denying their existence, which has been repeatedly attempted by authoritarian theoreticians (beginning with some Pythagoreans). Such denial has delayed mathematical development. This article reports how considerations of Inconsistency Robustness have recently influenced the foundations of mathematics for Computer Science continuing a tradition developing the sociological basis for foundations. Mathematics here means the common foundation of all classical mathematical theories from Euclid to the mathematics used to prove Fermat's Last [McLarty 2010]. Direct Logic provides categorical axiomatizations of the Natural Numbers, Real Numbers, Ordinal Numbers, Set Theory, and the Lambda Calculus meaning that up a unique isomorphism there is only one model that satisfies the respective axioms. Good evidence for the consistency Classical Direct Logic derives from how it blocks the known paradoxes of classical mathematics. Humans have spent millennia devising paradoxes for classical mathematics. Having a powerful system like Direct Logic is important in computer science because computers must be able to formalize all logical inferences (including inferences about their own inference processes) without requiring recourse to human intervention. Any inconsistency in Classical Direct Logic would be a potential security hole because it could be used to cause computer systems to adopt invalid conclusions. After [Church 1934], logicians faced the following dilemma: ‱ 1st order theories cannot be powerful lest they fall into inconsistency because of Church’s Paradox. ‱ 2nd order theories contravene the philosophical doctrine that theorems must be computationally enumerable. The above issues can be addressed by requiring Mathematics to be strongly typed using so that: ‱ Mathematics self proves that it is “open” in the sense that theorems are not computationally enumerable. ‱ Mathematics self proves that it is formally consistent. ‱ Strong mathematical theories for Natural Numbers, Ordinals, Set Theory, the Lambda Calculus, Actors, etc. are inferentially decidable, meaning that every true proposition is provable and every proposition is either provable or disprovable. Furthermore, theorems of these theories are not enumerable by a provably total procedure
    • 

    corecore