The Strong Free Will Theorem John H
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Autonomy and Republicanism: Immanuel Kant's Philosophy of Freedom Author(S): Heiner Bielefeldt Source: Political Theory, Vol
Autonomy and Republicanism: Immanuel Kant's Philosophy of Freedom Author(s): Heiner Bielefeldt Source: Political Theory, Vol. 25, No. 4 (Aug., 1997), pp. 524-558 Published by: Sage Publications, Inc. Stable URL: http://www.jstor.org/stable/191892 Accessed: 25-05-2018 14:18 UTC REFERENCES Linked references are available on JSTOR for this article: http://www.jstor.org/stable/191892?seq=1&cid=pdf-reference#references_tab_contents You may need to log in to JSTOR to access the linked references. JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at http://about.jstor.org/terms Sage Publications, Inc. is collaborating with JSTOR to digitize, preserve and extend access to Political Theory This content downloaded from 81.157.207.121 on Fri, 25 May 2018 14:18:33 UTC All use subject to http://about.jstor.org/terms AUTONOMY AND REPUBLICANISM Immanuel Kant's Philosophy of Freedom HEINER BIELEFELDT University of Bielefeld INTRODUCTION: THE PARADOX OF LIBERALISM Since its origins in early modernity, liberalism has always been a hotly debated issue. A charge frequently brought forward is that liberalism mirrors a lack of ethical substance in modern society, a society which seemingly loses its inner normative cohesiveness and hence can be held together only by a set of abstract procedural rules. -
6.5 the Recursion Theorem
6.5. THE RECURSION THEOREM 417 6.5 The Recursion Theorem The recursion Theorem, due to Kleene, is a fundamental result in recursion theory. Theorem 6.5.1 (Recursion Theorem, Version 1 )Letϕ0,ϕ1,... be any ac- ceptable indexing of the partial recursive functions. For every total recursive function f, there is some n such that ϕn = ϕf(n). The recursion Theorem can be strengthened as follows. Theorem 6.5.2 (Recursion Theorem, Version 2 )Letϕ0,ϕ1,... be any ac- ceptable indexing of the partial recursive functions. There is a total recursive function h such that for all x ∈ N,ifϕx is total, then ϕϕx(h(x)) = ϕh(x). 418 CHAPTER 6. ELEMENTARY RECURSIVE FUNCTION THEORY A third version of the recursion Theorem is given below. Theorem 6.5.3 (Recursion Theorem, Version 3 ) For all n ≥ 1, there is a total recursive function h of n +1 arguments, such that for all x ∈ N,ifϕx is a total recursive function of n +1arguments, then ϕϕx(h(x,x1,...,xn),x1,...,xn) = ϕh(x,x1,...,xn), for all x1,...,xn ∈ N. As a first application of the recursion theorem, we can show that there is an index n such that ϕn is the constant function with output n. Loosely speaking, ϕn prints its own name. Let f be the recursive function such that f(x, y)=x for all x, y ∈ N. 6.5. THE RECURSION THEOREM 419 By the s-m-n Theorem, there is a recursive function g such that ϕg(x)(y)=f(x, y)=x for all x, y ∈ N. -
April 22 7.1 Recursion Theorem
CSE 431 Theory of Computation Spring 2014 Lecture 7: April 22 Lecturer: James R. Lee Scribe: Eric Lei Disclaimer: These notes have not been subjected to the usual scrutiny reserved for formal publications. They may be distributed outside this class only with the permission of the Instructor. An interesting question about Turing machines is whether they can reproduce themselves. A Turing machine cannot be be defined in terms of itself, but can it still somehow print its own source code? The answer to this question is yes, as we will see in the recursion theorem. Afterward we will see some applications of this result. 7.1 Recursion Theorem Our end goal is to have a Turing machine that prints its own source code and operates on it. Last lecture we proved the existence of a Turing machine called SELF that ignores its input and prints its source code. We construct a similar proof for the recursion theorem. We will also need the following lemma proved last lecture. ∗ ∗ Lemma 7.1 There exists a computable function q :Σ ! Σ such that q(w) = hPwi, where Pw is a Turing machine that prints w and hats. Theorem 7.2 (Recursion theorem) Let T be a Turing machine that computes a function t :Σ∗ × Σ∗ ! Σ∗. There exists a Turing machine R that computes a function r :Σ∗ ! Σ∗, where for every w, r(w) = t(hRi; w): The theorem says that for an arbitrary computable function t, there is a Turing machine R that computes t on hRi and some input. Proof: We construct a Turing Machine R in three parts, A, B, and T , where T is given by the statement of the theorem. -
Intuitionism on Gödel's First Incompleteness Theorem
The Yale Undergraduate Research Journal Volume 2 Issue 1 Spring 2021 Article 31 2021 Incomplete? Or Indefinite? Intuitionism on Gödel’s First Incompleteness Theorem Quinn Crawford Yale University Follow this and additional works at: https://elischolar.library.yale.edu/yurj Part of the Mathematics Commons, and the Philosophy Commons Recommended Citation Crawford, Quinn (2021) "Incomplete? Or Indefinite? Intuitionism on Gödel’s First Incompleteness Theorem," The Yale Undergraduate Research Journal: Vol. 2 : Iss. 1 , Article 31. Available at: https://elischolar.library.yale.edu/yurj/vol2/iss1/31 This Article is brought to you for free and open access by EliScholar – A Digital Platform for Scholarly Publishing at Yale. It has been accepted for inclusion in The Yale Undergraduate Research Journal by an authorized editor of EliScholar – A Digital Platform for Scholarly Publishing at Yale. For more information, please contact [email protected]. Incomplete? Or Indefinite? Intuitionism on Gödel’s First Incompleteness Theorem Cover Page Footnote Written for Professor Sun-Joo Shin’s course PHIL 437: Philosophy of Mathematics. This article is available in The Yale Undergraduate Research Journal: https://elischolar.library.yale.edu/yurj/vol2/iss1/ 31 Crawford: Intuitionism on Gödel’s First Incompleteness Theorem Crawford | Philosophy Incomplete? Or Indefinite? Intuitionism on Gödel’s First Incompleteness Theorem By Quinn Crawford1 1Department of Philosophy, Yale University ABSTRACT This paper analyzes two natural-looking arguments that seek to leverage Gödel’s first incompleteness theo- rem for and against intuitionism, concluding in both cases that the argument is unsound because it equivo- cates on the meaning of “proof,” which differs between formalism and intuitionism. -
Chapter 1 Logic and Set Theory
Chapter 1 Logic and Set Theory To criticize mathematics for its abstraction is to miss the point entirely. Abstraction is what makes mathematics work. If you concentrate too closely on too limited an application of a mathematical idea, you rob the mathematician of his most important tools: analogy, generality, and simplicity. – Ian Stewart Does God play dice? The mathematics of chaos In mathematics, a proof is a demonstration that, assuming certain axioms, some statement is necessarily true. That is, a proof is a logical argument, not an empir- ical one. One must demonstrate that a proposition is true in all cases before it is considered a theorem of mathematics. An unproven proposition for which there is some sort of empirical evidence is known as a conjecture. Mathematical logic is the framework upon which rigorous proofs are built. It is the study of the principles and criteria of valid inference and demonstrations. Logicians have analyzed set theory in great details, formulating a collection of axioms that affords a broad enough and strong enough foundation to mathematical reasoning. The standard form of axiomatic set theory is denoted ZFC and it consists of the Zermelo-Fraenkel (ZF) axioms combined with the axiom of choice (C). Each of the axioms included in this theory expresses a property of sets that is widely accepted by mathematicians. It is unfortunately true that careless use of set theory can lead to contradictions. Avoiding such contradictions was one of the original motivations for the axiomatization of set theory. 1 2 CHAPTER 1. LOGIC AND SET THEORY A rigorous analysis of set theory belongs to the foundations of mathematics and mathematical logic. -
Theorem Proving in Classical Logic
MEng Individual Project Imperial College London Department of Computing Theorem Proving in Classical Logic Supervisor: Dr. Steffen van Bakel Author: David Davies Second Marker: Dr. Nicolas Wu June 16, 2021 Abstract It is well known that functional programming and logic are deeply intertwined. This has led to many systems capable of expressing both propositional and first order logic, that also operate as well-typed programs. What currently ties popular theorem provers together is their basis in intuitionistic logic, where one cannot prove the law of the excluded middle, ‘A A’ – that any proposition is either true or false. In classical logic this notion is provable, and the_: corresponding programs turn out to be those with control operators. In this report, we explore and expand upon the research about calculi that correspond with classical logic; and the problems that occur for those relating to first order logic. To see how these calculi behave in practice, we develop and implement functional languages for propositional and first order logic, expressing classical calculi in the setting of a theorem prover, much like Agda and Coq. In the first order language, users are able to define inductive data and record types; importantly, they are able to write computable programs that have a correspondence with classical propositions. Acknowledgements I would like to thank Steffen van Bakel, my supervisor, for his support throughout this project and helping find a topic of study based on my interests, for which I am incredibly grateful. His insight and advice have been invaluable. I would also like to thank my second marker, Nicolas Wu, for introducing me to the world of dependent types, and suggesting useful resources that have aided me greatly during this report. -
Existentialism
TOPIC FOR- SEM- III ( PHIL-CC 10) CONTEMPORARY WESTERN PHILOSOPHY BY- DR. VIJETA SINGH ASSISTANT PROFESSOR P.G. DEPARTMENT OF PHILOSOPHY PATNA UNIVERSITY Existentialism Existentialism is a philosophy that emphasizes individual existence, freedom and choice. It is the view that humans define their own meaning in life, and try to make rational decisions despite existing in an irrational universe. This philosophical theory propounds that people are free agents who have control over their choices and actions. Existentialists believe that society should not restrict an individual's life or actions and that these restrictions inhibit free will and the development of that person's potential. History 1 Existentialism originated with the 19th Century philosopher Soren Kierkegaard and Friedrich Nietzsche, but they did not use the term (existentialism) in their work. In the 1940s and 1950s, French existentialists such as Jean- Paul Sartre , Albert Camus and Simone de Beauvoir wrote scholarly and fictional works that popularized existential themes, such as dread, boredom, alienation, the absurd, freedom, commitment and nothingness. The first existentialist philosopher who adopted the term as a self-description was Sartre. Existentialism as a distinct philosophical and literary movement belongs to the 19th and 20th centuries, but elements of existentialism can be found in the thought (and life) of Socrates, in the Bible, and in the work of many pre-modern philosophers and writers. Noted Existentialists: Soren Kierkegaard (1813-1855) Nationality Denmark Friedrich Nietzsche(1844-1900) Nationality Germany Paul Tillich(1886-1965) Nati…United States, Germany Martin Heidegger ( 1889-1976) Nati…Germany Simone de Beauvior(1908-1986) Nati…France Albert Camus (1913-1960) Nati….France Jean Paul Sartre (1905-1980) Nati….France 2 What does it mean to exist ? To have reason. -
SPINOZA's ETHICS: FREEDOM and DETERMINISM by Alfredo Lucero
SPINOZA’S ETHICS: FREEDOM AND DETERMINISM by Alfredo Lucero-Montaño 1. What remains alive of a philosopher's thought are the realities that concern him, the problems that he addresses, as well as the questions that he poses. The breath and depth of a philosopher's thought is what continues to excite and incite today. However, his answers are limited to his time and circumstances, and these are subject to the historical evolution of thought, yet his principal commitments are based on the problems and questions with which he is concerned. And this is what resounds of a philosopher's thought, which we can theoretically and practically adopt and adapt. Spinoza is immersed in a time of reforms, and he is a revolutionary and a reformer himself. The reforming trend in modern philosophy is expressed in an eminent way by Descartes' philosophy. Descartes, the great restorer of science and metaphysics, had left unfinished the task of a new foundation of ethics. Spinoza was thus faced with this enterprise. But he couldn't carry it out without the conviction of the importance of the ethical problems or that ethics is involved in a fundamental aspect of existence: the moral destiny of man. Spinoza's Ethics[1] is based on a theory of man or, more precisely, on an ontology of man. Ethics is, for him, ontology. He does not approach the problems of morality — the nature of good and evil, why and wherefore of human life — if it is not on the basis of a conception of man's being-in-itself, to wit, that the moral existence of man can only be explained by its own condition. -
On the Mathematical Foundations of Learning
BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 39, Number 1, Pages 1{49 S 0273-0979(01)00923-5 Article electronically published on October 5, 2001 ON THE MATHEMATICAL FOUNDATIONS OF LEARNING FELIPE CUCKER AND STEVE SMALE The problem of learning is arguably at the very core of the problem of intelligence, both biological and artificial. T. Poggio and C.R. Shelton Introduction (1) A main theme of this report is the relationship of approximation to learning and the primary role of sampling (inductive inference). We try to emphasize relations of the theory of learning to the mainstream of mathematics. In particular, there are large roles for probability theory, for algorithms such as least squares,andfor tools and ideas from linear algebra and linear analysis. An advantage of doing this is that communication is facilitated and the power of core mathematics is more easily brought to bear. We illustrate what we mean by learning theory by giving some instances. (a) The understanding of language acquisition by children or the emergence of languages in early human cultures. (b) In Manufacturing Engineering, the design of a new wave of machines is an- ticipated which uses sensors to sample properties of objects before, during, and after treatment. The information gathered from these samples is to be analyzed by the machine to decide how to better deal with new input objects (see [43]). (c) Pattern recognition of objects ranging from handwritten letters of the alpha- bet to pictures of animals, to the human voice. Understanding the laws of learning plays a large role in disciplines such as (Cog- nitive) Psychology, Animal Behavior, Economic Decision Making, all branches of Engineering, Computer Science, and especially the study of human thought pro- cesses (how the brain works). -
Plato on the Foundations of Modern Theorem Provers
The Mathematics Enthusiast Volume 13 Number 3 Number 3 Article 8 8-2016 Plato on the foundations of Modern Theorem Provers Ines Hipolito Follow this and additional works at: https://scholarworks.umt.edu/tme Part of the Mathematics Commons Let us know how access to this document benefits ou.y Recommended Citation Hipolito, Ines (2016) "Plato on the foundations of Modern Theorem Provers," The Mathematics Enthusiast: Vol. 13 : No. 3 , Article 8. Available at: https://scholarworks.umt.edu/tme/vol13/iss3/8 This Article is brought to you for free and open access by ScholarWorks at University of Montana. It has been accepted for inclusion in The Mathematics Enthusiast by an authorized editor of ScholarWorks at University of Montana. For more information, please contact [email protected]. TME, vol. 13, no.3, p.303 Plato on the foundations of Modern Theorem Provers Inês Hipolito1 Nova University of Lisbon Abstract: Is it possible to achieve such a proof that is independent of both acts and dispositions of the human mind? Plato is one of the great contributors to the foundations of mathematics. He discussed, 2400 years ago, the importance of clear and precise definitions as fundamental entities in mathematics, independent of the human mind. In the seventh book of his masterpiece, The Republic, Plato states “arithmetic has a very great and elevating effect, compelling the soul to reason about abstract number, and rebelling against the introduction of visible or tangible objects into the argument” (525c). In the light of this thought, I will discuss the status of mathematical entities in the twentieth first century, an era when it is already possible to demonstrate theorems and construct formal axiomatic derivations of remarkable complexity with artificial intelligent agents the modern theorem provers. -
Nietzsche's Naturalism As a Critique of Morality and Freedom
NIETZSCHE’S NATURALISM AS A CRITIQUE OF MORALITY AND FREEDOM A thesis submitted to Kent State University in partial fulfillment of the requirements for the Degree of Master of Arts by Nathan W. Radcliffe December, 2012 Thesis written by Nathan W. Radcliffe B.S., University of Akron, 1998 M.A., Kent State University, 2012 Approved by Gene Pendleton____________________________________, Advisor David Odell‐Scott___________________________________, Chair, Department of Philosophy Raymond Craig_____________________________________, Dean, College of Arts and Sciences ii TABLE OF CONTENTS ACKNOWLEDGEMENTS....................................................................................................................v INTRODUCTION............................................................................................................................... 1 CHAPTERS I. NIETZSCHE’S NATURALISM AND ITS INFLUENCES....................................................... 8 1.1 Nietzsche’s Speculative‐Methodological Naturalism............................................ 8 1.2 Nietzsche’s Opposition to Materialism ............................................................... 15 1.3 The German Materialist Influence on Nietzsche................................................. 19 1.4 The Influence of Lange on Nietzsche .................................................................. 22 1.5 Nietzsche’s Break with Kant and Its Aftermath................................................... 25 1.6 Influences on Nietzsche’s Fatalism (Schopenhauer and Spinoza) -
Axioms and Theorems for Plane Geometry (Short Version)
Axioms and theorems for plane geometry (Short Version) Basic axioms and theorems Axiom 1. If A; B are distinct points, then there is exactly one line containing both A and B. Axiom 2. AB = BA. Axiom 3. AB = 0 iff A = B. Axiom 4. If point C is between points A and B, then AC + BC = AB. Axiom 5. (The triangle inequality) If C is not between A and B, then AC + BC > AB. ◦ Axiom 6. Part (a): m(\BAC) = 0 iff B; A; C are collinear and A is not between B and C. Part (b): ◦ m(\BAC) = 180 iff B; A; C are collinear and A is between B and C. Axiom 7. Whenever two lines meet to make four angles, the measures of those four angles add up to 360◦. Axiom 8. Suppose that A; B; C are collinear points, with B between A and C, and that X is not collinear with A, B and C. Then m(\AXB) + m(\BXC) = m(\AXC). Moreover, m(\ABX) + m(\XBC) = m(\ABC). Axiom 9. Equals can be substituted for equals. Axiom 10. Given a point P and a line `, there is exactly one line through P parallel to `. Axiom 11. If ` and `0 are parallel lines and m is a line that meets them both, then alternate interior angles have equal measure, as do corresponding angles. Axiom 12. For any positive whole number n, and distinct points A; B, there is some C between A; B such that n · AC = AB. Axiom 13. For any positive whole number n and angle \ABC, there is a point D between A and C such that n · m(\ABD) = m(\ABC).