King s College London

Similar documents
This paper is also taken by Combined Studies Students. Optional Subject (i): Set Theory and Further Logic

(c) Establish the following claims by means of counterexamples.

List of errors in and suggested modifications for First-Order Modal Logic Melvin Fitting and Richard L. Mendelsohn August 11, 2013

Semantics and Pragmatics of NLP

Logical Structures in Natural Language: First order Logic (FoL)

1 Completeness Theorem for First Order Logic

First Order Logic: Syntax and Semantics

Modal Logic & Kripke Semantics

The Logical Contingency of Identity Hanoch Ben-Yami

Logic: First Order Logic

Williamson s Modal Logic as Metaphysics

THE LOGICAL CONTINGENCY OF IDENTITY. HANOCH BEN-YAMI Central European University ABSTRACT

Formal Logic Lecture 11

Computational Semantics Day 4: Extensionality and intensionality

Introduction to Predicate Logic Part 1. Professor Anita Wasilewska Lecture Notes (1)

Introduction to Logic in Computer Science: Autumn 2006

University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. February 9, :30 pm Duration: 1:50 hs. Closed book, no calculators

Lecture 13: Soundness, Completeness and Compactness

Systems of modal logic

KE/Tableaux. What is it for?

INTRODUCTION TO LOGIC 8 Identity and Definite Descriptions

Non-normal Worlds. Daniel Bonevac. February 5, 2012

Lecture 15: Validity and Predicate Logic

York University. Faculty of Science and Engineering MATH 1090, Section M Final Examination, April NAME (print, in ink): Instructions, remarks:

EXERCISE 10 SOLUTIONS

INTRODUCTION TO LOGIC 1 Sets, Relations, and Arguments. Why logic? Arguments

Section 2.1: Introduction to the Logic of Quantified Statements

Stanford University CS103: Math for Computer Science Handout LN9 Luca Trevisan April 25, 2014

1 Completeness Theorem for Classical Predicate

CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS

CHAPTER 10. Predicate Automated Proof Systems

240 Metaphysics. Frege s Puzzle. Chapter 26

I thank the author of the examination paper on which sample paper is based. VH

Marie Duží

Section 3.1: Direct Proof and Counterexample 1

Philosophy 244: #14 Existence and Identity

Logic I - Session 22. Meta-theory for predicate logic

CS280, Spring 2004: Final

Meaning and Reference INTENSIONAL AND MODAL LOGIC. Intensional Logic. Frege: Predicators (general terms) have

Generality & Existence II

Logic Overview, I. and T T T T F F F T F F F F

5. And. 5.1 The conjunction

Predicate Logic. CSE 191, Class Note 02: Predicate Logic Computer Sci & Eng Dept SUNY Buffalo

Discrete Mathematics

COMP2411 Lecture 10: Propositional Logic Programming. Note: This material is not covered in the book. Resolution Applied to Horn Clauses

Kripke on Frege on Sense and Reference. David Chalmers

TR : Binding Modalities

Notation for Logical Operators:

Predicate Logic - Deductive Systems

Classical Possibilism and Fictional Objects

Approximations of Modal Logic K

GS03/4023: Validation and Verification Predicate Logic Jonathan P. Bowen Anthony Hall

CS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati

INTRODUCTION TO PREDICATE LOGIC HUTH AND RYAN 2.1, 2.2, 2.4

INTRODUCTION TO LOGIC 8 Identity and Definite Descriptions

Reasoning Under Uncertainty: Introduction to Probability

The Skolemization of existential quantifiers in intuitionistic logic

Recall that the expression x > 3 is not a proposition. Why?

A Tableau Calculus for Minimal Modal Model Generation

Přednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1

Mathematical Logic. Reasoning in First Order Logic. Chiara Ghidini. FBK-IRST, Trento, Italy

2. Use quantifiers to express the associative law for multiplication of real numbers.

Modal Logics. Most applications of modal logic require a refined version of basic modal logic.

MATH 501: Discrete Mathematics

References A CONSTRUCTIVE INTRODUCTION TO FIRST ORDER LOGIC. The Starting Point. Goals of foundational programmes for logic:

Ling 98a: The Meaning of Negation (Week 5)

Learning Goals of CS245 Logic and Computation

First Order Logic Implication (4A) Young W. Lim 4/6/17

Bertrand Russell, Herbrand s Theorem, and the Assignment Statement

Relevant Logic. Daniel Bonevac. March 20, 2013

First-Degree Entailment

Reasoning Under Uncertainty: Introduction to Probability

Symbolising Quantified Arguments


Quantification and Modality

Predicate Calculus - Semantic Tableau (2/2) Moonzoo Kim CS Division of EECS Dept. KAIST

Modal Epistemic Logic with Subjunctive Markers and Knowability

CPPE TURN OVER

Handout: Proof of the completeness theorem


Recitation 4: Quantifiers and basic proofs

Principles of Knowledge Representation and Reasoning

Chapter 9. Modal Language, Syntax, and Semantics

Logic: First Order Logic

arxiv: v4 [math.lo] 6 Apr 2018

Realization Using the Model Existence Theorem

5. And. 5.1 The conjunction

Propositional Logic Arguments (5A) Young W. Lim 11/30/16

CSE 1400 Applied Discrete Mathematics Definitions

cis32-ai lecture # 18 mon-3-apr-2006

Doc112: Hardware. Department of Computing, Imperial College London. Doc112: Hardware Lecture 1 Slide 1

S4LP and Local Realizability

Section 2.3: Statements Containing Multiple Quantifiers

Exercises for the Logic Course

Predicate Logic. Predicates. Math 173 February 9, 2010

Propositional Logic Arguments (5A) Young W. Lim 11/29/16

Predicate Logic: Sematics Part 1

INTRODUCTION TO LOGIC

Logic in Computer Science (COMP118) Tutorial Problems 1

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Transcription:

King s College London This paper is part of an examination of the College counting towards the award of a degree. Examinations are governed by the College Regulations under the authority of the Academic Board. MA EXAMINATION MODAL LOGIC Examination Period 2 (May/June 2016) TIME ALLOWED: TWO HOURS ANSWER TWO QUESTIONS, ONE FROM EACH SECTION NB Candidates should avoid overlap in their answers ANSWER EACH QUESTION ON A NEW PAGE OF YOUR ANSWER BOOK AND WRITE ITS NUMBER IN THE SPACE PROVIDED. DO NOT REMOVE THIS PAPER FROM THE EXAMINATION ROOM TURN OVER WHEN INSTRUCTED 2016 King s College London

SECTION A 1. (a) Is the following valid in T: (p q) ( p q)? Justify your answer. (b) Show that the characteristic thesis of the Brouwerian system, p P, is not valid in S4. (c) i. Provide a model to show that ( p p) is not valid in T. ii. Provide a model that shows that ( p p) is not valid in S4. (d) Provide an S5 model in which xp x x P x is false at some world. (e) Explain why, if domains are allowed to vary freely, the converse of the Barcan Formula is not valid even in T. 2. Let three frames (G 1, R 1 ), (G 2, R 2 ), (G 3, R 3 ), be defined by G 1 = {a}, R 1 = { a, a } G 2 = {a, b}, R 2 = { a, b, b, a, b, b } G 3 = {a, b}, R 3 = { a, a, a, b, b, b } ( x, y in R i means xr i y). (a) For each of the three frames determine which of the following formulas are valid on the frame. i. P P ii. P P iii. P P 2

iv. P P v. P P Moreover, if one of the formulas φ is not valid on frame (G i, R i ), give a world x in G i and a forcing relation between G i and {P } such that x φ. (b) Show that a frame (G, R) is reflexive if and only if every formula of the form P P is valid in it. 3. Use the propositional tableau proof systems to prove the following three formulas (a) (p p) in the T system, (b) ( p q) ( p q) in the system S4, (c) (( ( p p) ( p p)) in the system S5. Use the constant domain tableau system to determine whether (d) is valid on all K models with constant domain (d) ( ( x)a(x) ( x)b(x)) ( x) (A(x) B(x)). Use the variable domain tableau system to determine whether (e) is valid on all K models with varying domain (e) ( ( x)a(x) ( x)b(x)) ( x)(a(x) B(x)). 3

SECTION B 4. Given the following facts a closed tableau is not satisfiable, applying tableau extension rules to a satisfiable tableau results in a satisfiable tableau, an open tableau, in which all rules that can be applied have been applied, is satisfiable, if X has no L-proof, then there is a saturated tableau for X with an open branch, An open branch of a saturated tableau for X can be identified with a model with a world that makes X true. Show the following (a) The Tableau Method for Propositional Modal Logic is sound and complete. (b) If a tableau for P is satisfiable, then so is the tableau that results from applying the tableau extension rule for. (Of course, you may not now assume the second bullet point above). 5. In the quantified modal logic of Fitting & Mendelsohn: Some constants don t designate; some constants are rigid designators; some rigid designators designate existents and some don t; some constants are nonrigid; some of the constants that are nonrigid designate non existents; some of the constants that are nonrigid designate in other worlds but not in this one. Give examples of this variety and explain how the semantics treats the constants in each case. 4

6. (a) Describe Predicate Abstraction and explain what problem in quantified modal logic (without abstraction) it is meant to solve. (b) Formulate De Re and De Dicto readings of the following sentences in the language of quantified modal logic with predicate abstraction and indicate which of the readings is the more likely one: i. The mayor of London will be a Labour member ii. The number of planets is necessarily odd. (c) Give a formalisation of the premisses and conclusion in the language of quantified modal logic with predicate abstraction such that the following argument is valid: Ken knows that the Morning Star is the Evening Star. Ken doesn t know that the Morning Star is Venus. Ken doesn t know that the Evening Star is Venus. 5 FINAL PAGE