# 2.1 Review. 2.2 Inference and justifications

Size: px
Start display at page:

Transcription

1 Applied Logic Lecture 2: Evidence Semantics for Intuitionistic Propositional Logic Formal logic and evidence CS 4860 Fall 2012 Tuesday, August 28, Review The purpose of logic is to make reasoning precise. It helps answer questions like how can we be sure that a given argument is valid? or why should we believe a claim that has been made what evidence do we have for that?. These questions occur in pretty much all scientific disciplines and particularly in mathematics and computer science, where we ask ourselves Why should we trust in a theorem that has been stated?, What is a proof?, How can we be sure that a given piece of software works as intended?, or how can we verify that?. Logic is not the answer itself, but it provides the means to express answers to such questions in a way that there is no more doubt about the validity of an argument. It also provides mechanisms that help finding the answers. In the last two decades theorem provers have found solutions for mathematical problems that could not be solved by humans before. In order to do that, logic must be formulated in a way that a computer can handle it. In this course we will look at a series of increasingly expressive logics from propositional logic all the way to type theory. We will describe the formal language of these logics, ways to describe evidence for arguments and claims, a formal concept of proofs, ways to provide computer assistance for developing proofs, reasons why the formalisms are reliable, and limitations of what can be done with formal logic at all. 2.2 Inference and justifications One of the key issues of logic is separating valid inferences from invalid ones by providing evidence that justifies a claim that has been made. If evidence can be found, the claim can be accepted. Otherwise we better not trust it. In order to accomplish this, logic has to abstract from of the ambiguities of natural language and drop irrelevant details that may distract us from the key arguments or lead us to wrong conclusions. Example 2.1 Here is an example of a simple, but erroneous argument Mammals have hair. Monkeys have hair. Thus monkeys are mammals. While we know that all three propositions are true individually, the argument itself is flawed. If we replace the word monkeys by something else, e.g by teddybears, and keep the rest unchanged we end up with Mammals have hair. Teddybears have hair. Thus teddybears are mammals. which is obviously wrong. Thus in order to reveal the logical structure of the argument, we should replace words that have meaning by abstract symbols, which gives us ((M H) (A H)) (A M) 1

3 Example 2.3 (Evidence in mathematics) Let us look at a few more examples from mathematics, which is a bit more rigorous. (1) What evidence could you give for the proposition 3<4? That is basic mathematics, but what could you do to convince someone who doesn t know that yet? A simple method would be to use boxes, legos or the like, stack 3 and 4 on top of each other and decide which stack is larger. This is pretty convincing since we have a sense of larger and smaller and we know how to count. But obviously it would be a bit tedious to do mathematics that way. That is why mathematicians have tried to reduce arithmetic to very simple concepts that are considered self-explanatory, like counting, and to explain everything else in terms of these concepts. Let us look at some of these concepts and their laws, as they illustrate the principles of evidence construction quite well. (2) Why evidence could you give for 0=0? There is not much that one can say here. It is our fundamental understanding that two identical objects must be equal. That is what equality means. There is no simpler truth than that zero is equal to itself. It is, as we say, self-evident and the only evidence we could provide is stating it is so by definition. In logic, we often call such statements axioms. 3 One cannot prove them but one can give strong reasons why it makes sense to accept them as facts that require no proofs. They cannot be reduced to more primitive facts and thus evidence for their truth cannot be based on anything else but the statements themselves. When we have to deal atomic propositions of that nature we will denote their evidence by a special term axiom. This indicates that the proposition has been postulated as self-evident and cannot be decomposed into simpler propositions. 4. (3) What evidence could you give for 1=1, 2=2, 3=3,...? Are all these equalities self-evident too? There are two problems with that view. First of all that would lead to infinitely many axioms in the theory of arithmetic and usually that is not a good idea. The other problem is what we consider as self-evident and what not? We say that two identical numbers must be equal and there is no doubt about that. But is 1=1, 2=2, 3=3 as immediate as 0=0? Can we always recognize identical numbers? What about = ? While these two numbers are in fact the same, our mind is not able to recognize that immediately. We have to start counting instead and only then we know. So instead of declaring all 3 According to the Merriam-Webster dictionary an axiom is (a) a maxim widely accepted on its intrinsic merit (b) a statement accepted as true as the basis for argument or inference (c) an established rule or principle or a self-evident truth 4 Note that non-atomic propositions like the successor axiom cannot have the term axiom as evidence. Their evidence must be described by a term that respects their internal logical structure. 3

4 these equalities to be axioms, we have to come up with a way to reduce them to something more simple like 0=0. 5. Since dealing with decimals is somewhat complicated, formal arithmetic uses something more simple as foundation. It says, we have the number 0 and the ability to count, which we express by a successor function s. Everything else will be defined in terms of these two components. So decimal numbers are just abbreviations, that is 1 stands for s(0), 2 for s(s(0)), 3 for s(s(s(0))), etc. In order to reduce the above equalities to 0=0 we just need one additional (successor) axiom: For arbitrary numbers x and y s(x)=s(y) holds if x=y, or briefly x=y s(x)=s(y). Then 1=1, which is just short for s(0)=s(0), holds because it follows from 0=0 and an application of the successor axiom and the evidence for 1=1 would be composed from the evidence of the successor law and that of the law 0=0. In the same fashion the justification for 2=2, 3=3, etc. consists of 2, 3,... applications of the successor law to the axiom 0=0, and the evidence is constructed accordingly. 6 (4) Here is a more difficult issue: why do you believe 0 1. That is, why can 0=1 never be true? This doesn t have to do with the meaning of equality itself. Actually, there is no way to prove 0 1. But why do we believe it anyway? What would happen if we would allow 0=1 to be true? If we would accept 0=1, then we would be able to show that all natural numbers are equal and that s just an absurdity. The whole system of arithmetic would collapse. We simply cannot allow 0=1, which means we must postulate 0 1. Although we have no external evidence for 0 being different from 1, we can be sure that one will never be able to find evidence for 0=1. So it is safe to assume 0 1. Here is a related question: why do we believe 0 2, 0 3,...? We cannot reduce these propositions to 0 1 since the left side of the inequality is already zero. 7 So does that mean we have to postulate an infinite number of axioms after all or can we avoid that? If we unfold the decimals we can see that all the above inequalities have something in common. We have zero on the left side and some successor number on the right. So all these formulas can be expressed by a simple generic axiom 0 s(y). 5 Recognizing equality is even more difficult when we deal with real numbers. Given the equality = one will never be able to decide that the two denoted numbers are actually equal as one can always look at only a finite number of digits. Immediately after one has declared the two numbers to be equal one may encounter two different digits in their decimal expansion, which means that the decision was wrong. Dealing with the equation = appears to be even worse but is equally difficult. In both situations one can only give a definite answer if the two numbers are distinct. 6 In the early days most logic-based systems actually based their arithmetic entirely on the successor notation, as the decimal system requires extra-logical mechanisms that are difficult to embed into a clean logical formalism. The Coq system, a sister system of our Nuprl system, went that path. Nuprl, however, focused on practical applications where using only the successor notation is infeasible and introduced addition, multiplication and decimal numbers as basic components of the logic. The Coq system finally adopted that approach, while others, like Agda, emphasize logical purity. 7 Actually, in the ring of numbers modulo 2, 0 1 holds but 0 2 doesn t, in the ring of numbers modulo and 0 2 hold and 0 3 doesn t, etc. 4

5 (5) Given all we know so far, how would you show 1 2 or 2 3? Unfortunately, the successor law that we have so far doesn t help that much, since it is only good for showing that 1=2 would hold if 0=1. What we need, is an implication in the other direction which would allow us to prove that 0=1 would hold if 1=2 does. Then, since 0 1 is an axiom, 1=2 cannot hold. To fill that gap, formal arithmetic has formulated the inverse of the successor law: if two successors are equal, then so must be the original numbers. The rationale is that counting forwards can be undone and if we do so we arrive where we started. s(x)=s(y) x=y. Using the inverse successor law we can reduce all kinds of inequalities between (different) natural numbers to the axiom 0 s(y). To prove 2 7, for instance, we only have to apply the law twice to 0 5. (6) Given all that, how would you show that any two numbers are either equal or different? You could again say they have to be but that wouldn t give us any evidence. In the previous examples we have implictly used an algorithm for checking the equality of inequality of arbitrary numbers. Given two numbers x and y we reduce the equation x=y using the inverse successor law until one of the numbers is zero. If the other one is zero as well, then the two numbers are equal and otherwise different. So the evidence for the claim would be the algorithm that on input x and y decides whether the two numbers are equal or not and constructs the specific evidence accordingly. As you see, even in simple arithmetic there are a lot of questions that need to be dealt with when we try to be precise about what we know. These questions have motivated the waw how arithmetic was eventually formalized. We have seen that some facts have to be considered self-evident and that other seemingly selfevident facts can be reduced to more primitive ones. Finally evidence may also come in the form of an algorithm that computes specific evidence for any given input. Although we tried to be fairly precise in the previous examples, our description of evidence still involved a bit of handwaving. If we want to be sure that the evidence actually proves a statement, we need to become more formal. This means we have to introduce a formal language for expressing statements, a formal language for expressing evidence, and a calculus that links formal evidence to formal logical propositions. 2.3 Propositional logic Most of you have probably seen logical symbols before. Mathematicians like to use them for abbreviation purposes and formal logic just goes one step further. It tries to express everything in terms of some formal language in order eliminate ambiguities and to allow logical expressions to be processed by a machine. Describing the formal language of logic is like describing a programming language. One has to agree on what symbols and keyworks are allowed to be used, how formal mathematical sentences have to be formed from smaller components, and what the precise meaning of the formal sentences shall be. 5

6 For now we stick to the simplest form of logic called propositional logic. This logic handles only the most primitive relations between formulas implication, consjunction, disjunction, and negation. Everything else will have to be expressed by propositions or, to be precise, by propositional variables. This means that all the internals of such a proposition will not be visible. Different primitive propositions like 0 1 and 0 2 will be represented by two different propositional variables A and B and the symbol will not tell us that they have anything in common. We will also not be able to use a parametric proposition for 0 s(x) this is the realm of first-order logic. The only commonalities we will be able to describe is that a primitive proposition occurs several times in a compound formula. Propositional logic allows only a very coarse analysis of statements and logical arguments. But it already provides deep insights into the fundamental structures of logical reasoning. More elaborate logics like first-order or higher-order logics have to respect these structures and only provide additional mechanisms for handling the finer details. In the literature there is a variety of notations for logical symbols. We shall use the following symbols for logical connectives: negation (read not ), implication ( implies ), conjunction ( and ), and disjunction ( or ). 8. We use the symbols P, Q, R, P o, Q 0, R 0, P 1, Q 1, R 1,... as names for propositional variables and parentheses (, ) as as delimiters. Definition 2.4 (Syntax of propositional logic) The formulas of propositional logic are recursively defined as follows (1) Every propositional variable is a formula. (2) If A is a formula then so is A. (3) If A and B are formulas then so are (A B), (A B), and (A B). In the above definition definition, the symbols A and B are placeholders for arbitrary formulas but they are not formulas themselves (A and B are not included in our list of symbols). In an implementation of propositional logic as recursive data type A and B they would serve as implementation variables. Therefore, they are often called meta-variables but it is sufficient to view them as slots for the real formulas. Since our definition does not give preference rules that would permit us to drop parentheses, parentheses should always be used to avoid ambiguities. Outer parentheses may be omitted. The meaning of propositional formulas is clear from our intuitive understanding of the words not, implies, and, and or, although there is a certain amount of inconsistency in how these words are actually used. This enables us to translate informal or mathematical text into a representation in propositional logic. Example 2.5 (Formalization) Formalize the following statements as formulas in propositional logic (1) If there is a snowstorm then roads will be closed. The roads are open. Thus there can t be a snowstorm. Using memnonic symbols the formalization would be ((S C) (O (O C))) S. If we restrict ourselves to the permitted symbols, we get ((P Q) (R (R Q))) P 8 The book of Smullyan uses for negation and for implication. Prof. Constable prefers for negation and & for conjunction. Our notation is based on the one used in the Nuprl proof development system. 6

7 (2) If there is a snowstorm then roads will be closed. There is no snowstorm. Hence the roads must be open. ((P Q) ( P (Q R))) R (3) If there can t be no snowstorm then there is one. P P (4) This sentence is true Can t be expressed in propositional logic or in first-order logic 7

### Artificial Intelligence: Valid Arguments and Proof Systems. Prof. Deepak Khemani. Department of Computer Science and Engineering

Artificial Intelligence: Valid Arguments and Proof Systems Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras Module 02 Lecture - 03 So in the last

### Logic & Proofs. Chapter 3 Content. Sentential Logic Semantics. Contents: Studying this chapter will enable you to:

Sentential Logic Semantics Contents: Truth-Value Assignments and Truth-Functions Truth-Value Assignments Truth-Functions Introduction to the TruthLab Truth-Definition Logical Notions Truth-Trees Studying

### 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

### INTERMEDIATE LOGIC Glossary of key terms

1 GLOSSARY INTERMEDIATE LOGIC BY JAMES B. NANCE INTERMEDIATE LOGIC Glossary of key terms This glossary includes terms that are defined in the text in the lesson and on the page noted. It does not include

### Ayer on the criterion of verifiability

Ayer on the criterion of verifiability November 19, 2004 1 The critique of metaphysics............................. 1 2 Observation statements............................... 2 3 In principle verifiability...............................

### Day 3. Wednesday May 23, Learn the basic building blocks of proofs (specifically, direct proofs)

Day 3 Wednesday May 23, 2012 Objectives: Learn the basics of Propositional Logic Learn the basic building blocks of proofs (specifically, direct proofs) 1 Propositional Logic Today we introduce the concepts

### 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.

### Now consider a verb - like is pretty. Does this also stand for something?

Kripkenstein The rule-following paradox is a paradox about how it is possible for us to mean anything by the words of our language. More precisely, it is an argument which seems to show that it is impossible

### What are Truth-Tables and What Are They For?

PY114: Work Obscenely Hard Week 9 (Meeting 7) 30 November, 2010 What are Truth-Tables and What Are They For? 0. Business Matters: The last marked homework of term will be due on Monday, 6 December, at

### Verificationism. PHIL September 27, 2011

Verificationism PHIL 83104 September 27, 2011 1. The critique of metaphysics... 1 2. Observation statements... 2 3. In principle verifiability... 3 4. Strong verifiability... 3 4.1. Conclusive verifiability

### A BRIEF INTRODUCTION TO LOGIC FOR METAPHYSICIANS

A BRIEF INTRODUCTION TO LOGIC FOR METAPHYSICIANS 0. Logic, Probability, and Formal Structure Logic is often divided into two distinct areas, inductive logic and deductive logic. Inductive logic is concerned

### 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

### (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

### 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- 9 First Order Logic In the last class, we had seen we have studied

### 1. Lukasiewicz s Logic

Bulletin of the Section of Logic Volume 29/3 (2000), pp. 115 124 Dale Jacquette AN INTERNAL DETERMINACY METATHEOREM FOR LUKASIEWICZ S AUSSAGENKALKÜLS Abstract An internal determinacy metatheorem is proved

### 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

### International Phenomenological Society

International Phenomenological Society The Semantic Conception of Truth: and the Foundations of Semantics Author(s): Alfred Tarski Source: Philosophy and Phenomenological Research, Vol. 4, No. 3 (Mar.,

### A Liar Paradox. Richard G. Heck, Jr. Brown University

A Liar Paradox Richard G. Heck, Jr. Brown University It is widely supposed nowadays that, whatever the right theory of truth may be, it needs to satisfy a principle sometimes known as transparency : Any

### 9 Knowledge-Based Systems

9 Knowledge-Based Systems Throughout this book, we have insisted that intelligent behavior in people is often conditioned by knowledge. A person will say a certain something about the movie 2001 because

### HANDBOOK (New or substantially modified material appears in boxes.)

1 HANDBOOK (New or substantially modified material appears in boxes.) I. ARGUMENT RECOGNITION Important Concepts An argument is a unit of reasoning that attempts to prove that a certain idea is true by

### 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

### Logicola Truth Evaluation Exercises

Logicola Truth Evaluation Exercises The Logicola exercises for Ch. 6.3 concern truth evaluations, and in 6.4 this complicated to include unknown evaluations. I wanted to say a couple of things for those

### Semantic Foundations for Deductive Methods

Semantic Foundations for Deductive Methods delineating the scope of deductive reason Roger Bishop Jones Abstract. The scope of deductive reason is considered. First a connection is discussed between the

### 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.

### Logic I or Moving in on the Monkey & Bananas Problem

Logic I or Moving in on the Monkey & Bananas Problem We said that an agent receives percepts from its environment, and performs actions on that environment; and that the action sequence can be based on

### 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

### Introduction Symbolic Logic

An Introduction to Symbolic Logic Copyright 2006 by Terence Parsons all rights reserved CONTENTS Chapter One Sentential Logic with 'if' and 'not' 1 SYMBOLIC NOTATION 2 MEANINGS OF THE SYMBOLIC NOTATION

### Philosophy of Mathematics Nominalism

Philosophy of Mathematics Nominalism Owen Griffiths oeg21@cam.ac.uk Churchill and Newnham, Cambridge 8/11/18 Last week Ante rem structuralism accepts mathematical structures as Platonic universals. We

### 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,

### Grade 6 correlated to Illinois Learning Standards for Mathematics

STATE Goal 6: Demonstrate and apply a knowledge and sense of numbers, including numeration and operations (addition, subtraction, multiplication, division), patterns, ratios and proportions. A. Demonstrate

### 15 Does God have a Nature?

15 Does God have a Nature? 15.1 Plantinga s Question So far I have argued for a theory of creation and the use of mathematical ways of thinking that help us to locate God. The question becomes how can

### TWO VERSIONS OF HUME S LAW

DISCUSSION NOTE BY CAMPBELL BROWN JOURNAL OF ETHICS & SOCIAL PHILOSOPHY DISCUSSION NOTE MAY 2015 URL: WWW.JESP.ORG COPYRIGHT CAMPBELL BROWN 2015 Two Versions of Hume s Law MORAL CONCLUSIONS CANNOT VALIDLY

### On the hard problem of consciousness: Why is physics not enough?

On the hard problem of consciousness: Why is physics not enough? Hrvoje Nikolić Theoretical Physics Division, Rudjer Bošković Institute, P.O.B. 180, HR-10002 Zagreb, Croatia e-mail: hnikolic@irb.hr Abstract

### 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

### 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

### All They Know: A Study in Multi-Agent Autoepistemic Reasoning

All They Know: A Study in Multi-Agent Autoepistemic Reasoning PRELIMINARY REPORT Gerhard Lakemeyer Institute of Computer Science III University of Bonn Romerstr. 164 5300 Bonn 1, Germany gerhard@cs.uni-bonn.de

### HANDBOOK. IV. Argument Construction Determine the Ultimate Conclusion Construct the Chain of Reasoning Communicate the Argument 13

1 HANDBOOK TABLE OF CONTENTS I. Argument Recognition 2 II. Argument Analysis 3 1. Identify Important Ideas 3 2. Identify Argumentative Role of These Ideas 4 3. Identify Inferences 5 4. Reconstruct the

### Module 5. Knowledge Representation and Logic (Propositional Logic) Version 2 CSE IIT, Kharagpur

Module 5 Knowledge Representation and Logic (Propositional Logic) Lesson 12 Propositional Logic inference rules 5.5 Rules of Inference Here are some examples of sound rules of inference. Each can be shown

### What would count as Ibn Sīnā (11th century Persia) having first order logic?

1 2 What would count as Ibn Sīnā (11th century Persia) having first order logic? Wilfrid Hodges Herons Brook, Sticklepath, Okehampton March 2012 http://wilfridhodges.co.uk Ibn Sina, 980 1037 3 4 Ibn Sīnā

### Logic: A Brief Introduction

Logic: A Brief Introduction Ronald L. Hall, Stetson University PART III - Symbolic Logic Chapter 7 - Sentential Propositions 7.1 Introduction What has been made abundantly clear in the previous discussion

### PHI2391: Logical Empiricism I 8.0

1 2 3 4 5 PHI2391: Logical Empiricism I 8.0 Hume and Kant! Remember Hume s question:! Are we rationally justified in inferring causes from experimental observations?! Kant s answer: we can give a transcendental

### Exposition of Symbolic Logic with Kalish-Montague derivations

An Exposition of Symbolic Logic with Kalish-Montague derivations Copyright 2006-13 by Terence Parsons all rights reserved Aug 2013 Preface The system of logic used here is essentially that of Kalish &

### Artificial Intelligence. Clause Form and The Resolution Rule. Prof. Deepak Khemani. Department of Computer Science and Engineering

Artificial Intelligence Clause Form and The Resolution Rule Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras Module 07 Lecture 03 Okay so we are

### 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

### KANT S EXPLANATION OF THE NECESSITY OF GEOMETRICAL TRUTHS. John Watling

KANT S EXPLANATION OF THE NECESSITY OF GEOMETRICAL TRUTHS John Watling Kant was an idealist. His idealism was in some ways, it is true, less extreme than that of Berkeley. He distinguished his own by calling

### 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

### Since Michael so neatly summarized his objections in the form of three questions, all I need to do now is to answer these questions.

Replies to Michael Kremer Since Michael so neatly summarized his objections in the form of three questions, all I need to do now is to answer these questions. First, is existence really not essential by

### G. H. von Wright Deontic Logic

G. H. von Wright Deontic Logic Kian Mintz-Woo University of Amsterdam January 9, 2009 January 9, 2009 Logic of Norms 2010 1/17 INTRODUCTION In von Wright s 1951 formulation, deontic logic is intended to

### PART III - Symbolic Logic Chapter 7 - Sentential Propositions

Logic: A Brief Introduction Ronald L. Hall, Stetson University 7.1 Introduction PART III - Symbolic Logic Chapter 7 - Sentential Propositions What has been made abundantly clear in the previous discussion

### What is the Nature of Logic? Judy Pelham Philosophy, York University, Canada July 16, 2013 Pan-Hellenic Logic Symposium Athens, Greece

What is the Nature of Logic? Judy Pelham Philosophy, York University, Canada July 16, 2013 Pan-Hellenic Logic Symposium Athens, Greece Outline of this Talk 1. What is the nature of logic? Some history

### 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

### Chapter 1. Introduction. 1.1 Deductive and Plausible Reasoning Strong Syllogism

Contents 1 Introduction 3 1.1 Deductive and Plausible Reasoning................... 3 1.1.1 Strong Syllogism......................... 3 1.1.2 Weak Syllogism.......................... 4 1.1.3 Transitivity

### HANDBOOK (New or substantially modified material appears in boxes.)

1 HANDBOOK (New or substantially modified material appears in boxes.) I. ARGUMENT RECOGNITION Important Concepts An argument is a unit of reasoning that attempts to prove that a certain idea is true by

### Verification and Validation

2012-2013 Verification and Validation Part III : Proof-based Verification Burkhart Wolff Département Informatique Université Paris-Sud / Orsay " Now, can we build a Logic for Programs??? 05/11/14 B. Wolff

### 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

### 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;

### 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

### A. Problem set #3 it has been posted and is due Tuesday, 15 November

Lecture 9: Propositional Logic I Philosophy 130 1 & 3 November 2016 O Rourke & Gibson I. Administrative A. Problem set #3 it has been posted and is due Tuesday, 15 November B. I am working on the group

### Can Negation be Defined in Terms of Incompatibility?

Can Negation be Defined in Terms of Incompatibility? Nils Kurbis 1 Abstract Every theory needs primitives. A primitive is a term that is not defined any further, but is used to define others. Thus primitives

### From Necessary Truth to Necessary Existence

Prequel for Section 4.2 of Defending the Correspondence Theory Published by PJP VII, 1 From Necessary Truth to Necessary Existence Abstract I introduce new details in an argument for necessarily existing

### Lecture 3. I argued in the previous lecture for a relationist solution to Frege's puzzle, one which

1 Lecture 3 I argued in the previous lecture for a relationist solution to Frege's puzzle, one which posits a semantic difference between the pairs of names 'Cicero', 'Cicero' and 'Cicero', 'Tully' even

### CHAPTER 1 A PROPOSITIONAL THEORY OF ASSERTIVE ILLOCUTIONARY ARGUMENTS OCTOBER 2017

CHAPTER 1 A PROPOSITIONAL THEORY OF ASSERTIVE ILLOCUTIONARY ARGUMENTS OCTOBER 2017 Man possesses the capacity of constructing languages, in which every sense can be expressed, without having an idea how

### Difference between Science and Religion? - A Superficial, yet Tragi-Comic Misunderstanding

Scientific God Journal November 2012 Volume 3 Issue 10 pp. 955-960 955 Difference between Science and Religion? - A Superficial, yet Tragi-Comic Misunderstanding Essay Elemér E. Rosinger 1 Department of

### Natural Deduction for Sentence Logic

Natural Deduction for Sentence Logic Derived Rules and Derivations without Premises We will pursue the obvious strategy of getting the conclusion by constructing a subderivation from the assumption of

### 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

### The Appeal to Reason. Introductory Logic pt. 1

The Appeal to Reason Introductory Logic pt. 1 Argument vs. Argumentation The difference is important as demonstrated by these famous philosophers. The Origins of Logic: (highlights) Aristotle (385-322

### 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,

Comments on Ontological Anti-Realism Cian Dorr INPC 2007 In 1950, Quine inaugurated a strange new way of talking about philosophy. The hallmark of this approach is a propensity to take ordinary colloquial

### Maudlin s Truth and Paradox Hartry Field

Maudlin s Truth and Paradox Hartry Field Tim Maudlin s Truth and Paradox is terrific. In some sense its solution to the paradoxes is familiar the book advocates an extension of what s called the Kripke-Feferman

### DEFINING ONTOLOGICAL CATEGORIES IN AN EXPANSION OF BELIEF DYNAMICS

Logic and Logical Philosophy Volume 10 (2002), 199 210 Jan Westerhoff DEFINING ONTOLOGICAL CATEGORIES IN AN EXPANSION OF BELIEF DYNAMICS There have been attempts to get some logic out of belief dynamics,

### 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

### 6. Truth and Possible Worlds

6. Truth and Possible Worlds We have defined logical entailment, consistency, and the connectives,,, all in terms of belief. In view of the close connection between belief and truth, described in the first

### IN DEFENCE OF CLOSURE

IN DEFENCE OF CLOSURE IN DEFENCE OF CLOSURE By RICHARD FELDMAN Closure principles for epistemic justification hold that one is justified in believing the logical consequences, perhaps of a specified sort,

### 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

### How Do We Know Anything about Mathematics? - A Defence of Platonism

How Do We Know Anything about Mathematics? - A Defence of Platonism Majda Trobok University of Rijeka original scientific paper UDK: 141.131 1:51 510.21 ABSTRACT In this paper I will try to say something

Some questions about Adams conditionals PATRICK SUPPES I have liked, since it was first published, Ernest Adams book on conditionals (Adams, 1975). There is much about his probabilistic approach that is

### 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

### 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

### Class 33 - November 13 Philosophy Friday #6: Quine and Ontological Commitment Fisher 59-69; Quine, On What There Is

Philosophy 240: Symbolic Logic Fall 2009 Mondays, Wednesdays, Fridays: 9am - 9:50am Hamilton College Russell Marcus rmarcus1@hamilton.edu I. The riddle of non-being Two basic philosophical questions are:

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

### LOGIC ANTHONY KAPOLKA FYF 101-9/3/2010

LOGIC ANTHONY KAPOLKA FYF 101-9/3/2010 LIBERALLY EDUCATED PEOPLE......RESPECT RIGOR NOT SO MUCH FOR ITS OWN SAKE BUT AS A WAY OF SEEKING TRUTH. LOGIC PUZZLE COOPER IS MURDERED. 3 SUSPECTS: SMITH, JONES,

### Illustrating Deduction. A Didactic Sequence for Secondary School

Illustrating Deduction. A Didactic Sequence for Secondary School Francisco Saurí Universitat de València. Dpt. de Lògica i Filosofia de la Ciència Cuerpo de Profesores de Secundaria. IES Vilamarxant (España)

### Analytic Philosophy IUC Dubrovnik,

Analytic Philosophy IUC Dubrovnik, 10.5.-14.5.2010. Debating neo-logicism Majda Trobok University of Rijeka trobok@ffri.hr In this talk I will not address our official topic. Instead I will discuss some

### 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.

### 6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013 Transcript Lecture 21

6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013 Transcript Lecture 21 The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare

### Necessity and Truth Makers

JAN WOLEŃSKI Instytut Filozofii Uniwersytetu Jagiellońskiego ul. Gołębia 24 31-007 Kraków Poland Email: jan.wolenski@uj.edu.pl Web: http://www.filozofia.uj.edu.pl/jan-wolenski Keywords: Barry Smith, logic,

Kripke s skeptical paradox phil 93914 Jeff Speaks March 13, 2008 1 The paradox.................................... 1 2 Proposed solutions to the paradox....................... 3 2.1 Meaning as determined

### Workbook Unit 3: Symbolizations

Workbook Unit 3: Symbolizations 1. Overview 2 2. Symbolization as an Art and as a Skill 3 3. A Variety of Symbolization Tricks 15 3.1. n-place Conjunctions and Disjunctions 15 3.2. Neither nor, Not both

### Lecture 25 Hume on Causation

Lecture 25 Hume on Causation Patrick Maher Scientific Thought II Spring 2010 Ideas and impressions Hume s terminology Ideas: Concepts. Impressions: Perceptions; they are of two kinds. Sensations: Perceptions

### Well, how are we supposed to know that Jesus performed miracles on earth? Pretty clearly, the answer is: on the basis of testimony.

Miracles Last time we were discussing the Incarnation, and in particular the question of how one might acquire sufficient evidence for it to be rational to believe that a human being, Jesus of Nazareth,

### Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples

Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples Section 1.1 Propositional Logic Page references correspond to locations of Extra Examples icons in the textbook. p.2, icon at

### 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

### ILLOCUTIONARY ORIGINS OF FAMILIAR LOGICAL OPERATORS

ILLOCUTIONARY ORIGINS OF FAMILIAR LOGICAL OPERATORS 1. ACTS OF USING LANGUAGE Illocutionary logic is the logic of speech acts, or language acts. Systems of illocutionary logic have both an ontological,

### Constructive Logic, Truth and Warranted Assertibility

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

### 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

### The Problem with Complete States: Freedom, Chance and the Luck Argument

The Problem with Complete States: Freedom, Chance and the Luck Argument Richard Johns Department of Philosophy University of British Columbia August 2006 Revised March 2009 The Luck Argument seems to show

### Quantificational logic and empty names

Quantificational logic and empty names Andrew Bacon 26th of March 2013 1 A Puzzle For Classical Quantificational Theory Empty Names: Consider the sentence 1. There is something identical to Pegasus On

### Chapter 3: Basic Propositional Logic. Based on Harry Gensler s book For CS2209A/B By Dr. Charles Ling;

Chapter 3: Basic Propositional Logic Based on Harry Gensler s book For CS2209A/B By Dr. Charles Ling; cling@csd.uwo.ca The Ultimate Goals Accepting premises (as true), is the conclusion (always) true?