# Al-Sijistani s and Maimonides s Double Negation Theology Explained by Constructive Logic

Size: px
Start display at page:

Download "Al-Sijistani s and Maimonides s Double Negation Theology Explained by Constructive Logic"

Transcription

2 588 O. Kosheleva and V. Kreinovich one cannot say that God is good, but it make sense to say that God is not not-good. Why double negation? The reasoning behind the use of double negation is, to a modern reader, rather obscure and unclear. In this short paper, we will show, however, that the use of double negation can be made much clearer to the modern reader if we take into account the 20 century developments in constructive logic. 2 What Is Constructive Logic: A Reminder Constructivity in mathematics before the 20 century. Strictly speaking, mathematics is about proving results. However, from the ancient times, mathematicians were also interested in constructing objects. The need for constructions is motivated largely by applications. For example, to predict where a satellite will be at some future moment of time, we need to solve the system of differential equations describing the satellite s motion. From the practical viewpoint, it is not enough to prove the existence of the solution, we actually need an algorithm for producing such a solution. Similarly, when we select a control strategy that optimizes our objective function, it is not enough to prove the existence of an optimal strategy, we need to actually construct such a strategy. Need for constructivity has been well understood since the ancient times. For example, Euclid s Elements include not only geometric proofs, but also constructions of different geometric objects [8]. Until the 20 century, once the existence of an object satisfying certain properties was proven, eventually a way was found to construct this object. The resulting construction was sometimes approximate e.g., it turned out that we cannot exactly trisect an angle by using only a compass and a rules, only approximately but it was possible. From this viewpoint, existence and constructibility were viewed as synonyms. This belief was best captured by David Hilbert who, in 1900, was asked, by the world s mathematical community, to select the list of most important mathematical challenges for the 20 century mathematics: In mathematics there is no ignorabimus [12]. 20th century discovery: constructibility is different from existence. The famous Gödel s incompleteness theorem [10] showed that, contrary to Hilbert s expectations, there are mathematical statements about which we cannot tell whether they are true or false. This result lead to the conclusion that in some cases, we can prove the existence of an object, but no algorithm is possible for computing this object;

3 Double negation theology explained by constructive logic 589 see, e.g., the famous Turing s paper [18]. In other words, not everything that can be proven to exist is constructible. Two approaches to dealing with the difference between provable existence and constructibility. Until Gödel s work, the same existential quantifier x P (x) was assumed to mean two (supposedly) equivalent things: provable existence of an object x that satisfies the property P (x), and a possibility to actually construct an object x with this property. Once it was realized that these two notions are different, two approaches emerged: In the traditional mathematical approach, x P (x) is reserved to mean provable existence. In this approach, we need special algorithmic analysis to find out what is computable and what is not. An alternative approach of constructive logic is to use x P (x) to mean that we have a construction for generating an object x that satisfies the property P (x). Constructive logic approach: details. Historically, constructive logic was originated by A. N. Kolmogorov [13]; he called it logic of problems. In this logic, A B means that we know exactly which of the two statements A and B is true. Most statements of constructive logic (except for the simplest ones that do not contain or ) include the existence of some objects. From this viewpoint, the truth of an implication A B not only means that A implies B, it also means that there exists an algorithm that, given an object whose existence is implied by the truth of the statement A, constructs an object whose existence is needed to prove the truth of the statement B and such an algorithm must be explicitly provided. Negation A (as it is often done in logic) is viewed as a particular case of the implication: namely, as an implication A F, where F is a known false statement (e.g., 0 = 1). Constructive logic is different from the classical logic. For example, in classical logic, we have the law of the excluded middle: A A is always true. Because of this, a double negation of each statement A is, in classical logic, simply equivalent to the original statement A. In the constructive logic, this would mean that we know which of the statements A and A is true. Since Gödel proved that it is, in general, not possible to know even for statements of the type n P (n), where n goes over natural numbers and P (n) is an easy-to-test property we thus, in general, do

4 590 O. Kosheleva and V. Kreinovich not have the law of excluded middle. As a result, in constructive logic, double negation A is, in general, different from the original statement A. In constructive logic, we do not have the law of the excluded middle, but what we do have as was already proven in [13] is the double negation of this law, i.e., a statement (A A). Moreover, it has been proven [9] that if instead of the logical operations and, we take their double negations A B def = (A B) and x P (x) def = ( x P (x), then for these new operations and, we have classical logic. Constructive logic approach: successes. Constructive logic has been successfully used to describe what can be computed and constructed and what cannot. This area of research is known as constructive mathematics; see, e.g., [1, 4, 5, 7, 14]. 3 How Constructive Logic Can Explain Double Negation Theology Finite domain vs. infinite domain. The main reason why it is not possible to have an algorithm deciding which mathematical statements are true and which are not is that mathematics deals with infinite domains. If we limit ourselves to a finite domain D, then it is easy to check whether in this domain, a statement like x x D P (x) or x x D P (x): it is sufficient to simply check the corresponding statement P (x) for all finitely many objects x D. In an infinite domain e.g., when D is the set N of all natural numbers such direct checking is not possible. Al-Sijistani s and Maimonides s God as a master of an infinite domain. Where does God fit into this picture? According to both philosophers, God is a master of an infinite domain, he is aware of what is going on in the infinite Universe. Thus, whether we are talking about a set of natural numbers or more complex infinite sets, Al-Sijistani s and Maimonides s God can actually check whether a property P (x) holds for all the objects x from this infinite set. This is the only feature of God that we will use in this explanation; from this viewpoint, Al-Sijistani s and Maimonides s God can be viewed simply as a creature that can check the truth of infinitely many statements in a finite time. All other aspects of God we can, for our purposes, safely ignore. Constructive logic from the viewpoint of Al-Sijistani s and Maimonides s God. To understand God means to view things from God s viewpoint. If we use constructive logic to describe God s viewpoint, then we do have each statement A A true: since, with an ability to check infinitely

5 Double negation theology explained by constructive logic 591 many statements, Al-Sijistani s and Maimonides s God can check, for each statement A, whether this statement is true or its negation A is true. This is possible when A is a statement of the type n P (n), this is possible for more complex statements such as m n P (m, n), etc. Thus, constructibility for this superior creature is equivalent to classical logic, with the law of excluded middle. Resulting explanation to double negation theology. We humans are only capable of making finitely many computational steps in a finite amount of time. Since our ability is thus limited, to describe what is constructible and what is not, we can use constructive logic, with its lack of law of excluded middle. Al-Sijistani s and Maimonides s God is, by definition, a creature who can check infinitely many statements in finite time. As a result, if we want to describe what is constructible for the creature with such ability, then the resulting logic becomes classical logic, with the law of excluded middle. In particular, the fact that the law of excluded middle A A holds in God s constructive logic means that Al-Sijistani s and Maimonides s God is capable, given any arithmetic statement A with any number of quantifiers, to check whether this statement is true or not. Gödel s result shows that, in general, we cannot check this which explains Al-Sijistani s and Maimonides s statement that God is, in general, incomprehensible to us. While (due to our lack of God s infinite abilities) we cannot check which statements are true or not, we can, according to the double negation result, simulate God s constructive logic by interpreting each of the statement with a double negation. This is exactly what Al-Sijistani s and Maimonides s double negation theology suggest. So, constructive logic indeed provides for an explanation of the double negation theology. Beyond the double negation theology. A related logic-related theological idea can be found in Zohar [3], the main book of Kabbalah. According to this book, in Binah (Understanding), one of ten emanations (sefirot) through which God reveals himself, God exists as the great Who who stands at the beginning of each question. This is perfectly in line with the main idea behind Hilbert s epsilon calculus, when we introduce a symbol εx P whose meaning is as follows: if x P (x), then εx P is an object for which the property P (x) is true, i.e., for which P (εx P ); see, e.g., [17]. Of course, this formal idea does not help us actually construct this object in situations when not such construction is possible, but it helps us apply techniques of constructive logic to such situations i.e., in effect, similar to double negation, it helps us apply techniques of constructive logic in situations when usual finite algorithms do not lead to constructions.

6 592 O. Kosheleva and V. Kreinovich Comment. While epsilon calculus is mostly familiar to logicians, many mathematicians are familiar with it via N. Bourbaki s books, where εx P is denoted as τ x (P ) [6]. Acknowledgments. This work was supported in part by the National Science Foundation grants HRD and HRD (Cyber-ShARE Center of Excellence) and DUE References [1] O. Aberth, Computable Calculus, Academic Press, New York, [2] K. Armstrong, A History of God, Gramercy, New York, [3] S. Bar Yohai, Zohar, Vols. 1 23, Kabbalah Publishing, Chicago, Illinois, [4] M. Beeson, Foundations of Constructive Mathematics, Springer Verlag, Heidelberg, [5] E. Bishop and D. Bridges, Constructive Analysis, Springer Verlag, Heidelberg, [6] N. Bourbaki, Theory of Sets, Springer, Berlin, [7] D. Bridges and L. Vita, Techniques of Constructive Analysis, Springer Verlag, Heidelberg, [8] Euclid, Elements, Vols. 1 3, Dover Publications, New York, [9] V. Glivenko, Sur quelques points de la logique de M. Brouwer, Bull. Soc. Math. Belg., 15 (1929), [10] K. Gödel, Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I, Monatshefte für Mathematik und Physik, 38 (1931), , English translation in [11]. [11] K. Gödel, On Formally Undecidable Propositions Of Principia Mathematica And Related Systems, Dover Publ., New York, [12] D. Hilbert, Mathematical problems, lecture delivered before the International Congress of Mathematics in Paris in 1900, Bulletin of the American Mathematical Society, 8 (1902),

7 Double negation theology explained by constructive logic 593 [13] A. Kolmogorov, Zur Deutung der intuitionistischen Logik, Mathematische Zeitschrift, 35 (1932), 58 65, English translation in [16]. [14] B. Kushner, Lectures on Constructive Mathematical Analysis, American Mathematical Society, Providence, Rhode Island, [15] M. Maimonides, The Guide for the Perplexed, Dover Publications, New York, [16] P. Mancosu, From Brouwer to Hilbert. The Debate on the Foundations of Mathematics in the 1920s, Oxford University Press, Oxford, UK, [17] G. Moser and R. Zach, The epsilon calculus and Herbrand complexity, Studia Logica, 82 (2006), [18] A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, 42 (1937), , correction published in 43 (1937), [19] P. E. Walker, The Wellsprings of Wisdom: A Study of Abu Yaqub Al- Sijistani s Kitab Al-Yanabi, Including a Complete English Translation With Commentary and Notes, University of Utah Press, Salt Lake City, Utah, Received: July 12, 2015; Published: October 23, 2015

### Why Rosenzweig-Style Midrashic Approach Makes Rational Sense: A Logical (Spinoza-like) Explanation of a Seemingly Non-logical Approach

International Mathematical Forum, Vol. 8, 2013, no. 36, 1773-1777 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2013.39174 Why Rosenzweig-Style Midrashic Approach Makes Rational Sense: A

### Gödel's incompleteness theorems

Savaş Ali Tokmen Gödel's incompleteness theorems Page 1 / 5 In the twentieth century, mostly because of the different classes of infinity problem introduced by George Cantor (1845-1918), a crisis about

### Brief Remarks on Putnam and Realism in Mathematics * Charles Parsons. Hilary Putnam has through much of his philosophical life meditated on

Version 3.0, 10/26/11. Brief Remarks on Putnam and Realism in Mathematics * Charles Parsons Hilary Putnam has through much of his philosophical life meditated on the notion of realism, what it is, what

Potentialism about set theory Øystein Linnebo University of Oslo SotFoM III, 21 23 September 2015 Øystein Linnebo (University of Oslo) Potentialism about set theory 21 23 September 2015 1 / 23 Open-endedness

### Appeared in: Al-Mukhatabat. A Trilingual Journal For Logic, Epistemology and Analytical Philosophy, Issue 6: April 2013.

Appeared in: Al-Mukhatabat. A Trilingual Journal For Logic, Epistemology and Analytical Philosophy, Issue 6: April 2013. Panu Raatikainen Intuitionistic Logic and Its Philosophy Formally, intuitionistic

### Semantic Entailment and Natural Deduction

Semantic Entailment and Natural Deduction Alice Gao Lecture 6, September 26, 2017 Entailment 1/55 Learning goals Semantic entailment Define semantic entailment. Explain subtleties of semantic entailment.

### Informalizing Formal Logic

Informalizing Formal Logic Antonis Kakas Department of Computer Science, University of Cyprus, Cyprus antonis@ucy.ac.cy Abstract. This paper discusses how the basic notions of formal logic can be expressed

### Complex Philosophy. Carlos Gershenson School of Cognitive and Computer Sciences University of Sussex

Complex Philosophy Carlos Gershenson School of Cognitive and Computer Sciences University of Sussex C.Gershenson@sussex.ac.uk 1. Introduction As science, knowledge, and ideas evolve and are increased and

### Beyond Symbolic Logic

Beyond Symbolic Logic 1. The Problem of Incompleteness: Many believe that mathematics can explain *everything*. Gottlob Frege proposed that ALL truths can be captured in terms of mathematical entities;

### Predicate logic. Miguel Palomino Dpto. Sistemas Informáticos y Computación (UCM) Madrid Spain

Predicate logic Miguel Palomino Dpto. Sistemas Informáticos y Computación (UCM) 28040 Madrid Spain Synonyms. First-order logic. Question 1. Describe this discipline/sub-discipline, and some of its more

### "SED QUIS CUSTODIENT IPSOS CUSTODES?"

"SED QUIS CUSTODIENT IPSOS CUSTODES?" Juvenal, Satires, vi. 347 (quoted in "Oxford English" 1986). Ranulph Glanville Subfaculty of Andragology University of Amsterdam, and School of Architecture Portsmouth

### Constructive Logic, Truth and Warranted Assertibility

Constructive Logic, Truth and Warranted Assertibility Greg Restall Department of Philosophy Macquarie University Version of May 20, 2000....................................................................

### Jaroslav Peregrin * Academy of Sciences & Charles University, Prague, Czech Republic

GÖDEL, TRUTH & PROOF Jaroslav Peregrin * Academy of Sciences & Charles University, Prague, Czech Republic http://jarda.peregrin.cz Abstract: The usual way of interpreting Gödel's (1931) incompleteness

### Class #14: October 13 Gödel s Platonism

Philosophy 405: Knowledge, Truth and Mathematics Fall 2010 Hamilton College Russell Marcus Class #14: October 13 Gödel s Platonism I. The Continuum Hypothesis and Its Independence The continuum problem

### God and Gödel: Gödelian Incompleteness in Mathematics and the Confirmation of Theism

God and Gödel: Gödelian Incompleteness in Mathematics and the Confirmation of Theism James Baird In 1931, Kurt Gödel published his monumental findings on undecidable formulas in formal systems of mathematics.1

### The Gödel Paradox and Wittgenstein s Reasons. 1. The Implausible Wittgenstein. Philosophia Mathematica (2009). Francesco Berto

Philosophia Mathematica (2009). The Gödel Paradox and Wittgenstein s Reasons Francesco Berto An interpretation of Wittgenstein s much criticized remarks on Gödel s First Incompleteness Theorem is provided

### Negative Introspection Is Mysterious

Negative Introspection Is Mysterious Abstract. The paper provides a short argument that negative introspection cannot be algorithmic. This result with respect to a principle of belief fits to what we know

### This is a repository copy of Does = 5? : In Defense of a Near Absurdity.

This is a repository copy of Does 2 + 3 = 5? : In Defense of a Near Absurdity. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/127022/ Version: Accepted Version Article: Leng,

### Presentation to the panel, Does mathematics need new axioms? ASL 2000 meeting, Urbana IL, June 5, 2000 Solomon Feferman

Presentation to the panel, Does mathematics need new axioms? ASL 2000 meeting, Urbana IL, June 5, 2000 Solomon Feferman The point of departure for this panel is a somewhat controversial paper that I published

### Remarks on the philosophy of mathematics (1969) Paul Bernays

Bernays Project: Text No. 26 Remarks on the philosophy of mathematics (1969) Paul Bernays (Bemerkungen zur Philosophie der Mathematik) Translation by: Dirk Schlimm Comments: With corrections by Charles

### Brouwer versus Wittgenstein on the Infinite and the Law of Excluded Middle Rumfitt, Ian

Brouwer versus Wittgenstein on the Infinite and the Law of Excluded Middle Rumfitt, Ian DOI: 10.1163/9789401211949_008 License: None: All rights reserved Document Version Peer reviewed version Citation

### Early Russell on Philosophical Grammar

Early Russell on Philosophical Grammar G. J. Mattey Fall, 2005 / Philosophy 156 Philosophical Grammar The study of grammar, in my opinion, is capable of throwing far more light on philosophical questions

### Can Gödel s Incompleteness Theorem be a Ground for Dialetheism? *

논리연구 20-2(2017) pp. 241-271 Can Gödel s Incompleteness Theorem be a Ground for Dialetheism? * 1) Seungrak Choi Abstract Dialetheism is the view that there exists a true contradiction. This paper ventures

### 2.1 Review. 2.2 Inference and justifications

Applied Logic Lecture 2: Evidence Semantics for Intuitionistic Propositional Logic Formal logic and evidence CS 4860 Fall 2012 Tuesday, August 28, 2012 2.1 Review The purpose of logic is to make reasoning

### Wittgenstein and Gödel: An Attempt to Make Wittgenstein s Objection Reasonable

Wittgenstein and Gödel: An Attempt to Make Wittgenstein s Objection Reasonable Timm Lampert published in Philosophia Mathematica 2017, doi.org/10.1093/philmat/nkx017 Abstract According to some scholars,

### The Failure of Leibniz s Infinite Analysis view of Contingency. Joel Velasco. Stanford University

The Failure of Leibniz s Infinite Analysis view of Contingency Joel Velasco Stanford University Abstract: In this paper, it is argued that Leibniz s view that necessity is grounded in the availability

### TRUTH IN MATHEMATICS. H.G. Dales and G. Oliveri (eds.) (Clarendon: Oxford. 1998, pp. xv, 376, ISBN X) Reviewed by Mark Colyvan

TRUTH IN MATHEMATICS H.G. Dales and G. Oliveri (eds.) (Clarendon: Oxford. 1998, pp. xv, 376, ISBN 0-19-851476-X) Reviewed by Mark Colyvan The question of truth in mathematics has puzzled mathematicians

### Structure and essence: The keys to integrating spirituality and science

Structure and essence: The keys to integrating spirituality and science Copyright c 2001 Paul P. Budnik Jr., All rights reserved Our technical capabilities are increasing at an enormous and unprecedented

### KOLMOGOROV, HEYTING AND GENTZEN ON THE INTUITIONISTIC LOGICAL CONSTANTS

CRÍTICA, Revista Hispanoamericana de Filosofía Vol. XXXII, No. 96 (diciembre 2000): 43 57 KOLMOGOROV, HEYTING AND GENTZEN ON THE INTUITIONISTIC LOGICAL CONSTANTS GUSTAVO FERNÁNDEZ DÍEZ Facultad de Filosofía

### Oxford Scholarship Online Abstracts and Keywords

Oxford Scholarship Online Abstracts and Keywords ISBN 9780198802693 Title The Value of Rationality Author(s) Ralph Wedgwood Book abstract Book keywords Rationality is a central concept for epistemology,

### The Ontological Argument for the existence of God. Pedro M. Guimarães Ferreira S.J. PUC-Rio Boston College, July 13th. 2011

The Ontological Argument for the existence of God Pedro M. Guimarães Ferreira S.J. PUC-Rio Boston College, July 13th. 2011 The ontological argument (henceforth, O.A.) for the existence of God has a long

### Remarks on a Foundationalist Theory of Truth. Anil Gupta University of Pittsburgh

For Philosophy and Phenomenological Research Remarks on a Foundationalist Theory of Truth Anil Gupta University of Pittsburgh I Tim Maudlin s Truth and Paradox offers a theory of truth that arises from

### 6.080 / Great Ideas in Theoretical Computer Science Spring 2008

MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

### AKC Lecture 1 Plato, Penrose, Popper

AKC Lecture 1 Plato, Penrose, Popper E. Brian Davies King s College London November 2011 E.B. Davies (KCL) AKC 1 November 2011 1 / 26 Introduction The problem with philosophical and religious questions

### Rethinking Knowledge: The Heuristic View

http://www.springer.com/gp/book/9783319532363 Carlo Cellucci Rethinking Knowledge: The Heuristic View 1 Preface From its very beginning, philosophy has been viewed as aimed at knowledge and methods to

### The Development of Knowledge and Claims of Truth in the Autobiography In Code. When preparing her project to enter the Esat Young Scientist

Katie Morrison 3/18/11 TEAC 949 The Development of Knowledge and Claims of Truth in the Autobiography In Code Sarah Flannery had the rare experience in this era of producing new mathematical research at

### 6.080 / Great Ideas in Theoretical Computer Science Spring 2008

MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

### First- or Second-Order Logic? Quine, Putnam and the Skolem-paradox *

First- or Second-Order Logic? Quine, Putnam and the Skolem-paradox * András Máté EötvösUniversity Budapest Department of Logic andras.mate@elte.hu The Löwenheim-Skolem theorem has been the earliest of

### Review of Philosophical Logic: An Introduction to Advanced Topics *

Teaching Philosophy 36 (4):420-423 (2013). Review of Philosophical Logic: An Introduction to Advanced Topics * CHAD CARMICHAEL Indiana University Purdue University Indianapolis This book serves as a concise

### Zimmerman, Michael J. Subsidiary Obligation, Philosophical Studies, 50 (1986):

SUBSIDIARY OBLIGATION By: MICHAEL J. ZIMMERMAN Zimmerman, Michael J. Subsidiary Obligation, Philosophical Studies, 50 (1986): 65-75. Made available courtesy of Springer Verlag. The original publication

### ASPECTS OF PROOF IN MATHEMATICS RESEARCH

ASPECTS OF PROOF IN MATHEMATICS RESEARCH Juan Pablo Mejía-Ramos University of Warwick Without having a clear definition of what proof is, mathematicians distinguish proofs from other types of argument.

### THREE LOGICIANS: ARISTOTLE, SACCHERI, FREGE

1 THREE LOGICIANS: ARISTOTLE, SACCHERI, FREGE Acta philosophica, (Roma) 7, 1998, 115-120 Ignacio Angelelli Philosophy Department The University of Texas at Austin Austin, TX, 78712 plac565@utxvms.cc.utexas.edu

### Gödel, Nagel, minds and machines Solomon Feferman Ernest Nagel Lecture, Columbia University September 27, 2007

Gödel, Nagel, minds and machines Solomon Feferman Ernest Nagel Lecture, Columbia University September 27, 2007 Just fifty years ago, Ernest Nagel and Kurt Gödel became involved in a serious imbroglio about

### Intuitive evidence and formal evidence in proof-formation

Intuitive evidence and formal evidence in proof-formation Okada Mitsuhiro Section I. Introduction. I would like to discuss proof formation 1 as a general methodology of sciences and philosophy, with a

### Turing versus Gödel on Computability and the Mind

1 Turing versus Gödel on Computability and the Mind B. Jack Copeland and Oron Shagrir Nowadays the work of Alan Turing and Kurt Gödel rightly takes center stage in discussions of the relationships between

### (Refer Slide Time 03:00)

Artificial Intelligence Prof. Anupam Basu Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 15 Resolution in FOPL In the last lecture we had discussed about

### The Development of Laws of Formal Logic of Aristotle

This paper is dedicated to my unforgettable friend Boris Isaevich Lamdon. The Development of Laws of Formal Logic of Aristotle The essence of formal logic The aim of every science is to discover the laws

### Mathematics. The BIG game Behind the little tricks

Mathematics The BIG game Behind the little tricks Marta Maria Casetti @mmcasetti (She/Her) Hi there! :-) The goal of this talk is to show maths is nothing to fear, but it's a tool to embrace to empower

### Logical Omniscience in the Many Agent Case

Logical Omniscience in the Many Agent Case Rohit Parikh City University of New York July 25, 2007 Abstract: The problem of logical omniscience arises at two levels. One is the individual level, where an

### Does Deduction really rest on a more secure epistemological footing than Induction?

Does Deduction really rest on a more secure epistemological footing than Induction? We argue that, if deduction is taken to at least include classical logic (CL, henceforth), justifying CL - and thus deduction

### Artificial Intelligence Prof. P. Dasgupta Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur

Artificial Intelligence Prof. P. Dasgupta Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture- 10 Inference in First Order Logic I had introduced first order

### A Logical Approach to Metametaphysics

A Logical Approach to Metametaphysics Daniel Durante Departamento de Filosofia UFRN durante10@gmail.com 3º Filomena - 2017 What we take as true commits us. Quine took advantage of this fact to introduce

### Is the law of excluded middle a law of logic?

Is the law of excluded middle a law of logic? Introduction I will conclude that the intuitionist s attempt to rule out the law of excluded middle as a law of logic fails. They do so by appealing to harmony

### Logic, Language, and Computation A Historic Journey

Logic, Language, and Computation A Historic Journey Yuh-Dauh Lyuu ( 呂 ) Department of Computer Science & Information Engineering Department of Finance National Taiwan University July 13, 2007 I have never

### LOGIC AS CALCULUS AND LOGIC AS LANGUAGE

JEAN VAN HEIJENOORT LOGIC AS CALCULUS AND LOGIC AS LANGUAGE Answering SchrSder's criticisms of Begriffsschrift, Frege states that, unlike Boole's, his logic is not a calculus ratiocinator, or not merely

### The way we convince people is generally to refer to sufficiently many things that they already know are correct.

Theorem A Theorem is a valid deduction. One of the key activities in higher mathematics is identifying whether or not a deduction is actually a theorem and then trying to convince other people that you

### Sensitivity hasn t got a Heterogeneity Problem - a Reply to Melchior

DOI 10.1007/s11406-016-9782-z Sensitivity hasn t got a Heterogeneity Problem - a Reply to Melchior Kevin Wallbridge 1 Received: 3 May 2016 / Revised: 7 September 2016 / Accepted: 17 October 2016 # The

### A Judgmental Formulation of Modal Logic

A Judgmental Formulation of Modal Logic Sungwoo Park Pohang University of Science and Technology South Korea Estonian Theory Days Jan 30, 2009 Outline Study of logic Model theory vs Proof theory Classical

### Great Philosophers Bertrand Russell Evening lecture series, Department of Philosophy. Dr. Keith Begley 28/11/2017

Great Philosophers Bertrand Russell Evening lecture series, Department of Philosophy. Dr. Keith Begley kbegley@tcd.ie 28/11/2017 Overview Early Life Education Logicism Russell s Paradox Theory of Descriptions

### Intersubstitutivity Principles and the Generalization Function of Truth. Anil Gupta University of Pittsburgh. Shawn Standefer University of Melbourne

Intersubstitutivity Principles and the Generalization Function of Truth Anil Gupta University of Pittsburgh Shawn Standefer University of Melbourne Abstract We offer a defense of one aspect of Paul Horwich

### Philosophy of Logic and Artificial Intelligence

Philosophy of Logic and Artificial Intelligence Basic Studies in Natural Science 3 rd Semester, Fall 2008 Christos Karavasileiadis Stephan O'Bryan Group 6 / House 13.2 Supervisor: Torben Braüner Content

### Mathematics as we know it has been created and used by

0465037704-01.qxd 8/23/00 9:52 AM Page 1 Introduction: Why Cognitive Science Matters to Mathematics Mathematics as we know it has been created and used by human beings: mathematicians, physicists, computer

### Lecture Notes on Classical Logic

Lecture Notes on Classical Logic 15-317: Constructive Logic William Lovas Lecture 7 September 15, 2009 1 Introduction In this lecture, we design a judgmental formulation of classical logic To gain an intuition,

### Full-Blooded Platonism 1. (Forthcoming in An Historical Introduction to the Philosophy of Mathematics, Bloomsbury Press)

Mark Balaguer Department of Philosophy California State University, Los Angeles Full-Blooded Platonism 1 (Forthcoming in An Historical Introduction to the Philosophy of Mathematics, Bloomsbury Press) In

### Here s a very dumbed down way to understand why Gödel is no threat at all to A.I..

Comments on Godel by Faustus from the Philosophy Forum Here s a very dumbed down way to understand why Gödel is no threat at all to A.I.. All Gödel shows is that try as you might, you can t create any

### Introduction. I. Proof of the Minor Premise ( All reality is completely intelligible )

Philosophical Proof of God: Derived from Principles in Bernard Lonergan s Insight May 2014 Robert J. Spitzer, S.J., Ph.D. Magis Center of Reason and Faith Lonergan s proof may be stated as follows: Introduction

### Introduction To Mathematical Logic, Part I [all Published] By Alonzo CHURCH READ ONLINE

Introduction To Mathematical Logic, Part I [all Published] By Alonzo CHURCH READ ONLINE Introduction to Mathematical Logic. Introduction. Elliott Mendelson Part of Springer Science+Business Media Privacy

### Overview of Today s Lecture

Branden Fitelson Philosophy 12A Notes 1 Overview of Today s Lecture Music: Robin Trower, Daydream (King Biscuit Flower Hour concert, 1977) Administrative Stuff (lots of it) Course Website/Syllabus [i.e.,

### Negative Facts. Negative Facts Kyle Spoor

54 Kyle Spoor Logical Atomism was a view held by many philosophers; Bertrand Russell among them. This theory held that language consists of logical parts which are simplifiable until they can no longer

### Moore on External Relations

Moore on External Relations G. J. Mattey Fall, 2005 / Philosophy 156 The Dogma of Internal Relations Moore claims that there is a dogma held by philosophers such as Bradley and Joachim, that all relations

### Computing Machinery and Intelligence. The Imitation Game. Criticisms of the Game. The Imitation Game. Machines Concerned in the Game

Computing Machinery and Intelligence By: A.M. Turing Andre Shields, Dean Farnsworth The Imitation Game Problem Can Machines Think? How the Game works Played with a man, a woman and and interrogator The

### 15. Russell on definite descriptions

15. Russell on definite descriptions Martín Abreu Zavaleta July 30, 2015 Russell was another top logician and philosopher of his time. Like Frege, Russell got interested in denotational expressions as

### Semantics and the Justification of Deductive Inference

Semantics and the Justification of Deductive Inference Ebba Gullberg ebba.gullberg@philos.umu.se Sten Lindström sten.lindstrom@philos.umu.se Umeå University Abstract Is it possible to give a justification

### Modal Truths from an Analytic-Synthetic Kantian Distinction

Modal Truths from an Analytic-Synthetic Kantian Distinction Francesca Poggiolesi To cite this version: Francesca Poggiolesi. Modal Truths from an Analytic-Synthetic Kantian Distinction. A. Moktefi, L.

### Probability Foundations for Electrical Engineers Prof. Krishna Jagannathan Department of Electrical Engineering Indian Institute of Technology, Madras

Probability Foundations for Electrical Engineers Prof. Krishna Jagannathan Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 1 Introduction Welcome, this is Probability

### Etchemendy, Tarski, and Logical Consequence 1 Jared Bates, University of Missouri Southwest Philosophy Review 15 (1999):

Etchemendy, Tarski, and Logical Consequence 1 Jared Bates, University of Missouri Southwest Philosophy Review 15 (1999): 47 54. Abstract: John Etchemendy (1990) has argued that Tarski's definition of logical

### Concerning the Laws of Contradiction and Excluded Middle by V. J. McGill, Philosophy of Science, Vol. 6, No. 2 (Apr., 1939), pp.

Concerning the Laws of Contradiction and Excluded Middle by V. J. McGill, Philosophy of Science, Vol. 6, No. 2 (Apr., 1939), pp. 196-211 I Tradition usually assigns greater importance to the so-called

### UC Berkeley, Philosophy 142, Spring 2016

Logical Consequence UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane 1 Intuitive characterizations of consequence Modal: It is necessary (or apriori) that, if the premises are true, the conclusion

### KNOWLEDGE AND THE PROBLEM OF LOGICAL OMNISCIENCE

KNOWLEDGE AND THE PROBLEM OF LOGICAL OMNISCIENCE Rohit Parikh Department of Computer Science, Brooklyn College, and Mathematics Department, CUNY Graduate Center 1 The notion of knowledge has recently acquired

### Mathematical Existence and Consistency (1950b) Paul Bernays

Bernays Project: Text No. 19 Mathematical Existence and Consistency (1950b) Paul Bernays (Mathematische Existenz und Widerspruchsfreiheit. In Etudes de Philosophie des sciences en hommage à Ferdinand Gonseth,

### Squeezing arguments. Peter Smith. May 9, 2010

Squeezing arguments Peter Smith May 9, 2010 Many of our concepts are introduced to us via, and seem only to be constrained by, roughand-ready explanations and some sample paradigm positive and negative

### Lecture 9. A summary of scientific methods Realism and Anti-realism

Lecture 9 A summary of scientific methods Realism and Anti-realism A summary of scientific methods and attitudes What is a scientific approach? This question can be answered in a lot of different ways.

### MITOCW 3. V: Recursive Structures and Processes

MITOCW 3. V: Recursive Structures and Processes The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational

### BOOK REVIEWS. About a new solution to the problem of future contingents

Logic and Logical Philosophy Volume 26 (2017), 277 281 DOI: 10.12775/LLP.2016.024 BOOK REVIEWS About a new solution to the problem of future contingents Marcin Tkaczyk, Futura contingentia, Wydawnictwo

### On Infinite Size. Bruno Whittle

To appear in Oxford Studies in Metaphysics On Infinite Size Bruno Whittle Late in the 19th century, Cantor introduced the notion of the power, or the cardinality, of an infinite set. 1 According to Cantor

### Haberdashers Aske s Boys School

1 Haberdashers Aske s Boys School Occasional Papers Series in the Humanities Occasional Paper Number Sixteen Are All Humans Persons? Ashna Ahmad Haberdashers Aske s Girls School March 2018 2 Haberdashers

### In Search of the Ontological Argument. Richard Oxenberg

1 In Search of the Ontological Argument Richard Oxenberg Abstract We can attend to the logic of Anselm's ontological argument, and amuse ourselves for a few hours unraveling its convoluted word-play, or

### Lecture 6. Realism and Anti-realism Kuhn s Philosophy of Science

Lecture 6 Realism and Anti-realism Kuhn s Philosophy of Science Realism and Anti-realism Science and Reality Science ought to describe reality. But what is Reality? Is what we think we see of reality really

### On the Aristotelian Square of Opposition

On the Aristotelian Square of Opposition Dag Westerståhl Göteborg University Abstract A common misunderstanding is that there is something logically amiss with the classical square of opposition, and that

### Philosophy of Mathematics Kant

Philosophy of Mathematics Kant Owen Griffiths oeg21@cam.ac.uk St John s College, Cambridge 20/10/15 Immanuel Kant Born in 1724 in Königsberg, Prussia. Enrolled at the University of Königsberg in 1740 and

### Philosophical Logic. LECTURE SEVEN MICHAELMAS 2017 Dr Maarten Steenhagen

Philosophical Logic LECTURE SEVEN MICHAELMAS 2017 Dr Maarten Steenhagen ms2416@cam.ac.uk Last week Lecture 1: Necessity, Analyticity, and the A Priori Lecture 2: Reference, Description, and Rigid Designation

### Logic and Pragmatics: linear logic for inferential practice

Logic and Pragmatics: linear logic for inferential practice Daniele Porello danieleporello@gmail.com Institute for Logic, Language & Computation (ILLC) University of Amsterdam, Plantage Muidergracht 24

### ON SOPHIE GERMAIN PRIMES

Journal for Algebra and Number Theory Academia Volume 6, Issue 1, August 016, ages 37-41 016 Mili ublications ON SOHIE GERMAIN RIMES 117 Arlozorov street Tel Aviv 609814, Israel Abstract A Sophie Germain

### Chapter 3: More Deductive Reasoning (Symbolic Logic)

Chapter 3: More Deductive Reasoning (Symbolic Logic) There's no easy way to say this, the material you're about to learn in this chapter can be pretty hard for some students. Other students, on the other

### WHAT DOES KRIPKE MEAN BY A PRIORI?

Diametros nr 28 (czerwiec 2011): 1-7 WHAT DOES KRIPKE MEAN BY A PRIORI? Pierre Baumann In Naming and Necessity (1980), Kripke stressed the importance of distinguishing three different pairs of notions:

### Bertrand Russell Proper Names, Adjectives and Verbs 1

Bertrand Russell Proper Names, Adjectives and Verbs 1 Analysis 46 Philosophical grammar can shed light on philosophical questions. Grammatical differences can be used as a source of discovery and a guide

### A presupposition is a precondition of a sentence such that the sentences cannot be

948 words (limit of 1,000) Uli Sauerland Center for General Linguistics Schuetzenstr. 18 10117 Berlin Germany +49-30-20192570 uli@alum.mit.edu PRESUPPOSITION A presupposition is a precondition of a sentence

### Logic for Computer Science - Week 1 Introduction to Informal Logic

Logic for Computer Science - Week 1 Introduction to Informal Logic Ștefan Ciobâcă November 30, 2017 1 Propositions A proposition is a statement that can be true or false. Propositions are sometimes called