4-3. Physics ~ Metaphysics. Meta-physics

Size: px
Start display at page:

Download "4-3. Physics ~ Metaphysics. Meta-physics"

Transcription

1 1 4-3 A Brief History of Formal Logic The idea of reducing reasoning to computation in some kind of formal calculus is an old dream. Some trace the idea back to Raymond Lull. Certainly Hobbes made explicit the analogy in the slogan Reason [...] is nothing but Reckoning. This parallel was developed by Leibniz, who envisaged a characteristica universalis (universal language) and a calculus ratiocinator (calculus of reasoning). His idea was that disputes of all kinds, not merely mathematical ones, could be settled if the parties translated their dispute into the characteristica and then simply calculated. Leibniz even made some steps towards realizing this lofty goal, but his work was largely forgotten. Meanwhile, mathematics continued to acquire new symbolisms. It was to be expected that the use of symbolism would eventually extend beyond the subject matter of mathematics, to the reasoning used in mathematics. Boole developed the first really successful formal system for logical and set-theoretic reasoning. What s more, he was one of the first to emphasize the possibility of applying formal calculi to several different situations, and doing calculations according to formal rules without regard to the underlying interpretation. In this way he anticipated important parts of the modern axiomatic method. However Boole s logic was limited to propositional reasoning, and it was not until the much later development of quantifiers that formal logic was ready to be applied to general mathematics. The first systems adequate for this purpose were developed by Frege and Peano. Both were mathematicians, and to some extent they had a common motive of making mathematical reasoning more precise. But there were many contrasts between them. Frege devised his Begriffsschrift ( concept-script or ideography ) for formal logic and mathematics, with the particular aim of carrying through what later became known as the logicist programme. He wanted to prove that not only the reasoning used in mathematics, but the underlying assumptions too, and therefore the whole of mathematics, are just pure logic. This would show that mathematics is analytic, refuting Kant s dictum that it is synthetic a priori. Frege made all his deductions using a precisely defined formal deductive system. For this reason above all others he is nowadays commonly regarded as the founding father of modern logic. Moreover, he independently invented quantifiers, and drew attention to numerous important distinctions. Peano s teaching experience led him to be interested in stating mathematical results and arguments precisely. He developed a formal notation for expressing mathematical propositions, which was rather closer to conventional symbolism than was Frege s concept-script. He was not so interested in a foundational reduction, but concentrated on rewriting mathematics in a formal framework. Together with his colleagues and assistants he published a substantial amount of formalized mathematics: his journal Rivista di Matematica was published from 1891 until However, although he stated mathematical propositions in symbolic form, and seemed to be striving towards a way of transforming assertions by analogy with algebraic equations, he never developed a formal deductive system. Russell had started a similar program to Frege, at first independently, before becoming aware, via Peano, of how much Frege had already done. On studying his works, Russell found a logical inconsistency at the core of Frege s system (the Russell paradox ). The story of how he informed Frege of this just as the second volume of Frege s book was in the press is well-known. Russell developed his own logic, which was distinguished from others by its introduction of the notion of type. His logic combined, to some extent, the notational convenience of Peano s system with the precision and foundational aspirations of Frege s work; moreover it wasn't obviously inconsistent. In their monumental work Principia Mathematica, they began a formal development of mathematics from this basis. Without the flexibility which typelessness allowed, it was no longer possible to derive the existence of an infinite set from logic alone, and a separate Axiom of Infinity needed to be posited (as well as an Axiom of Reducibility, but that was a consequence of the unnecessary complication of ramified types). For this reason, Principia failed to establish the logicist thesis that mathematics is completely reducible to logic. Metaphysics Physics ~ Meta-physics

2 2 20 n n 1 n 1 n n < n A B ( ) (1) x + y = z 2z = x + y + z (2) (1) x + y = z 2z = x + y + z (1) (2) (1) (2) if then a x (paradigmatic scientific question) x x

3 Plato was a prolific writer -- scripting some 650,000 words. His texts, furthermore, represent the only writings from antiquity which have been preserved whole and intact by a single author. In other words, there is no reference to a writing attributed to Plato which we today do not possess. This is rather fortunate. Plato s legacy is a collection of thirty-five Socratic Dialogues and thirteen public letters. Plato s writing style possesses infinite variety and a great command of Greek prose -- perhaps the greatest command of the language from antiquity. His work is often tinged with poetic devices, packed with metaphors (especially from music), while also being manneristic, fluid, interlaced, and full of assonance. Plato appears to give each dialogue a separate treatment, adapting its topic to a collection of specific interlocutors. And yet, all of the dialogues have common threads -- e.g., Sokrates who appears in every work save one. Nevertheless, it must be stressed constantly that Plato, now standing at the head of Western Philosophy, left no clearly articulated, well-rounded philosophical system. He apparently lived by example. Plato indeed shunned a political career and lead a life dedicated to the pursuit of truth while, at the same time, heading a cultic body whose purpose was to produce philosophical statesmen. b theory of causality: formal, material, efficient, and final causes Logic: 1.Categories (10 classifications of terms) 2.On Interpretation (propositions, truth, modality) 3.Prior Analytics (syllogistic logic) 4.Posterior Analytics (scientific method and syllogism) 5.Topics (rules for effective arguments and debate) 6.On Sophistical Refutations (informal fallacies) Physical works: 1.Physics (explains change, motion, void, time) 2.On the Heavens (structure of heaven, earth, elements) 3.On Generation (through combining material constituents) 4.Meteorologics (origin of comets, weather, disasters) Psychological works: 1.On the Soul (explains faculties, senses, mind, imagination) 2.On Memory, Reminiscence, Dreams, and Prophesying Works on natural history: 1.History of Animals (physical/mental qualities, habits) 2.On the parts of Animals 3.On the Movement of Animals 4.On the Progression of Animals 5.On the Generation of Animals 6.Minor treatises 7.Problems Philosophical works:1.metaphysics (substance, cause, form, potentiality) 2.Nicomachean Ethics (soul, happiness, virtue, friendship) 3.Eudemain Ethics 4.Magna Moralia 5.Politics (best states, utopias, constitutions, revolutions) 6.Rhetoric (elements of forensic and political debate) 7.Poetics (tragedy, epic poetry) c MP PM MP PM SM SM MS MS SP SP SP SP 3 AAA AEE AI I AEE AI I AOO IAI IAI EAE EAE OAO EIO EIO EIO EIO

4 rhetoric 17 the ideal of certainty the ideal of rational belief with uncertainty, exemplified by the laws of probability and the laws of nature (Newton s law of gravitation) intellectual interest from a theory of demonstration toward theories of rational belief and rational inference, the mathematics of rationality, the quantitative theories of ideas Galilei ( ), Bacon ( ), Descartes ( ), Hobbes ( ), Pascal ( ), Leibniz ( ), Newton ( ), Locke ( ) Science, mathematics, and philosophy were simply different aspects of a common enterprise of knowledge. 1. The theory of deductive reasoning and demonstration is part of psychology. It should provide part of the law of thought, just as physics provides the laws of motion. 2. The laws of thought have an algebraic structure, just as do the laws of arithmetic or the laws of motion. ( 1 turned out to he false, but 2 to be correct later.) combination (human = rational + animal) Any kind or property that can be the object of scientific knowledge can be analyzed into a combination of simple properties that cannot be further analyzed. This gave rise to the mathematical subject of combinatorics, the study of the numbers of possible combinations satisfying given conditions. Ramon Lull (d. 1315), a Franciscan monk Reasoning can be done by a mechanical process. Reasoning does not proceed by syllogism but by combinatorics. Reasoning is the decomposition and recombination of representations. Hobbes: Reasoning is a psychological process, so that a theory of logical inference should be a theory of the operations of the mind. The theory of reasoning is a theory of appropriate combinations. Descartes method What is clearly and distinctly conceived to be true cannot be false. The separation of thoughts of properties is a perfect indicator of the possible separation of the properties: properties that cannot be conceived of separately are necessarily coextensive, and properties that can be conceived of separately are not necessarily coextensive.

5 5 A genuine recollection of a sequence of clear and distinct ideas cannot be false. 1. Descartes argues that some thoughts, some clear and distinct ideas, are indubitable. 2. He claims that we can know with complete certainty that a benevolent God exists. The binomial theorem Pascal: a systematic connection between the theory of combinations and ordinary algebra (x + y) n Binomial theorem For a positive integral n, the binomial coefficient of x (n - r) y r is exactly the number of ways of choosing r things from n things. In other words, the binomial coefficient is n!/(r!(n - r)!) Use the Binomial Theorem to expand the given expressions: ( x + y 2 ) 5 ( 1 + 1/x ) 6 ( x + 2/x ) 4 Pascal s Triangle: 1 n=0 1 1 n= n= n= n= n= n= Leibniz and the mathematics of reason Gottfried Wilhelm Leibniz (b. 1646, d. 1716) was a German philosopher, mathematician, and logician who is probably most well known for having invented the differential and integral calculus (independently of Sir Isaac Newton). In his correspondence with the leading intellectual and political figures of his era, he discussed mathematics, logic, science, history, law, and theology. Leibniz is known among philosophers for his wide range of thought about fundamental philosophical ideas and principles, including truth, necessary and contingent truths, possible worlds, the principle of sufficient reason (i.e., that nothing occurs without a reason), the principle of pre-established harmony (i.e., that God constructed the universe in such a way that corresponding mental and physical events occur simultaneously), and the principle of noncontradiction (i.e., that any proposition from which a contradiction can be derived is false). Leibniz had a lifelong interest in and pursuit of the idea that the principles of reasoning could be reduced to a formal symbolic system, an algebra or calculus of thought, in which controversy would be settled by calculations. De Arte Combinatoria (1666) He formulated the notion of a decision procedure for logic: a mechanical or algorithmic procedure that will determine whether or not an inference is valid. He even attempted to give such a procedure for the theory of the syllogism. He made clear the notion of an incomplete axiomatic theory. An axiomatic theory is incomplete provided there is some

6 6 sentence in its language that can be neither proved nor disproved from its axioms. He introduced the idea that pieces of language can be coded by abstract symbols, including numbers, and that logical relations among the symbols or numbers. He introduced and furthered the idea that logical relations among propositions have an algebraic structure. He developed the thought that universal subject-predicate propositions do not presuppose the existence of things satisfying their predicate or subject terms. The Laws of Thought Boole s conception of logic Logic consists of a set of laws, Like the laws of physics or the laws of geometry. The laws have an algebraic form. The laws have to do with the correct operation of the mind. The Universe of Discourse: (def.) A field of sets over a nonempty set U is any collection of subsets of U that contain U, contains the complement relative to U of any set it contains, contains the intersection of any two sets it contains, and contains the union of any two sets it contains. The Laws of Boolean Algebra x + y = y + x xy = yx x (y + z) = (xy) + (xz) x + (yz) = (x + y) (x + z) x + 0 = x x1 = x x(1 - x) = 0 and x + (1 - x) = 1 x + (y + z) = (x + y) + z x(yz) = (xy)z not 0 = 1 Every field of sets is a Boolean algebra. Two element Boolean algebra No A are B. AB = 0 All C are B. C(1 - B) = 0 No A are C. AC = 0 George Boole Boole was mainly self-educated. Despite not having an academic degree, he was appointed to the chair of mathematics at Queens College, Cork in He taught there for the rest of his life, gaining a reputation as an outstanding and dedicated teacher. In 1854 he published An investigation into the Laws of Thought, on Which are founded the Mathematical Theories of Logic and Probabilities. Boole approached logic in a new way reducing it to a simple algebra, incorporating logic into mathematics. He pointed out the analogy between algebraic symbols and those that represent logical forms. It began the algebra of logic called Boolean algebra which now finds application in computer construction, switching circuits etc. He also worked on differential equations, the calculus of finite differences and general methods in probability publishing around 50 papers. Boolean algebra has wide applications in the design of modern computers and Boole s work has to be seen as a fundamental step in today's computer revolution. Boole was not primarily concerned with the automation of calculating activities. His motivation for developing the system was to assist in expressing and evaluating the soundness of logical propositions. For example, suppose we have a number of assertions P, Q, R, S, etc. Boole considered the question of what could be said of assertions made by combining these in various ways, e.g. P AND Q AND R, ( P OR S ) AND ( Q OR R ). By considering assertions to by true or false, Boole developed an algebraic calculus to interpret whether composite assertions were true or false in terms of how they composition was formed (i.e. the combination of AND, OR, etc) and the truth or falsity of the atomic assertions. Boole published his work in the mid 19th Century An Investigation of the Laws of Thought, Dover Publications, Inc., 1854 Its importance with respect to computer design was realised in the 20th century when approaches to constructing digital computer were being investigated. Boole s calculus was instrumental in breaking the tradition of reducing computation to addition: the route that had, in effect, dominated the design of automatic calculating machines from Schickard through to Babbage, since by exploiting Boolean algebra and electrical (or electro-mechanical) switching components it became possible to build reasonably reliable systems capable of carrying out complex computing tasks. In 1847 in The Mathematical Analysis of Logic [4] Boole writes that

7 7... the validity of the processes of analysis does not depend upon the interpretation of the symbols which are employed, but solely upon the laws of their combination. Every system of interpretation which does not affect the truth of the relations supposed is equally admissible.

Lecture Notes for MATH Mathematical Logic 1

Lecture Notes for MATH Mathematical Logic 1 Lecture Notes for MATH2040 - Mathematical Logic 1 Michael Rathjen School of Mathematics University of Leeds Autumn 2009 Chapter 0. Introduction Maybe not all areas of human endeavour, but certainly the

More information

The roots of computability theory. September 5, 2016

The roots of computability theory. September 5, 2016 The roots of computability theory September 5, 2016 Algorithms An algorithm for a task or problem is a procedure that, if followed step by step and without any ingenuity, leads to the desired result/solution.

More information

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC 1 Motivation and History The origins of the classical propositional logic, classical propositional calculus, as it was, and still often is called,

More information

The universal computer

The universal computer The universal computer The road from Leibniz to Turing Instructor: Viola Schiaffonati March, 19 th 2018 Thinking, calculating, programming 2 Processing information in an automatic way The birth of computer

More information

The Limit of Humanly Knowable Mathematical Truth

The Limit of Humanly Knowable Mathematical Truth The Limit of Humanly Knowable Mathematical Truth Gödel s Incompleteness Theorems, and Artificial Intelligence Santa Rosa Junior College December 12, 2015 Another title for this talk could be... An Argument

More information

Victoria Gitman and Thomas Johnstone. New York City College of Technology, CUNY

Victoria Gitman and Thomas Johnstone. New York City College of Technology, CUNY Gödel s Proof Victoria Gitman and Thomas Johnstone New York City College of Technology, CUNY vgitman@nylogic.org http://websupport1.citytech.cuny.edu/faculty/vgitman tjohnstone@citytech.cuny.edu March

More information

A FRAGMENT OF BOOLE S ALGEBRAIC LOGIC SUITABLE FOR TRADITIONAL SYLLOGISTIC LOGIC

A FRAGMENT OF BOOLE S ALGEBRAIC LOGIC SUITABLE FOR TRADITIONAL SYLLOGISTIC LOGIC A FRAGMENT OF BOOLE S ALGEBRAIC LOGIC SUITABLE FOR TRADITIONAL SYLLOGISTIC LOGIC STANLEY BURRIS 1. Introduction Boole introduced his agebraic approach to logic in 1847 in an 82 page monograph, The Mathematical

More information

Axiomatic set theory. Chapter Why axiomatic set theory?

Axiomatic set theory. Chapter Why axiomatic set theory? Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its

More information

Proseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1

Proseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1 Propositional Logic: Syntax and Natural Deduction 1 The Plot That Will Unfold I want to provide some key historical and intellectual context to the model theoretic approach to natural language semantics,

More information

Final Exam Extra Credit Opportunity

Final Exam Extra Credit Opportunity Final Exam Extra Credit Opportunity For extra credit, counted toward your final exam grade, you can write a 3-5 page paper on (i) Chapter II, Conceptions in Antiquity, (ii) Chapter V, Newton and Leibniz,

More information

Chapter 2: Introduction to Propositional Logic

Chapter 2: Introduction to Propositional Logic Chapter 2: Introduction to Propositional Logic PART ONE: History and Motivation Origins: Stoic school of philosophy (3rd century B.C.), with the most eminent representative was Chryssipus. Modern Origins:

More information

Leibniz s Possible Worlds. Liu Jingxian Department of Philosophy Peking University

Leibniz s Possible Worlds. Liu Jingxian Department of Philosophy Peking University Leibniz s Possible Worlds Liu Jingxian Department of Philosophy Peking University 1 Contents 1. Leibniz s Motivation 2. Complete Concepts and Possible Individuals 3. Compossibility 3.1. Analytically or

More information

240 Metaphysics. Frege s Puzzle. Chapter 26

240 Metaphysics. Frege s Puzzle. Chapter 26 240 Metaphysics Frege s Puzzle Frege s Puzzle 241 Frege s Puzzle In his 1879 Begriffsschrift (or Concept-Writing ), Gottlob Frege developed a propositional calculus to determine the truth values of propositions

More information

THE LOGIC OF COMPOUND STATEMENTS

THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment

More information

What is logic, the topic of this course? There are at least two answers to that question.

What is logic, the topic of this course? There are at least two answers to that question. Applied Logic Lecture 1 CS 486 Spring 2005 Tuesday, January 25, 2005 What is Logic? What is logic, the topic of this course? There are at least two answers to that question. General logic: critical examination

More information

Paper read at History of Science Society 2014 Annual Meeting, Chicago, Nov. 9,

Paper read at History of Science Society 2014 Annual Meeting, Chicago, Nov. 9, Euler s Mechanics as Opposition to Leibnizian Dynamics 1 Nobumichi ARIGA 2 1. Introduction Leonhard Euler, the notable mathematician in the eighteenth century, is also famous for his contributions to mechanics.

More information

MATH1014 Calculus II. A historical review on Calculus

MATH1014 Calculus II. A historical review on Calculus MATH1014 Calculus II A historical review on Calculus Edmund Y. M. Chiang Department of Mathematics Hong Kong University of Science & Technology September 4, 2015 Instantaneous Velocities Newton s paradox

More information

cse541 LOGIC FOR COMPUTER SCIENCE

cse541 LOGIC FOR COMPUTER SCIENCE cse541 LOGIC FOR COMPUTER SCIENCE Professor Anita Wasilewska Spring 2015 LECTURE 2 Chapter 2 Introduction to Classical Propositional Logic PART 1: Classical Propositional Model Assumptions PART 2: Syntax

More information

GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS. Contents 1. Introduction Gödel s Completeness Theorem

GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS. Contents 1. Introduction Gödel s Completeness Theorem GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS BEN CHAIKEN Abstract. This paper will discuss the completeness and incompleteness theorems of Kurt Gödel. These theorems have a profound impact on the philosophical

More information

Elementary constructions on sets

Elementary constructions on sets I I I : Elementary constructions on sets In this unit we cover the some fundamental constructions of set theory that are used throughout the mathematical sciences. Much of this material is probably extremely

More information

Introduction to Logic and Axiomatic Set Theory

Introduction to Logic and Axiomatic Set Theory Introduction to Logic and Axiomatic Set Theory 1 Introduction In mathematics, we seek absolute rigor in our arguments, and a solid foundation for all of the structures we consider. Here, we will see some

More information

Development of Thought continued. The dispute between rationalism and empiricism concerns the extent to which we

Development of Thought continued. The dispute between rationalism and empiricism concerns the extent to which we Development of Thought continued The dispute between rationalism and empiricism concerns the extent to which we are dependent upon sense experience in our effort to gain knowledge. Rationalists claim that

More information

Boolean Algebra. The Building Blocks of Digital Logic Design. Section. Section Overview. Binary Operations and Their Representation.

Boolean Algebra. The Building Blocks of Digital Logic Design. Section. Section Overview. Binary Operations and Their Representation. Section 3 Boolean Algebra The Building Blocks of Digital Logic Design Section Overview Binary Operations (AND, OR, NOT), Basic laws, Proof by Perfect Induction, De Morgan s Theorem, Canonical and Standard

More information

Introduction to Metalogic

Introduction to Metalogic Introduction to Metalogic Hans Halvorson September 21, 2016 Logical grammar Definition. A propositional signature Σ is a collection of items, which we call propositional constants. Sometimes these propositional

More information

Russell s logicism. Jeff Speaks. September 26, 2007

Russell s logicism. Jeff Speaks. September 26, 2007 Russell s logicism Jeff Speaks September 26, 2007 1 Russell s definition of number............................ 2 2 The idea of reducing one theory to another.................... 4 2.1 Axioms and theories.............................

More information

Philosophy of Mathematics Intuitionism

Philosophy of Mathematics Intuitionism Philosophy of Mathematics Intuitionism Owen Griffiths oeg21@cam.ac.uk St John s College, Cambridge 01/12/15 Classical mathematics Consider the Pythagorean argument that 2 is irrational: 1. Assume that

More information

Logic in Computer Science. Frank Wolter

Logic in Computer Science. Frank Wolter Logic in Computer Science Frank Wolter Meta Information Slides, exercises, and other relevant information are available at: http://www.liv.ac.uk/~frank/teaching/comp118/comp118.html The module has 18 lectures.

More information

The Legacy of Hilbert, Gödel, Gentzen and Turing

The Legacy of Hilbert, Gödel, Gentzen and Turing The Legacy of Hilbert, Gödel, Gentzen and Turing Amílcar Sernadas Departamento de Matemática - Instituto Superior Técnico Security and Quantum Information Group - Instituto de Telecomunicações TULisbon

More information

Class 15: Hilbert and Gödel

Class 15: Hilbert and Gödel Philosophy 405: Knowledge, Truth and Mathematics Spring 2008 M, W: 1-2:15pm Hamilton College Russell Marcus rmarcus1@hamilton.edu I. Hilbert s programme Class 15: Hilbert and Gödel We have seen four different

More information

The Converse of Deducibility: C.I. Lewis and the Origin of Modern AAL/ALC Modal 2011 Logic 1 / 26

The Converse of Deducibility: C.I. Lewis and the Origin of Modern AAL/ALC Modal 2011 Logic 1 / 26 The Converse of Deducibility: C.I. Lewis and the Origin of Modern Modal Logic Edwin Mares Victoria University of Wellington AAL/ALC 2011 The Converse of Deducibility: C.I. Lewis and the Origin of Modern

More information

Models. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation

Models. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation Turing Computation /0/ Models of Computation, Turing Machines, and the Limits of Turing Computation Bruce MacLennan Models A model is a tool intended to address a class of questions about some domain of

More information

Precis of Aristotle s Modal Syllogistic

Precis of Aristotle s Modal Syllogistic Philosophy and Phenomenological Research Philosophy and Phenomenological Research Vol. XC No. 3, May 2015 doi: 10.1111/phpr.12185 2015 Philosophy and Phenomenological Research, LLC Precis of Aristotle

More information

CSCI3390-Lecture 6: An Undecidable Problem

CSCI3390-Lecture 6: An Undecidable Problem CSCI3390-Lecture 6: An Undecidable Problem September 21, 2018 1 Summary The language L T M recognized by the universal Turing machine is not decidable. Thus there is no algorithm that determines, yes or

More information

How Does Mathematics Compare to Other Subjects? Other subjects: Study objects anchored in physical space and time. Acquire and prove knowledge primarily by inductive methods. Have subject specific concepts

More information

Galileo Galilei. Trial of Galileo before the papal court

Galileo Galilei. Trial of Galileo before the papal court Rene Descartes Rene Descartes was a French philosopher who was initially preoccupied with doubt and uncertainty. The one thing he found beyond doubt was his own experience. Emphasizing the importance of

More information

THE SYDNEY SCHOOL AN ARISTOTELIAN REALIST PHILOSOPHY OF MATHEMATICS

THE SYDNEY SCHOOL AN ARISTOTELIAN REALIST PHILOSOPHY OF MATHEMATICS THE SYDNEY SCHOOL AN ARISTOTELIAN REALIST PHILOSOPHY OF MATHEMATICS INTRODUCTION Mathematics is a science of the real world, just as much as biology or sociology are. Where biology studies living things

More information

Mathematical Logic. Introduction to Reasoning and Automated Reasoning. Hilbert-style Propositional Reasoning. Chiara Ghidini. FBK-IRST, Trento, Italy

Mathematical Logic. Introduction to Reasoning and Automated Reasoning. Hilbert-style Propositional Reasoning. Chiara Ghidini. FBK-IRST, Trento, Italy Introduction to Reasoning and Automated Reasoning. Hilbert-style Propositional Reasoning. FBK-IRST, Trento, Italy Deciding logical consequence Problem Is there an algorithm to determine whether a formula

More information

The central problem: what are the objects of geometry? Answer 1: Perceptible objects with shape. Answer 2: Abstractions, mere shapes.

The central problem: what are the objects of geometry? Answer 1: Perceptible objects with shape. Answer 2: Abstractions, mere shapes. The central problem: what are the objects of geometry? Answer 1: Perceptible objects with shape. Answer 2: Abstractions, mere shapes. The central problem: what are the objects of geometry? Answer 1: Perceptible

More information

September 13, Cemela Summer School. Mathematics as language. Fact or Metaphor? John T. Baldwin. Framing the issues. structures and languages

September 13, Cemela Summer School. Mathematics as language. Fact or Metaphor? John T. Baldwin. Framing the issues. structures and languages September 13, 2008 A Language of / for mathematics..., I interpret that mathematics is a language in a particular way, namely as a metaphor. David Pimm, Speaking Mathematically Alternatively Scientists,

More information

Explanation and Argument in Mathematical Practice

Explanation and Argument in Mathematical Practice Explanation and Argument in Mathematical Practice Andrew Aberdein Humanities and Communication, Florida Institute of Technology, 50 West University Blvd, Melbourne, Florida 3290-6975, U.S.A. my.fit.edu/

More information

Geometry and Philosophy

Geometry and Philosophy Geometry and Philosophy Russell Marcus Hamilton College November 2007 Philosophy and Geometry, Slide 1 Plato s Academy Let no one ignorant of geometry enter here Philosophy and Geometry, Slide 2 The Big

More information

Dr Prya Mathew SJCE Mysore

Dr Prya Mathew SJCE Mysore 1 2 3 The word Mathematics derived from two Greek words Manthanein means learning Techne means an art or technique So Mathematics means the art of learning related to disciplines or faculties disciplines

More information

The Arithmetic of Reasoning. Chessa Horomanski & Matt Corson

The Arithmetic of Reasoning. Chessa Horomanski & Matt Corson The Arithmetic of Reasoning LOGIC AND BOOLEAN ALGEBRA Chessa Horomanski & Matt Corson Computers Ask us questions, correct our grammar, calculate our taxes But Misunderstand what we re sure we told them,

More information

Philosophy 5340 Epistemology. Topic 3: Analysis, Analytically Basic Concepts, Direct Acquaintance, and Theoretical Terms. Part 2: Theoretical Terms

Philosophy 5340 Epistemology. Topic 3: Analysis, Analytically Basic Concepts, Direct Acquaintance, and Theoretical Terms. Part 2: Theoretical Terms Philosophy 5340 Epistemology Topic 3: Analysis, Analytically Basic Concepts, Direct Acquaintance, and Theoretical Terms Part 2: Theoretical Terms 1. What Apparatus Is Available for Carrying out Analyses?

More information

HANDOUT AND SET THEORY. Ariyadi Wijaya

HANDOUT AND SET THEORY. Ariyadi Wijaya HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics

More information

Informal Statement Calculus

Informal Statement Calculus FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example

More information

35 Chapter CHAPTER 4: Mathematical Proof

35 Chapter CHAPTER 4: Mathematical Proof 35 Chapter 4 35 CHAPTER 4: Mathematical Proof Faith is different from proof; the one is human, the other is a gift of God. Justus ex fide vivit. It is this faith that God Himself puts into the heart. 21

More information

Hence, the sequence of triangular numbers is given by., the. n th square number, is the sum of the first. S n

Hence, the sequence of triangular numbers is given by., the. n th square number, is the sum of the first. S n Appendix A: The Principle of Mathematical Induction We now present an important deductive method widely used in mathematics: the principle of mathematical induction. First, we provide some historical context

More information

The Search for the Perfect Language

The Search for the Perfect Language The Search for the Perfect Language I'll tell you how the search for certainty led to incompleteness, uncomputability & randomness, and the unexpected result of the search for the perfect language. Bibliography

More information

DEFINITE DESCRIPTIONS: LANGUAGE, LOGIC, AND ELIMINATION

DEFINITE DESCRIPTIONS: LANGUAGE, LOGIC, AND ELIMINATION DEFINITE DESCRIPTIONS: LANGUAGE, LOGIC, AND ELIMINATION NORBERT GRATZL University of Salzburg Abstract Definite descriptions are in the focus of philosophical discussion at least since Russell s famous

More information

Gödel s Incompleteness Theorems

Gödel s Incompleteness Theorems Seminar Report Gödel s Incompleteness Theorems Ahmet Aspir Mark Nardi 28.02.2018 Supervisor: Dr. Georg Moser Abstract Gödel s incompleteness theorems are very fundamental for mathematics and computational

More information

Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due by 11:59 p.m., Tuesday.

Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due by 11:59 p.m., Tuesday. Friday, February 15 Today we will begin Course Notes 3.2: Methods of Proof. Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due

More information

Church s undecidability result

Church s undecidability result Church s undecidability result Alan Turing Birth Centennial Talk at IIT Bombay, Mumbai Joachim Breitner April 21, 2011 Welcome, and thank you for the invitation to speak about Church s lambda calculus

More information

(1.3.1) and in English one says a is an element of M. The statement that a is not an element of M is written as a M

(1.3.1) and in English one says a is an element of M. The statement that a is not an element of M is written as a M 1.3 Set Theory I As long as the terms of a mathematical theory are names of concrete objects as concrete as mothers breast, the very first object that received a name in human languages - there is not

More information

A Little History Incompleteness The First Theorem The Second Theorem Implications. Gödel s Theorem. Anders O.F. Hendrickson

A Little History Incompleteness The First Theorem The Second Theorem Implications. Gödel s Theorem. Anders O.F. Hendrickson Gödel s Theorem Anders O.F. Hendrickson Department of Mathematics and Computer Science Concordia College, Moorhead, MN Math/CS Colloquium, November 15, 2011 Outline 1 A Little History 2 Incompleteness

More information

Mathematical Approach to Vagueness

Mathematical Approach to Vagueness International Mathematical Forum, 2, 2007, no. 33, 1617-1623 Mathematical Approach to Vagueness Angel Garrido Departamento de Matematicas Fundamentales Facultad de Ciencias de la UNED Senda del Rey, 9,

More information

INCOMPLETENESS I by Harvey M. Friedman Distinguished University Professor Mathematics, Philosophy, Computer Science Ohio State University Invitation

INCOMPLETENESS I by Harvey M. Friedman Distinguished University Professor Mathematics, Philosophy, Computer Science Ohio State University Invitation INCOMPLETENESS I by Harvey M. Friedman Distinguished University Professor Mathematics, Philosophy, Computer Science Ohio State University Invitation to Mathematics Series Department of Mathematics Ohio

More information

Lecture 2: What is Proof?

Lecture 2: What is Proof? Lecture 2: What is Proof? Math 295 08/26/16 Webster Proof and Its History 8/2016 1 / 1 Evolution of Proof Proof, a relatively new idea Modern mathematics could not be supported at its foundation, nor construct

More information

Automata Theory. Definition. Computational Complexity Theory. Computability Theory

Automata Theory. Definition. Computational Complexity Theory. Computability Theory Outline THEORY OF COMPUTATION CS363, SJTU What is Theory of Computation? History of Computation Branches and Development Xiaofeng Gao Dept. of Computer Science Shanghai Jiao Tong University 2 The Essential

More information

Towards a Contemporary Ontology

Towards a Contemporary Ontology Towards a Contemporary Ontology The New Dual Paradigm in Natural Sciences: Part I Module 2 Class 3: The issue of the foundations of mathematics Course WI-FI-BASTI1 2014/15 Introduction Class 3: The issue

More information

chapter 12 MORE MATRIX ALGEBRA 12.1 Systems of Linear Equations GOALS

chapter 12 MORE MATRIX ALGEBRA 12.1 Systems of Linear Equations GOALS chapter MORE MATRIX ALGEBRA GOALS In Chapter we studied matrix operations and the algebra of sets and logic. We also made note of the strong resemblance of matrix algebra to elementary algebra. The reader

More information

2. Associative Law: A binary operator * on a set S is said to be associated whenever (A*B)*C = A*(B*C) for all A,B,C S.

2. Associative Law: A binary operator * on a set S is said to be associated whenever (A*B)*C = A*(B*C) for all A,B,C S. BOOLEAN ALGEBRA 2.1 Introduction Binary logic deals with variables that have two discrete values: 1 for TRUE and 0 for FALSE. A simple switching circuit containing active elements such as a diode and transistor

More information

Poincaré, Heisenberg, Gödel. Some limits of scientific knowledge. Fernando Sols Universidad Complutense de Madrid

Poincaré, Heisenberg, Gödel. Some limits of scientific knowledge. Fernando Sols Universidad Complutense de Madrid Poincaré, Heisenberg, Gödel. Some limits of scientific knowledge. Fernando Sols Universidad Complutense de Madrid Henry Poincaré (1854-1912) nonlinear dynamics Werner Heisenberg (1901-1976) uncertainty

More information

Poincaré s Thesis CONTENTS. Peter Fekete

Poincaré s Thesis CONTENTS. Peter Fekete Poincaré s Thesis CONTENTS Peter Fekete COPYWRITE PETER FEKETE 6 TH OCT. 2011 NO PART OF THIS PAPER MAY BE REPRODUCED OR TRANSMITTED IN ANY FORM OR BY ANY MEANS ELECTRONIC OR MECHANICAL, INCLUDING PHOTOCOPY,

More information

Introduction to Metalogic

Introduction to Metalogic Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)

More information

Theory of Languages and Automata

Theory of Languages and Automata Theory of Languages and Automata Chapter 0 - Introduction Sharif University of Technology References Main Reference M. Sipser, Introduction to the Theory of Computation, 3 nd Ed., Cengage Learning, 2013.

More information

To Infinity and Beyond

To Infinity and Beyond To Infinity and Beyond 25 January 2012 To Infinity and Beyond 25 January 2012 1/24 The concept of infinity has both fascinated and frustrated people for millenia. We will discuss some historical problems

More information

Gödel s Incompleteness Theorems by Sally Cockburn (2016)

Gödel s Incompleteness Theorems by Sally Cockburn (2016) Gödel s Incompleteness Theorems by Sally Cockburn (2016) 1 Gödel Numbering We begin with Peano s axioms for the arithmetic of the natural numbers (ie number theory): (1) Zero is a natural number (2) Every

More information

Adequate set of connectives, logic gates and circuits

Adequate set of connectives, logic gates and circuits Adequate set of connectives, logic gates and circuits Lila Kari University of Waterloo Adequate set of connectives, logic gates and circuits CS245, Logic and Computation 1 / 59 Connectives We have mentioned

More information

Exercise Set 2.1. Notes: is equivalent to AND ; both statements must be true for the statement to be true.

Exercise Set 2.1. Notes: is equivalent to AND ; both statements must be true for the statement to be true. Exercise Set 2.1 10) Let p be the statement DATAENDFLAG is off, q the statement ERROR equals 0, and r the statement SUM is less than 1,000. Express the following sentences in symbolic notation. Notes:

More information

The History of Motion. Ms. Thibodeau

The History of Motion. Ms. Thibodeau The History of Motion Ms. Thibodeau Aristotle Aristotle aka the Philosopher was a Greek philosopher more than 2500 years ago. He wrote on many subjects including physics, poetry, music, theater, logic,

More information

Truthmaker Maximalism defended again. Eduardo Barrio and Gonzalo Rodriguez-Pereyra

Truthmaker Maximalism defended again. Eduardo Barrio and Gonzalo Rodriguez-Pereyra 1 Truthmaker Maximalism defended again 1 Eduardo Barrio and Gonzalo Rodriguez-Pereyra 1. Truthmaker Maximalism is the thesis that every truth has a truthmaker. Milne (2005) attempts to refute it using

More information

CISC-102 Fall 2018 Week 11

CISC-102 Fall 2018 Week 11 page! 1 of! 26 CISC-102 Fall 2018 Pascal s Triangle ( ) ( ) An easy ( ) ( way ) to calculate ( ) a table of binomial coefficients was recognized centuries ago by mathematicians in India, ) ( ) China, Iran

More information

Elements of a Bahá í-inspired Natural Theology

Elements of a Bahá í-inspired Natural Theology Elements of a Bahá í-inspired Natural Theology Willliam S. Hatcher Source: The Library. Can be used under terms of the Library s 1 Besides the moral and spiritual teachings they contain, the Bahá í Writings

More information

Beyond Newton and Leibniz: The Making of Modern Calculus. Anthony V. Piccolino, Ed. D. Palm Beach State College Palm Beach Gardens, Florida

Beyond Newton and Leibniz: The Making of Modern Calculus. Anthony V. Piccolino, Ed. D. Palm Beach State College Palm Beach Gardens, Florida Beyond Newton and Leibniz: The Making of Modern Calculus Anthony V. Piccolino, Ed. D. Palm Beach State College Palm Beach Gardens, Florida Calculus Before Newton & Leibniz Four Major Scientific Problems

More information

3 The Semantics of the Propositional Calculus

3 The Semantics of the Propositional Calculus 3 The Semantics of the Propositional Calculus 1. Interpretations Formulas of the propositional calculus express statement forms. In chapter two, we gave informal descriptions of the meanings of the logical

More information

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed

More information

A Structuralist Account of Logic

A Structuralist Account of Logic Croatian Journal of Philosophy Vol. VIII, No. 23, 2008 Majda Trobok, Department of Philosophy University of Rijeka A Structuralist Account of Logic The lynch-pin of the structuralist account of logic endorsed

More information

MODULE- 07 : FLUIDICS AND FLUID LOGIC

MODULE- 07 : FLUIDICS AND FLUID LOGIC MODULE- 07 : FLUIDICS AND FLUID LOGIC LECTURE- 26 : INTRODUCTION TO FLUID LOGIC INTRODUCTION Fluidics (also known as Fluidic logic) is the use of a fluid or compressible medium to perform analog or digital

More information

MATH10040: Chapter 0 Mathematics, Logic and Reasoning

MATH10040: Chapter 0 Mathematics, Logic and Reasoning MATH10040: Chapter 0 Mathematics, Logic and Reasoning 1. What is Mathematics? There is no definitive answer to this question. 1 Indeed, the answer given by a 21st-century mathematician would differ greatly

More information

Handout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte

Handout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte Handout on Logic, Axiomatic Methods, and Proofs MATH 3181 001 Spring 1999 David C. Royster UNC Charlotte January 18, 1999 Chapter 1 Logic and the Axiomatic Method 1.1 Introduction Mathematicians use a

More information

International Journal of Pure and Applied Mathematics Volume 52 No , CONSCIOUSNESS AND CYCLICITY OF THE UNIVERSE

International Journal of Pure and Applied Mathematics Volume 52 No , CONSCIOUSNESS AND CYCLICITY OF THE UNIVERSE International Journal of Pure and Applied Mathematics Volume 52 No. 5 2009, 687-692 CONSCIOUSNESS AND CYCLICITY OF THE UNIVERSE Todor Zh. Mollov Department of Algebra University of Plovdiv Plovdiv, 4000,

More information

Supplementary Logic Notes CSE 321 Winter 2009

Supplementary Logic Notes CSE 321 Winter 2009 1 Propositional Logic Supplementary Logic Notes CSE 321 Winter 2009 1.1 More efficient truth table methods The method of using truth tables to prove facts about propositional formulas can be a very tedious

More information

WHAT THIS BOOK IS ABOUT

WHAT THIS BOOK IS ABOUT Introduction WHAT THIS BOOK IS ABOUT 1. Plus Counting one, two, three, four or uno, dos, tres, cuatro (or in whatever language); or I, II, III, IV or 1, 2, 3, 4, or in whatever symbols is probably the

More information

A Primer on Boole s Algebra of Logic for Classes

A Primer on Boole s Algebra of Logic for Classes Outline The Paradigm Early Insights Boole s Algebra of Classes (Quick Overview) Defining Multiplication Numbers as Classes Schröder s Translations Two Cautions Boole s Equational System Def A B Def A B

More information

Proving Completeness for Nested Sequent Calculi 1

Proving Completeness for Nested Sequent Calculi 1 Proving Completeness for Nested Sequent Calculi 1 Melvin Fitting abstract. Proving the completeness of classical propositional logic by using maximal consistent sets is perhaps the most common method there

More information

Propositional logic (revision) & semantic entailment. p. 1/34

Propositional logic (revision) & semantic entailment. p. 1/34 Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)

More information

Observations on Category Theory. John L. Bell

Observations on Category Theory. John L. Bell Observations on Category Theory John L. Bell 1. Devised by Eilenberg and Mac Lane in the early 1940s, category theory is a presentation of mathematics in terms of the fundamental concepts of transformation,

More information

Modal homotopy type theory: The new new logic

Modal homotopy type theory: The new new logic Modal homotopy type theory: The new new logic David Corfield Philosophy, University of Kent, Canterbury, UK 17 August, 2018 Corfield (Philosophy, Kent) Modal HoTT 17 August, 2018 1 / 30 Philosophy and

More information

-1- THE PROBABILITY THAT TWEETY IS ABLE TO FLY Giangiacomo Gerla Dipartimento di Matematica e Fisica, Università di Camerino ITALY.

-1- THE PROBABILITY THAT TWEETY IS ABLE TO FLY Giangiacomo Gerla Dipartimento di Matematica e Fisica, Università di Camerino ITALY. -1- THE PROBABILITY THAT TWEETY IS ABLE TO FLY Giangiacomo Gerla Dipartimento di Matematica e Fisica, Università di Camerino ITALY. Abstract. Consider the question of assigning a probabilistic valuation

More information

What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos

What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos armandobcm@yahoo.com February 5, 2014 Abstract This note is for personal use. It

More information

PROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL

PROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL THOMAS HOFWEBER PROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL 1. PROOF-THEORETIC REDUCTION AND HILBERT S PROGRAM Hilbert s program in the philosophy of mathematics comes in two parts. One part is a

More information

MODAL LOGIC WITH SUBJUNCTIVE MARKERS: A NEW PERSPECTIVE ON RIGID DESIGNATION

MODAL LOGIC WITH SUBJUNCTIVE MARKERS: A NEW PERSPECTIVE ON RIGID DESIGNATION MODAL LOGIC WITH SUBJUNCTIVE MARKERS: A NEW PERSPECTIVE ON RIGID DESIGNATION Helge Rückert Department of Philosophy University of Saarbrücken, Germany Abstract: According to Kripke

More information

Leibniz and the Discovery of Calculus. The introduction of calculus to the world in the seventeenth century is often associated

Leibniz and the Discovery of Calculus. The introduction of calculus to the world in the seventeenth century is often associated Leibniz and the Discovery of Calculus The introduction of calculus to the world in the seventeenth century is often associated with Isaac Newton, however on the main continent of Europe calculus would

More information

IST 4 Information and Logic

IST 4 Information and Logic IST 4 Information and Logic T = today x= hw#x out x= hw#x due mon tue wed thr fri 30 M1 1 6 oh M1 oh 13 oh 1 oh 2M2M 20 oh oh 2 T Mx= MQx out 27 oh M2 oh oh = office hours 4 3 11 oh 3 4 oh oh midterms

More information

Philosophy of Religion. Notes on Infinity

Philosophy of Religion. Notes on Infinity Notes on Infinity Infinity in Classical and Medieval Philosophy Aristotle (Metaphysics 986 a 22) reports that limited (peras, πέρας) and unlimited or infinite (apeiron, ἄπειρον) occur as the first pairing

More information

Lesson 14: An Axiom System for Geometry

Lesson 14: An Axiom System for Geometry 219 Lesson 14: n xiom System for Geometry We are now ready to present an axiomatic development of geometry. This means that we will list a set of axioms for geometry. These axioms will be simple fundamental

More information

Knowledge, Truth, and Mathematics

Knowledge, Truth, and Mathematics Knowledge, Truth, and Mathematics Philosophy 405 Russell Marcus Hamilton College, Fall 2010 September 27 Class 9: Kant II Marcus, Knowledge, Truth, and Mathematics, Fall 2010 Slide 1 Necessity/Contingency

More information

Experimental logics, mechanism and knowable consistency (SELLC 2010 in Guangzhou, China)

Experimental logics, mechanism and knowable consistency (SELLC 2010 in Guangzhou, China) Experimental logics, mechanism and knowable consistency (SELLC 2010 in Guangzhou, China) Martin Kaså, University of Gothenburg, Sweden Overview In a paper published in 1975, Robert Jeroslow introduced

More information

Manual of Logical Style

Manual of Logical Style Manual of Logical Style Dr. Holmes January 9, 2015 Contents 1 Introduction 2 2 Conjunction 3 2.1 Proving a conjunction...................... 3 2.2 Using a conjunction........................ 3 3 Implication

More information