Symbolic Logic II Philosophy 520 Prof. Brandon Look. Final Exam
|
|
- Sophie Lawson
- 5 years ago
- Views:
Transcription
1 Symbolic Logic II Philosophy 520 Prof. Brandon Look Final Exam Due Wednesday, May 6, at 12:00pm. Put your completed exam in my mailbox in POT Please note: U means that a problem is required of undergraduates; G means that a problem is required of graduate students in Philosophy. Graduate students in Philosophy may do either (8) or (9). Each problem or subproblem is worth 10 points, unless marked otherwise. (1) (U) Produce a counterexample (that is, an interpretation of the predicate for some set of objects) to show that the following wff is not logically valid: [ x y z((rxy Ryz) Rxz) x Rxx] x y Rxy (2) (U/G) Show the following (see Sider 5.5): (a) F P C xf x F a (b) F P C xf x ( y y = a F a) (3) (U/G) For the following wff give a semantic validity proof if the wff is SQML-valid or a countermodel if it is invalid: x(nx y(ny y = x) Ox) x(nx y(ny y = x) Ox) (4) (U/G) Demonstrate the VDQML invalidity of the following wff: x y y = x (5) (U/G) Construct an axiomatic proof in SQML for the following wff: x y y = x (G) Translate this formula into English. Do you find this proposition problematic? If so, since we derived it from our axioms and rules, is there anything wrong with our axioms and rules? (Answer in no more than a paragraph.) 1
2 (6) (U/G) Demonstrate by means of a semantic validity proof the following fact: (7) (G) Derive the following: (a) Lemma LP C=S5 φ ψ just in case LP C=S5 φ ψ (b) BF α φ αφ For (b) you should use the Lemma and our rules and axioms. (8) (G) Some Philosophy: Suppose we deny transworld identity, that is, we deny the thesis that individuals/objects can exist in more than one world. So, let us say that a exists at a world, w. Then, at any other world, w, since a does not exist there, one could say that F a is false there. And it follows that F a is false at w, unless Rww, in which case F a is true at w iff F a is. If we take w to be the actual world and assume that it accesses itself, then we have fatalism: the only things that can be true are the things that are actually true. On the other hand, suppose we accept transworld identity. Then we are committed to the thesis that the very same object can exist in more than one possible world. But how can that be? According to Leibniz s Law, α = β (φ(α) φ(β)). But it would seem that a s properties in w should differ from its properties in w thus invalidating Leibniz s Law. Continue this discussion with special appeal to the logical, metaphysical, and epistemological concepts and principles we have discussed this semester. (No more than 500 words (2pp.). 20 points.) (9) (G) Some more Philosophy: In Plato s Sophist, we are confronted with the Paradox of Non-Being. There the Eleatic Stranger says that the term that which is not can t be applied to any of those [things] which are... So if you can t apply it to that which is, it wouldn t be right either to apply it to something. (237c) In other words, we cannot or ought not say of x that it does not exist. Compare this with Richard Cartwright, in his essay, Negative Existentials : To deny the existence of something of unicorns, for example we must indicate what it is the existence of which is denied; and this requires that unicorns be referred to, or 2
3 mentioned: the negative existential must be about them. But things which do not exist cannot be referred to or mentioned; no statement can be about them. So, given that we have denied their existence, unicorns must after all exist. The apparently true negative existential is thus either false or not really a statement at all; and, since the argument applies as well in any other case, we seem forced to conclude that there are no true negative existentials. (J. Phil. 1960: 629) So, consider the following argument: (a) If S denies the existence of a, then S refers to what S says does not exist. (b) Things which do not exist cannot be referred to or mentioned; no statement can be made about them. (c) Therefore, if S denies the existence of a, then what S says does not exist does exist. How can you respond to this argument and this problem in general? Answer by appealing to the logical, metaphysical, and epistemological concepts and principles that we have discussed this semester. In particular, consider: (a) what this problem means for what we are quantifying over ; (b) what this means in terms of actualist vs. possibilist quantification; (c) and whether this problem should move us towards or away from some of the tenets of Free Logic. (No more than 500 words (2pp.) 20 points.) 3
4 Tautologies of Propositional Logic 1 PC1 (φ ψ) φ PC2 (φ ψ) ψ PC3 (φ ψ) ((φ χ) (φ (ψ χ))) Law of Composition PC4 φ (ψ (φ ψ)) Law of Adjunction PC5 (φ ψ) ((ψ φ) (φ ψ)) PC6 (φ ψ) ((ψ χ) (φ χ)) Law of Syllogism (or HS) PC7 (φ (ψ χ)) ((φ ψ) χ) Law of Importation PC8 (φ ψ) ((ψ (χ ξ)) ((φ χ) ξ)) PC9 φ (φ ψ) PC10 ψ (φ ψ) PC11 (φ ψ) ((χ ψ) ((φ χ) ψ)) PC12 φ φ Law of Double Negation (DN) PC13 (φ ψ) ( φ ψ) De Morgan s Law I (DM) PC14 (φ ψ) ( φ ψ) De Morgan s Law II (DM) PC15 (φ ψ) ( ψ φ) Law of Transposition PC16 (φ ψ) (ψ φ) Commutativity PC17 (φ ψ) (ψ φ) Commutativity PC18 ((φ ψ) χ) (φ (ψ χ)) Associativity PC19 ((φ ψ) χ) (φ (ψ χ)) Associativity PC20 φ (φ φ) PC21 φ (φ φ)) Axioms of Propositional and Quantificational Logic 2 PL1 φ (ψ φ) PL2 (φ (ψ χ)) ((φ ψ) (φ χ)) PL3 ( ψ φ) (( ψ φ) ψ) 1 αφ φ(β/α) 2 α(φ ψ) (φ αψ) 2* If φ ψ and α is not free in φ, then φ αψ. 1 See G.E. Hughes & M.J. Cresswell, A New Introduction to Modal Logic, (London: Routledge, 1996), p For 2*, see Hughes & Cresswell, p
5 Axioms of Modal Logic K (φ ψ) ( φ ψ) K (φ ψ) ( φ ψ) D φ φ T φ φ T φ φ B φ φ B φ φ S4 φ φ S4 φ φ S5 φ φ S5 φ φ Rules of Inference MP If φ ψ and φ, then ψ UG If φ, then αφ NEC If φ, then φ Other DT If Γ, φ ψ, then Γ φ ψ RX α = α LL α = β (φ(α) φ(β)) (Leibniz s Law) Problematic Formulas LI x y(x = y (x = y)) Law of Identity (the necessity of identity) LNI x y(x y (x y)) Law of Non-Identity PII F x y((f x F y) x = y) Principle of the Identity of Indiscernibles BF x F x xf x Barcan Formula BFC xf x x F x Converse Barcan Formula 5
All psychiatrists are doctors All doctors are college graduates All psychiatrists are college graduates
Predicate Logic In what we ve discussed thus far, we haven t addressed other kinds of valid inferences: those involving quantification and predication. For example: All philosophers are wise Socrates is
More informationPhilosophy 244: #14 Existence and Identity
Philosophy 244: #14 Existence and Identity Existence Predicates The problem we ve been having is that (a) we want to allow models that invalidate the CBF ( xα x α), (b) these will have to be models in
More informationH. Quantified Modal Logic (QML)
H. Quantified Modal Logic (QML) H.I. Syntax (LfP 9.1) H.I.1. Primitive symbols We add a to the syntax of PC with =. Primitive vocabulary of QML : connectives: Ñ,,, @ variables: x, y,... (with or without
More informationPhilosophy 240: Symbolic Logic
Philosophy 240: Symbolic Logic Russell Marcus Hamilton College Fall 2014 Class #41 - Second-Order Quantification Marcus, Symbolic Logic, Slide 1 Second-Order Inferences P Consider a red apple and a red
More informationWilliamson s Modal Logic as Metaphysics
Williamson s Modal Logic as Metaphysics Ted Sider Modality seminar 1. Methodology The title of this book may sound to some readers like Good as Evil, or perhaps Cabbages as Kings. If logic and metaphysics
More informationFinal Exam (100 points)
Final Exam (100 points) Honor Code: Each question is worth 10 points. There is one bonus question worth 5 points. In contrast to the homework assignments, you may not collaborate on this final exam. You
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More information7 Classical Quantified Logic
7 Classical Quantified Logic efore examining quantified modal logic, we review a bare-bones system for first-order predicate or quantificational logic, i.e., that involving the quantifiers x... and x...,
More informationClass 29 - November 3 Semantics for Predicate Logic
Philosophy 240: Symbolic Logic Fall 2010 Mondays, Wednesdays, Fridays: 9am - 9:50am Hamilton College Russell Marcus rmarcus1@hamilton.edu Class 29 - November 3 Semantics for Predicate Logic I. Proof Theory
More informationPhilosophy 240: Symbolic Logic
Philosophy 240: Symbolic Logic Russell Marcus Hamilton College Fall 2015 Class #41 - Second-Order Quantification Marcus, Symbolic Logic, Slide 1 Second-Order Inferences P Consider a red apple and a red
More informationn logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition
More informationPredicate Calculus - Syntax
Predicate Calculus - Syntax Lila Kari University of Waterloo Predicate Calculus - Syntax CS245, Logic and Computation 1 / 26 The language L pred of Predicate Calculus - Syntax L pred, the formal language
More informationChapter 9. Modal Language, Syntax, and Semantics
Chapter 9 Modal Language, Syntax, and Semantics In chapter 6 we saw that PL is not expressive enough to represent valid arguments and semantic relationships that employ quantified expressions some and
More informationNatural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic. The method consists of using sets of Rules of Inference (valid argument forms)
More informationLogic Overview, I. and T T T T F F F T F F F F
Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical
More informationConjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.
Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is
More information1. The Modal System ZFM
Bulletin of the Section of Logic Volume 14/4 (1985), pp. 144 148 reedition 2007 [original edition, pp. 144 149] Lafayette de Moraes ON DISCUSSIVE SET THEORY Abstract This paper was read at the VII Simpōsio
More informationMat 243 Exam 1 Review
OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for
More informationDescription Logics. Foundations of Propositional Logic. franconi. Enrico Franconi
(1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge
More information3. The Logic of Quantified Statements Summary. Aaron Tan August 2017
3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Originals slides by Dr. Baek and Dr. Still, adapted by J. Stelovsky Based on slides Dr. M. P. Frank and Dr. J.L. Gross
More informationLogical Structures in Natural Language: First order Logic (FoL)
Logical Structures in Natural Language: First order Logic (FoL) Raffaella Bernardi Università degli Studi di Trento e-mail: bernardi@disi.unitn.it Contents 1 How far can we go with PL?................................
More informationFormal Logic: Quantifiers, Predicates, and Validity. CS 130 Discrete Structures
Formal Logic: Quantifiers, Predicates, and Validity CS 130 Discrete Structures Variables and Statements Variables: A variable is a symbol that stands for an individual in a collection or set. For example,
More informationModal Logic: Exercises
Modal Logic: Exercises KRDB FUB stream course www.inf.unibz.it/ gennari/index.php?page=nl Lecturer: R. Gennari gennari@inf.unibz.it June 6, 2010 Ex. 36 Prove the following claim. Claim 1. Uniform substitution
More informationModal Logic. UIT2206: The Importance of Being Formal. Martin Henz. March 19, 2014
Modal Logic UIT2206: The Importance of Being Formal Martin Henz March 19, 2014 1 Motivation The source of meaning of formulas in the previous chapters were models. Once a particular model is chosen, say
More informationMath.3336: Discrete Mathematics. Nested Quantifiers
Math.3336: Discrete Mathematics Nested Quantifiers Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall 2018
More informationChapter 1 Elementary Logic
2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help
More informationPredicate Logic. Predicates. Math 173 February 9, 2010
Math 173 February 9, 2010 Predicate Logic We have now seen two ways to translate English sentences into mathematical symbols. We can capture the logical form of a sentence using propositional logic: variables
More informationDiscrete Mathematics and Its Applications
Discrete Mathematics and Its Applications Lecture 1: The Foundations: Logic and Proofs (1.3-1.5) MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 19, 2017 Outline 1 Logical
More informationSection 1.1 Propositions
Set Theory & Logic Section 1.1 Propositions Fall, 2009 Section 1.1 Propositions In Chapter 1, our main goals are to prove sentences about numbers, equations or functions and to write the proofs. Definition.
More informationCS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.
3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on
More informationFirst Order Logic (FOL) 1 znj/dm2017
First Order Logic (FOL) 1 http://lcs.ios.ac.cn/ znj/dm2017 Naijun Zhan March 19, 2017 1 Special thanks to Profs Hanpin Wang (PKU) and Lijun Zhang (ISCAS) for their courtesy of the slides on this course.
More informationDiscrete Mathematics. Instructor: Sourav Chakraborty. Lecture 4: Propositional Logic and Predicate Lo
gic Instructor: Sourav Chakraborty Propositional logic and Predicate Logic Propositional logic and Predicate Logic Every statement (or proposition) is either TRUE or FALSE. Propositional logic and Predicate
More informationWhy Learning Logic? Logic. Propositional Logic. Compound Propositions
Logic Objectives Propositions and compound propositions Negation, conjunction, disjunction, and exclusive or Implication and biconditional Logic equivalence and satisfiability Application of propositional
More information2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic
CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares
More informationRecall that the expression x > 3 is not a proposition. Why?
Predicates and Quantifiers Predicates and Quantifiers 1 Recall that the expression x > 3 is not a proposition. Why? Notation: We will use the propositional function notation to denote the expression "
More information127: Philosophical logic Logic exercises and philosophy tasks
127: Philosophical logic Logic exercises and philosophy tasks James Studd Hilary term 2017 Contents 1 How to use these exercises 2 2 Logic exercises 3 Week 1.......................... 3 Week 2..........................
More informationExample. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives
Logic Logic is study of abstract reasoning, specifically, concerned with whether reasoning is correct. Logic focuses on relationship among statements as opposed to the content of any particular statement.
More informationAI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic
AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic Propositional logic Logical connectives Rules for wffs Truth tables for the connectives Using Truth Tables to evaluate
More informationSection Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier
Section 1.4 Section Summary Predicate logic Quantifiers Universal Quantifier Existential Quantifier Negating Quantifiers De Morgan s Laws for Quantifiers Translating English to Logic Propositional Logic
More informationNotes on Propositional and First-Order Logic (CPSC 229 Class Notes, January )
Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January 23 30 2017) John Lasseter Revised February 14, 2017 The following notes are a record of the class sessions we ve devoted to the
More informationReview. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions
Review Propositions, propositional operators, truth tables Logical Equivalences. Tautologies & contradictions Some common logical equivalences Predicates & quantifiers Some logical equivalences involving
More informationRules Build Arguments Rules Building Arguments
Section 1.6 1 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments Rules of Inference for Quantified Statements Building Arguments for Quantified
More informationFirst Order Logic (1A) Young W. Lim 11/5/13
Copyright (c) 2013. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software
More informationProving logical equivalencies (1.3)
EECS 203 Spring 2016 Lecture 2 Page 1 of 6 Proving logical equivalencies (1.3) One thing we d like to do is prove that two logical statements are the same, or prove that they aren t. Vocabulary time In
More informationThe Logical Contingency of Identity Hanoch Ben-Yami
The Logical Contingency of Identity Hanoch Ben-Yami ABSTRACT. I show that intuitive and logical considerations do not justify introducing Leibniz s Law of the Indiscernibility of Identicals in more than
More informationA SIMPLE AXIOMATIZATION OF LUKASIEWICZ S MODAL LOGIC
Bulletin of the Section of Logic Volume 41:3/4 (2012), pp. 149 153 Zdzis law Dywan A SIMPLE AXIOMATIZATION OF LUKASIEWICZ S MODAL LOGIC Abstract We will propose a new axiomatization of four-valued Lukasiewicz
More informationProseminar on Semantic Theory Fall 2013 Ling 720 First Order (Predicate) Logic: Syntax and Natural Deduction 1
First Order (Predicate) Logic: Syntax and Natural Deduction 1 A Reminder of Our Plot I wish to provide some historical and intellectual context to the formal tools that logicians developed to study the
More informationChapter 1, Logic and Proofs (3) 1.6. Rules of Inference
CSI 2350, Discrete Structures Chapter 1, Logic and Proofs (3) Young-Rae Cho Associate Professor Department of Computer Science Baylor University 1.6. Rules of Inference Basic Terminology Axiom: a statement
More informationIntroduction to Decision Sciences Lecture 2
Introduction to Decision Sciences Lecture 2 Andrew Nobel August 24, 2017 Compound Proposition A compound proposition is a combination of propositions using the basic operations. For example (p q) ( p)
More informationFirst Order Logic (1A) Young W. Lim 11/18/13
Copyright (c) 2013. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software
More informationTHE LOGICAL CONTINGENCY OF IDENTITY. HANOCH BEN-YAMI Central European University ABSTRACT
EuJAP Vol. 14, No. 2, 2018 1 LEIBNIZ, G. W. 161.2 THE LOGICAL CONTINGENCY OF IDENTITY HANOCH BEN-YAMI Central European University Original scientific article Received: 23/03/2018 Accepted: 04/07/2018 ABSTRACT
More informationPredicate Logic & Quantification
Predicate Logic & Quantification Things you should do Homework 1 due today at 3pm Via gradescope. Directions posted on the website. Group homework 1 posted, due Tuesday. Groups of 1-3. We suggest 3. In
More informationCorrespondence theory and logical postulates in metaphysics in an application to formal pragmatics
Correspondence theory and logical postulates in metaphysics in an application to formal pragmatics Berislav Žarnić University of Split Mind, World & Action 2014 IUC, Dubrovnik, 25 29 August 2014 Overview
More informationCOMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called
More informationA. Propositional Logic
CmSc 175 Discrete Mathematics A. Propositional Logic 1. Statements (Propositions ): Statements are sentences that claim certain things. Can be either true or false, but not both. Propositional logic deals
More informationLogic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes:
Logic Logic is a discipline that studies the principles and methods used in correct reasoning It includes: A formal language for expressing statements. An inference mechanism (a collection of rules) to
More informationList of errors in and suggested modifications for First-Order Modal Logic Melvin Fitting and Richard L. Mendelsohn August 11, 2013
List of errors in and suggested modifications for First-Order Modal Logic Melvin Fitting and Richard L. Mendelsohn August 11, 2013 James W. Garson has answered a question we raised, in a paper that is
More informationCS 220: Discrete Structures and their Applications. Predicate Logic Section in zybooks
CS 220: Discrete Structures and their Applications Predicate Logic Section 1.6-1.10 in zybooks From propositional to predicate logic Let s consider the statement x is an odd number Its truth value depends
More informationPropositional Logic Arguments (5A) Young W. Lim 11/8/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More information240 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 information4 Quantifiers and Quantified Arguments 4.1 Quantifiers
4 Quantifiers and Quantified Arguments 4.1 Quantifiers Recall from Chapter 3 the definition of a predicate as an assertion containing one or more variables such that, if the variables are replaced by objects
More informationLecture Notes on Classical Modal Logic
Lecture Notes on Classical Modal Logic 15-816: Modal Logic André Platzer Lecture 5 January 26, 2010 1 Introduction to This Lecture The goal of this lecture is to develop a starting point for classical
More informationMath 10850, fall 2017, University of Notre Dame
Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need
More informationPredicate Calculus lecture 1
Predicate Calculus lecture 1 Section 1.3 Limitation of Propositional Logic Consider the following reasoning All cats have tails Gouchi is a cat Therefore, Gouchi has tail. MSU/CSE 260 Fall 2009 1 MSU/CSE
More informationMathacle. PSet ---- Algebra, Logic. Level Number Name: Date: I. BASICS OF PROPOSITIONAL LOGIC
I. BASICS OF PROPOSITIONAL LOGIC George Boole (1815-1864) developed logic as an abstract mathematical system consisting of propositions, operations (conjunction, disjunction, and negation), and rules for
More information1A Logic 2013 Model Answers
1A Logic 2013 Model Answers Section A 1. This is a question about TFL. Attempt all parts of this question. [Note that most of the material in this question has been moved to the metatheory section of the
More informationFormal Methods in Philosophy
Formal Methods in Philosophy Lecture Notes 2013 Dr. Anders J. Schoubye School of Philosophy, Psychology and Language Sciences University of Edinburgh anders.schoubye@ed.ac.uk http://www.schoubye.net Contents
More informationLanguage of Propositional Logic
Logic A logic has: 1. An alphabet that contains all the symbols of the language of the logic. 2. A syntax giving the rules that define the well formed expressions of the language of the logic (often called
More informationn Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.7, 5.5) TOPICS Sets and Functions Propositional and Predicate Logic Logical Operators and Truth Tables Logical Equivalences and Inference
More informationC. Modal Propositional Logic (MPL)
C. Modal Propositional Logic (MPL) Let s return to a bivalent setting. In this section, we ll take it for granted that PL gets the semantics and logic of and Ñ correct, and consider an extension of PL.
More information1.1 Statements and Compound Statements
Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something
More informationTecniche di Verifica. Introduction to Propositional Logic
Tecniche di Verifica Introduction to Propositional Logic 1 Logic A formal logic is defined by its syntax and semantics. Syntax An alphabet is a set of symbols. A finite sequence of these symbols is called
More informationMath.3336: Discrete Mathematics. Propositional Equivalences
Math.3336: Discrete Mathematics Propositional Equivalences Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall
More informationOn Axiomatic Rejection for the Description Logic ALC
On Axiomatic Rejection for the Description Logic ALC Hans Tompits Vienna University of Technology Institute of Information Systems Knowledge-Based Systems Group Joint work with Gerald Berger Context The
More informationOverview of Today s Lecture
Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 1 Overview of Today s Lecture Administrative Stuff HW #1 grades and solutions have been posted Please make sure to work through the solutions HW
More informationA MODAL EXTENSION OF FIRST ORDER CLASSICAL LOGIC Part I
Bulletin of the Section of Logic Volume 32/4 (2003), pp. 165 177 George Tourlakis 1 Francisco Kibedi A MODAL EXTENSION OF FIRST ORDER CLASSICAL LOGIC Part I Abstract We formalize a fragment of the metatheory
More informationTHE 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 informationFormal Logic. Critical Thinking
ormal Logic Critical hinking Recap: ormal Logic If I win the lottery, then I am poor. I win the lottery. Hence, I am poor. his argument has the following abstract structure or form: If P then Q. P. Hence,
More informationFormal Logic Lecture 11
Faculty of Philosophy Formal Logic Lecture 11 Peter Smith Peter Smith: Formal Logic, Lecture 11 1 Outline Where next? Introducing PL trees Branching trees Peter Smith: Formal Logic, Lecture 11 2 Where
More informationLogic: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
More informationPredicate Logic. Example. Statements in Predicate Logic. Some statements cannot be expressed in propositional logic, such as: Predicate Logic
Predicate Logic Predicate Logic (Rosen, Chapter 1.4-1.6) TOPICS Predicate Logic Quantifiers Logical Equivalence Predicate Proofs Some statements cannot be expressed in propositional logic, such as: All
More informationMAT2345 Discrete Math
Fall 2013 General Syllabus Schedule (note exam dates) Homework, Worksheets, Quizzes, and possibly Programs & Reports Academic Integrity Do Your Own Work Course Web Site: www.eiu.edu/~mathcs Course Overview
More information(Refer Slide Time: 02:20)
Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 5 Logical Inference In the last class we saw about
More informationPropositional Logic: Part II - Syntax & Proofs 0-0
Propositional Logic: Part II - Syntax & Proofs 0-0 Outline Syntax of Propositional Formulas Motivating Proofs Syntactic Entailment and Proofs Proof Rules for Natural Deduction Axioms, theories and theorems
More informationPropositional Logic. Spring Propositional Logic Spring / 32
Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements
More informationCS589 Principles of DB Systems Fall 2008 Lecture 4e: Logic (Model-theoretic view of a DB) Lois Delcambre
CS589 Principles of DB Systems Fall 2008 Lecture 4e: Logic (Model-theoretic view of a DB) Lois Delcambre lmd@cs.pdx.edu 503 725-2405 Goals for today Review propositional logic (including truth assignment)
More informationReview. Propositional Logic. Propositions atomic and compound. Operators: negation, and, or, xor, implies, biconditional.
Review Propositional Logic Propositions atomic and compound Operators: negation, and, or, xor, implies, biconditional Truth tables A closer look at implies Translating from/ to English Converse, inverse,
More informationFirst-Order Logic (FOL)
First-Order Logic (FOL) Also called Predicate Logic or Predicate Calculus 2. First-Order Logic (FOL) FOL Syntax variables x, y, z, constants a, b, c, functions f, g, h, terms variables, constants or n-ary
More informationPredicate in English. Predicates and Quantifiers. Predicate in Logic. Propositional Functions: Prelude. Propositional Function
Predicates and Quantifiers Chuck Cusack Predicate in English In English, a sentence has 2 parts: the subject and the predicate. The predicate is the part of the sentence that states something about the
More informationDepartment of Computer Science & Software Engineering Comp232 Mathematics for Computer Science
Department of Computer Science & Software Engineering Comp232 Mathematics for Computer Science Fall 2018 Assignment 1. Solutions 1. For each of the following statements use a truth table to determine whether
More informationCPSC 121: Models of Computation
CPSC 121: Models of Computation Unit 6 Rewriting Predicate Logic Statements Based on slides by Patrice Belleville and Steve Wolfman Coming Up Pre-class quiz #7 is due Wednesday October 25th at 9:00 pm.
More information3 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 informationECOM Discrete Mathematics
ECOM 2311- Discrete Mathematics Chapter # 1 : The Foundations: Logic and Proofs Fall, 2013/2014 ECOM 2311- Discrete Mathematics - Ch.1 Dr. Musbah Shaat 1 / 85 Outline 1 Propositional Logic 2 Propositional
More informationSection 1.2: Propositional Logic
Section 1.2: Propositional Logic January 17, 2017 Abstract Now we re going to use the tools of formal logic to reach logical conclusions ( prove theorems ) based on wffs formed by some given statements.
More informationCounterparts and Actuality
Counterparts and Actuality Michael Fara Cornell University michael.fara@cornell.edu Timothy Williamson Oxford University timothy.williamson@philosophy.oxford.ac.uk To appear in Mind 114, 2005. 1. Introduction
More informationOverview of Today s Lecture
Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 1 Overview of Today s Lecture Administrative Stuff HW #1 grades and solutions have been posted Please make sure to work through the solutions HW
More information2. The Logic of Compound Statements Summary. Aaron Tan August 2017
2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional
More informationLecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)
Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or
More information