0.1 Equivalence between Natural Deduction and Axiomatic Systems

Size: px
Start display at page:

Download "0.1 Equivalence between Natural Deduction and Axiomatic Systems"

Transcription

1 0.1 Equivalence between Natural Deduction and Axiomatic Systems Theorem Γ ND P iff Γ AS P ( ) it is enough to prove that all axioms are theorems in ND, as MP corresponds to ( e). ( ) by induction on the depth of Γ ND P. P depth base case: depth=1, i.e. P Γ = Γ AS P. assume that the claim holds for all trees of depth n. We distinguish cases according to the last rule applied. A B ( e 1 ) Γ AS A B and ((A B) A) + MP = Γ AS A A [A] [B] A B C C ( e) C by induction hypothesis: Γ AS A B; Γ,A AS C; Γ,B AS C by deduction theorem: Γ A C; Γ B C by ( e): (A C) ((B C) ((A B) C)) and three applications of MP follows Γ AS C 0.2 Sequent Calculus Differences between ND and Sequent Calculus 1. Rules applies to sequents 2. connectives are always introduced 3. four kinds of rules: axioms, cut, structural rules, logical rules Sequent Calculi LK and LJ Definition (Sequent). A 1,...,A n B. Definition (Inference Rule). S 1 S or S 1 S 2 S where S 1,S 2,S are sequents. 1

2 Definition (Rules of the LJ sequent calculus). Axioms: Γ A (derivability assertion) if A Γ Cut: Γ A Σ,A B (CUT) Γ,Σ B Structural Rules: Γ,B,A, C (exchange,l) Γ,A,B, C Γ B (weakening,l) Γ,A B Γ Γ B (weakening,r) empty RHS is a contradiction ( ) Γ,A,A, C (contraction,l) Γ,A, C Logical Rules: Γ,A C Γ,B C (, l) Γ,A B C Γ A 1 1 Γ A 1 A 2 Γ A 2 2 Γ A 1 A 2 Γ,A 1 C (, l)1 Γ,A 1 A 2 C Γ,A 2 C (, l)2 Γ,A 1 A 2 C Γ A Γ B (, r) Γ A B Γ,B C Γ A (, l) Γ,A B C Γ,A B Γ A B Γ A (, l) Γ, A Γ,A Γ A (, r) The calculus above is sound and complete for IL. Note that, except for (CUT), the following holds Corollary (Subformula property). everything that appears in the rules s premises appears in the conclusion To obtain a calculus for classical logic we need to introduce a rule corresponding to (RAA), such as Γ, A Γ A (RAA) Example The above rule is derivable in LJ if we assume that A A. Indeed Γ, A (w,r) A A (w,l) Γ, A A Γ,A A (, l) Γ,A A A A A (CUT) Γ A Note that (RAA) does not satisfy the subformula property. 2

3 0.2.2 Sequent Calculus LK To find a calculus for classical logic in which 1. all the rules (but (CUT)) satisfy the subformula property and 2. (CUT) is eliminable from derivations, we have to change the notion of sequent as follows: Definition (Sequents for LK). A 1,...,A n B 1,...,B m. Definition (Inference rules for LK). Are as those of LJ in which a context (and ) is added everywhere on the right hand side of sequents (RHS). E.g. Γ,B Γ A, ( l) Γ,A B Γ,B,A,Σ (exchange,l) Γ,A,B,Σ Γ B,A, (exchange,r) Γ A,B, Γ (weakening,l) Γ,A Γ Γ,A (weakening,r) Γ,A,A (contraction,l) Γ,A Γ A,A, (contraction,r) Γ A, Γ A, Γ,A (CUT) Γ,Γ, Note that the exchange rules are not needed, if in sequents Γ, Γ and are finite multisets of formulas. Definition Γ, are called side formulas or context. In the conclusion of each rule, the formula not occurring in the context is called principal formula. The formulas in the premises from which the principal formula derives are called active formulas. Definition Proofs (in LJ or LK) are labeled finite trees with a single root, with axioms at the top nodes and each node-label is connected with the labels of the (immediate) successor nodes (if any) according to one of the rules. Example Example Example A,B A A B A A (B A) A A (, r) A, A (, l) A A A A 3

4 Example Example A A B C,A A,C A C,B C,A A,C A C,B,C C A C,B B (, l) A C,B C,B C (, l) A C,B C,A B C A C,B C (A B) C A C (B C) ((A B) C) (A C) ((B C) ((A B) C)) A A (, r) A, A A,A A A A,A A (c,r) A A A,B A,B A B,B A A B,(A B) (B A) 2 (A B) (B A),(A B) (B A) (c,r) (A B) (B A) Note that the rules (,r) i and (,l) i are problematic for proofs search. We therefore consider the following calculus Definition LK is the sequent calculus in which (,r) i are replaced by (,r) and (,l) i are replaced by (,l) below: Γ A 1,A 2, Γ A 1 A 2, Γ,A 1,A 2 (, l) Γ,A 1 A 2 Theorem LK and LK are equivalent Γ A,B, 1 Γ A B,B, 2 Γ A B,A B, (c,r) Γ A B, (,r) 1,2 and (c,r) simulate (,r) 4

5 Γ A, (w,r) Γ A,B, Γ A B, (w,r) and (,r) simulate (,r) 1,2 LK + (w) = LK LK + (c) = LK Soundness and Completeness of LK Let be derivable in LK Γ = A Γ A Theorem (Soundness). If Γ then Γ =. Axiom A A = A = A (,l) rule: by induction: Γ, A = Γ,A Γ,B (, l) Γ,A B every interpretation is also an interpretation for A B Γ,A B = Γ,B = similarly for the other rules Definition A rule S or S 1 S 2 S S 1 and S 2 (applied bottom up). S 1 is invertible, if whenever S is valid so are Lemma The logical rules of LK are invertible. Theorem (Completeness). If Γ = then Γ. Proof of Completeness. Assume that Γ = and apply the logical rules of LK backwards to the sequent Γ. 5

6 S 1... S n Γ Γ 1 = 1,...,Γ n = n, by Lemma 0.2.1, where S i = Γ i = i. A Γ n and A n and weakening A A (weakening) S n. Hence model theoretic approach proof theoretic approach Corollary Contraction rules and (CUT) are redundant in LK Constructing CNF via LK Theorem For each proposition P a proposition P in CNF can be found such that P P. see p. 73 (Chapter 3) in Gallier s book. 0.3 Equivalence between Axiomatic Systems and LK Axiomatic Systems Natural Deduction Sequent Calculus sound complete Classical Logic SC Ax. S. ND Theorem Γ H A = Γ LK ( ) A axioms: proof in LK all the axioms MP in LK: A A B B A A,B B,A B (, l) A B,A B (CUT) A B (CUT) Theorem Γ H A = Γ LK ( ) A proceeds as the proof Axiomatic Systems by rule). Natural Deduction proof (rule 6

Notes on Natural Logic

Notes on Natural Logic Notes on Natural Logic Notes for PHIL370 Eric Pacuit November 16, 2012 1 Preliminaries: Trees A tree is a structure T = (T, E), where T is a nonempty set whose elements are called nodes and E is a relation

More information

1 FUNDAMENTALS OF LOGIC NO.5 SOUNDNESS AND COMPLETENESS Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ 2 So Far Propositional Logic Logical Connectives(,,, ) Truth Table

More information

Cut-free sequent calculi for algebras with adjoint modalities

Cut-free sequent calculi for algebras with adjoint modalities Cut-free sequent calculi for algebras with adjoint modalities Roy Dyckhoff (University of St Andrews) and Mehrnoosh Sadrzadeh (Universities of Oxford & Southampton) TANCL Conference, Oxford, 8 August 2007

More information

TABLEAU-BASED DECISION PROCEDURES FOR HYBRID LOGIC

TABLEAU-BASED DECISION PROCEDURES FOR HYBRID LOGIC TABLEAU-BASED DECISION PROCEDURES FOR HYBRID LOGIC THOMAS BOLANDER AND TORBEN BRAÜNER Abstract. Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known

More information

Fundamentals of Logic

Fundamentals of Logic Fundamentals of Logic No.4 Proof Tatsuya Hagino Faculty of Environment and Information Studies Keio University 2015/5/11 Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio

More information

2 Deduction in Sentential Logic

2 Deduction in Sentential Logic 2 Deduction in Sentential Logic Though we have not yet introduced any formal notion of deductions (i.e., of derivations or proofs), we can easily give a formal method for showing that formulas are tautologies:

More information

arxiv: v1 [math.lo] 24 Feb 2014

arxiv: v1 [math.lo] 24 Feb 2014 Residuated Basic Logic II. Interpolation, Decidability and Embedding Minghui Ma 1 and Zhe Lin 2 arxiv:1404.7401v1 [math.lo] 24 Feb 2014 1 Institute for Logic and Intelligence, Southwest University, Beibei

More information

Gödel algebras free over finite distributive lattices

Gödel algebras free over finite distributive lattices TANCL, Oxford, August 4-9, 2007 1 Gödel algebras free over finite distributive lattices Stefano Aguzzoli Brunella Gerla Vincenzo Marra D.S.I. D.I.COM. D.I.C.O. University of Milano University of Insubria

More information

5 Deduction in First-Order Logic

5 Deduction in First-Order Logic 5 Deduction in First-Order Logic The system FOL C. Let C be a set of constant symbols. FOL C is a system of deduction for the language L # C. Axioms: The following are axioms of FOL C. (1) All tautologies.

More information

TR : Knowledge-Based Rational Decisions and Nash Paths

TR : Knowledge-Based Rational Decisions and Nash Paths City University of New York (CUNY) CUNY Academic Works Computer Science Technical Reports Graduate Center 2009 TR-2009015: Knowledge-Based Rational Decisions and Nash Paths Sergei Artemov Follow this and

More information

Threshold logic proof systems

Threshold logic proof systems Threshold logic proof systems Samuel Buss Peter Clote May 19, 1995 In this note, we show the intersimulation of three threshold logics within a polynomial size and constant depth factor. The logics are

More information

SAT and DPLL. Introduction. Preliminaries. Normal forms DPLL. Complexity. Espen H. Lian. DPLL Implementation. Bibliography.

SAT and DPLL. Introduction. Preliminaries. Normal forms DPLL. Complexity. Espen H. Lian. DPLL Implementation. Bibliography. SAT and Espen H. Lian Ifi, UiO Implementation May 4, 2010 Espen H. Lian (Ifi, UiO) SAT and May 4, 2010 1 / 59 Espen H. Lian (Ifi, UiO) SAT and May 4, 2010 2 / 59 Introduction Introduction SAT is the problem

More information

A Syntactic Realization Theorem for Justification Logics

A Syntactic Realization Theorem for Justification Logics A Syntactic Realization Theorem for Justification Logics Kai Brünnler, Remo Goetschi, and Roman Kuznets 1 Institut für Informatik und angewandte Mathematik, Universität Bern Neubrückstrasse 10, CH-3012

More information

An Adaptive Characterization of Signed Systems for Paraconsistent Reasoning

An Adaptive Characterization of Signed Systems for Paraconsistent Reasoning An Adaptive Characterization of Signed Systems for Paraconsistent Reasoning Diderik Batens, Joke Meheus, Dagmar Provijn Centre for Logic and Philosophy of Science University of Ghent, Belgium {Diderik.Batens,Joke.Meheus,Dagmar.Provijn}@UGent.be

More information

Harvard School of Engineering and Applied Sciences CS 152: Programming Languages

Harvard School of Engineering and Applied Sciences CS 152: Programming Languages Harvard School of Engineering and Applied Sciences CS 152: Programming Languages Lecture 3 Tuesday, January 30, 2018 1 Inductive sets Induction is an important concept in the theory of programming language.

More information

SAT and DPLL. Espen H. Lian. May 4, Ifi, UiO. Espen H. Lian (Ifi, UiO) SAT and DPLL May 4, / 59

SAT and DPLL. Espen H. Lian. May 4, Ifi, UiO. Espen H. Lian (Ifi, UiO) SAT and DPLL May 4, / 59 SAT and DPLL Espen H. Lian Ifi, UiO May 4, 2010 Espen H. Lian (Ifi, UiO) SAT and DPLL May 4, 2010 1 / 59 Normal forms Normal forms DPLL Complexity DPLL Implementation Bibliography Espen H. Lian (Ifi, UiO)

More information

A Translation of Intersection and Union Types

A Translation of Intersection and Union Types A Translation of Intersection and Union Types for the λ µ-calculus Kentaro Kikuchi RIEC, Tohoku University kentaro@nue.riec.tohoku.ac.jp Takafumi Sakurai Department of Mathematics and Informatics, Chiba

More information

Lecture l(x) 1. (1) x X

Lecture l(x) 1. (1) x X Lecture 14 Agenda for the lecture Kraft s inequality Shannon codes The relation H(X) L u (X) = L p (X) H(X) + 1 14.1 Kraft s inequality While the definition of prefix-free codes is intuitively clear, we

More information

Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable

Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable Shlomo Hoory and Stefan Szeider Department of Computer Science, University of Toronto, shlomoh,szeider@cs.toronto.edu Abstract.

More information

Horn-formulas as Types for Structural Resolution

Horn-formulas as Types for Structural Resolution Horn-formulas as Types for Structural Resolution Peng Fu, Ekaterina Komendantskaya University of Dundee School of Computing 2 / 17 Introduction: Background Logic Programming(LP) is based on first-order

More information

ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse

ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse Linh Anh Nguyen 1 and Andrzej Sza las 1,2 1 Institute of Informatics, University of Warsaw Banacha 2, 02-097 Warsaw, Poland

More information

TR : Knowledge-Based Rational Decisions

TR : Knowledge-Based Rational Decisions City University of New York (CUNY) CUNY Academic Works Computer Science Technical Reports Graduate Center 2009 TR-2009011: Knowledge-Based Rational Decisions Sergei Artemov Follow this and additional works

More information

Semantics with Applications 2b. Structural Operational Semantics

Semantics with Applications 2b. Structural Operational Semantics Semantics with Applications 2b. Structural Operational Semantics Hanne Riis Nielson, Flemming Nielson (thanks to Henrik Pilegaard) [SwA] Hanne Riis Nielson, Flemming Nielson Semantics with Applications:

More information

Orthogonality to the value group is the same as generic stability in C-minimal expansions of ACVF

Orthogonality to the value group is the same as generic stability in C-minimal expansions of ACVF Orthogonality to the value group is the same as generic stability in C-minimal expansions of ACVF Will Johnson February 18, 2014 1 Introduction Let T be some C-minimal expansion of ACVF. Let U be the monster

More information

Search Space and Average Proof Length of Resolution. H. Kleine Buning T. Lettmann. Universitat { GH { Paderborn. Postfach 16 21

Search Space and Average Proof Length of Resolution. H. Kleine Buning T. Lettmann. Universitat { GH { Paderborn. Postfach 16 21 Search Space and Average roof Length of Resolution H. Kleine Buning T. Lettmann FB 7 { Mathematik/Informatik Universitat { GH { aderborn ostfach 6 2 D{4790 aderborn (Germany) E{mail: kbcsl@uni-paderborn.de

More information

Optimal Satisficing Tree Searches

Optimal Satisficing Tree Searches Optimal Satisficing Tree Searches Dan Geiger and Jeffrey A. Barnett Northrop Research and Technology Center One Research Park Palos Verdes, CA 90274 Abstract We provide an algorithm that finds optimal

More information

Focusing on contraction

Focusing on contraction Focusing on contraction Alessandro Avellone 1, Camillo Fiorentini 2, Alberto Momigliano 2 1 DISMEQ, Università degli Studi di Milano-Bicocca 2 DI, Università degli Studi di Milano Abstract. Focusing [1]

More information

Outline Introduction Game Representations Reductions Solution Concepts. Game Theory. Enrico Franchi. May 19, 2010

Outline Introduction Game Representations Reductions Solution Concepts. Game Theory. Enrico Franchi. May 19, 2010 May 19, 2010 1 Introduction Scope of Agent preferences Utility Functions 2 Game Representations Example: Game-1 Extended Form Strategic Form Equivalences 3 Reductions Best Response Domination 4 Solution

More information

Harvard School of Engineering and Applied Sciences CS 152: Programming Languages

Harvard School of Engineering and Applied Sciences CS 152: Programming Languages Harvard School of Engineering and Applied Sciences CS 152: Programming Languages Lecture 2 Thursday, January 30, 2014 1 Expressing Program Properties Now that we have defined our small-step operational

More information

Algorithmic Game Theory and Applications. Lecture 11: Games of Perfect Information

Algorithmic Game Theory and Applications. Lecture 11: Games of Perfect Information Algorithmic Game Theory and Applications Lecture 11: Games of Perfect Information Kousha Etessami finite games of perfect information Recall, a perfect information (PI) game has only 1 node per information

More information

Security issues in contract-based computing

Security issues in contract-based computing Security issues in contract-based computing Massimo Bartoletti 1 and Roberto Zunino 2 1 Dipartimento di Matematica e Informatica, Università degli Studi di Cagliari, Italy 2 Dipartimento di Ingegneria

More information

Implications as rules

Implications as rules ProDi Tübingen 26.2.2011 p. 1 Implications as rules In defence of proof-theoretic semantics Peter Schroeder-Heister Wilhelm-Schickard-Institut für Informatik Universität Tübingen ProDi Tübingen 26.2.2011

More information

Syllogistic Logics with Verbs

Syllogistic Logics with Verbs Syllogistic Logics with Verbs Lawrence S Moss Department of Mathematics Indiana University Bloomington, IN 47405 USA lsm@csindianaedu Abstract This paper provides sound and complete logical systems for

More information

Harvard School of Engineering and Applied Sciences CS 152: Programming Languages

Harvard School of Engineering and Applied Sciences CS 152: Programming Languages Harvard School of Engineering and Applied Sciences CS 152: Programming Languages Lecture 3 Tuesday, February 2, 2016 1 Inductive proofs, continued Last lecture we considered inductively defined sets, and

More information

MIDTERM ANSWER KEY GAME THEORY, ECON 395

MIDTERM ANSWER KEY GAME THEORY, ECON 395 MIDTERM ANSWER KEY GAME THEORY, ECON 95 SPRING, 006 PROFESSOR A. JOSEPH GUSE () There are positions available with wages w and w. Greta and Mary each simultaneously apply to one of them. If they apply

More information

Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable

Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable Shlomo Hoory and Stefan Szeider Abstract (k, s)-sat is the propositional satisfiability problem restricted to instances where each

More information

CS792 Notes Henkin Models, Soundness and Completeness

CS792 Notes Henkin Models, Soundness and Completeness CS792 Notes Henkin Models, Soundness and Completeness Arranged by Alexandra Stefan March 24, 2005 These notes are a summary of chapters 4.5.1-4.5.5 from [1]. 1 Review indexed family of sets: A s, where

More information

CTL Model Checking. Goal Method for proving M sat σ, where M is a Kripke structure and σ is a CTL formula. Approach Model checking!

CTL Model Checking. Goal Method for proving M sat σ, where M is a Kripke structure and σ is a CTL formula. Approach Model checking! CMSC 630 March 13, 2007 1 CTL Model Checking Goal Method for proving M sat σ, where M is a Kripke structure and σ is a CTL formula. Approach Model checking! Mathematically, M is a model of σ if s I = M

More information

Lecture 2: The Simple Story of 2-SAT

Lecture 2: The Simple Story of 2-SAT 0510-7410: Topics in Algorithms - Random Satisfiability March 04, 2014 Lecture 2: The Simple Story of 2-SAT Lecturer: Benny Applebaum Scribe(s): Mor Baruch 1 Lecture Outline In this talk we will show that

More information

Abstract Algebra Solution of Assignment-1

Abstract Algebra Solution of Assignment-1 Abstract Algebra Solution of Assignment-1 P. Kalika & Kri. Munesh [ M.Sc. Tech Mathematics ] 1. Illustrate Cayley s Theorem by calculating the left regular representation for the group V 4 = {e, a, b,

More information

A Knowledge-Theoretic Approach to Distributed Problem Solving

A Knowledge-Theoretic Approach to Distributed Problem Solving A Knowledge-Theoretic Approach to Distributed Problem Solving Michael Wooldridge Department of Electronic Engineering, Queen Mary & Westfield College University of London, London E 4NS, United Kingdom

More information

Strong normalisation and the typed lambda calculus

Strong normalisation and the typed lambda calculus CHAPTER 9 Strong normalisation and the typed lambda calculus In the previous chapter we looked at some reduction rules for intuitionistic natural deduction proofs and we have seen that by applying these

More information

A Decidable Logic for Time Intervals: Propositional Neighborhood Logic

A Decidable Logic for Time Intervals: Propositional Neighborhood Logic From: AAAI Technical Report WS-02-17 Compilation copyright 2002, AAAI (wwwaaaiorg) All rights reserved A Decidable Logic for Time Intervals: Propositional Neighborhood Logic Angelo Montanari University

More information

Tableau-based Decision Procedures for Hybrid Logic

Tableau-based Decision Procedures for Hybrid Logic Tableau-based Decision Procedures for Hybrid Logic Gert Smolka Saarland University Joint work with Mark Kaminski HyLo 2010 Edinburgh, July 10, 2010 Gert Smolka (Saarland University) Decision Procedures

More information

UPWARD STABILITY TRANSFER FOR TAME ABSTRACT ELEMENTARY CLASSES

UPWARD STABILITY TRANSFER FOR TAME ABSTRACT ELEMENTARY CLASSES UPWARD STABILITY TRANSFER FOR TAME ABSTRACT ELEMENTARY CLASSES JOHN BALDWIN, DAVID KUEKER, AND MONICA VANDIEREN Abstract. Grossberg and VanDieren have started a program to develop a stability theory for

More information

Characterisation of Strongly Normalising λµ-terms

Characterisation of Strongly Normalising λµ-terms Characterisation of Strongly Normalising λµ-terms Ugo de Liguoro joint work with Steffen van Bakel and Franco Barbanera ITRS - June 2012, Dubrovnik Introduction Parigot s λµ-calculus is an extension of

More information

A DNC function that computes no effectively bi-immune set

A DNC function that computes no effectively bi-immune set A DNC function that computes no effectively bi-immune set Achilles A. Beros Laboratoire d Informatique de Nantes Atlantique, Université de Nantes July 5, 204 Standard Definitions Definition f is diagonally

More information

Arborescent Architecture for Decentralized Supervisory Control of Discrete Event Systems

Arborescent Architecture for Decentralized Supervisory Control of Discrete Event Systems Arborescent Architecture for Decentralized Supervisory Control of Discrete Event Systems Ahmed Khoumsi and Hicham Chakib Dept. Electrical & Computer Engineering, University of Sherbrooke, Canada Email:

More information

8. Propositional Logic Natural deduction - negation. Solved problems

8. Propositional Logic Natural deduction - negation. Solved problems 8. Propositional Logic Natural deduction - negation Solved problems Problem: A B can be derived from (A B). (De Morgan law) Problem: A B can be derived from (A B). (De Morgan law) Let us first think intuitively

More information

AVL Trees. The height of the left subtree can differ from the height of the right subtree by at most 1.

AVL Trees. The height of the left subtree can differ from the height of the right subtree by at most 1. AVL Trees In order to have a worst case running time for insert and delete operations to be O(log n), we must make it impossible for there to be a very long path in the binary search tree. The first balanced

More information

A relative of the approachability ideal, diamond and non-saturation

A relative of the approachability ideal, diamond and non-saturation A relative of the approachability ideal, diamond and non-saturation Boise Extravaganza in Set Theory XVIII March 09, Boise, Idaho Assaf Rinot Tel-Aviv University http://www.tau.ac.il/ rinot 1 Diamond on

More information

Two Notions of Sub-behaviour for Session-based Client/Server Systems

Two Notions of Sub-behaviour for Session-based Client/Server Systems Two Notions of Sub-behaviour for Session-based Client/Server Systems Franco Barbanera 1 and Ugo de Liguoro 2 1 Dipartimento di Matematica e Informatica, Università di Catania 2 Dipartimento di Informatica,

More information

Lecture 14: Basic Fixpoint Theorems (cont.)

Lecture 14: Basic Fixpoint Theorems (cont.) Lecture 14: Basic Fixpoint Theorems (cont) Predicate Transformers Monotonicity and Continuity Existence of Fixpoints Computing Fixpoints Fixpoint Characterization of CTL Operators 1 2 E M Clarke and E

More information

CATEGORICAL SKEW LATTICES

CATEGORICAL SKEW LATTICES CATEGORICAL SKEW LATTICES MICHAEL KINYON AND JONATHAN LEECH Abstract. Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most

More information

Tableau Theorem Prover for Intuitionistic Propositional Logic

Tableau Theorem Prover for Intuitionistic Propositional Logic Tableau Theorem Prover for Intuitionistic Propositional Logic Portland State University CS 510 - Mathematical Logic and Programming Languages Motivation Tableau for Classical Logic If A is contradictory

More information

Tableau Theorem Prover for Intuitionistic Propositional Logic

Tableau Theorem Prover for Intuitionistic Propositional Logic Tableau Theorem Prover for Intuitionistic Propositional Logic Portland State University CS 510 - Mathematical Logic and Programming Languages Motivation Tableau for Classical Logic If A is contradictory

More information

Finding Equilibria in Games of No Chance

Finding Equilibria in Games of No Chance Finding Equilibria in Games of No Chance Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, and Troels Bjerre Sørensen Department of Computer Science, University of Aarhus, Denmark {arnsfelt,bromille,trold}@daimi.au.dk

More information

In this lecture, we will use the semantics of our simple language of arithmetic expressions,

In this lecture, we will use the semantics of our simple language of arithmetic expressions, CS 4110 Programming Languages and Logics Lecture #3: Inductive definitions and proofs In this lecture, we will use the semantics of our simple language of arithmetic expressions, e ::= x n e 1 + e 2 e

More information

arxiv: v1 [cs.gt] 7 May 2018

arxiv: v1 [cs.gt] 7 May 2018 Optimal Pricing in Repeated Posted-Price Auctions arxiv:1805.02574v1 [cs.gt] 7 May 2018 Arsenii Vanunts Yandex, MSU avanunts@yandex.ru Alexey Drutsa Yandex, MSU adrutsa@yandex.ru 19 March 2018 Abstract

More information

Isabelle/FOL First-Order Logic

Isabelle/FOL First-Order Logic Isabelle/FOL First-Order Logic Larry Paulson and Markus Wenzel October 8, 2017 Contents 1 Intuitionistic first-order logic 2 1.1 Syntax and axiomatic basis................... 2 1.1.1 Equality..........................

More information

The Real Numbers. Here we show one way to explicitly construct the real numbers R. First we need a definition.

The Real Numbers. Here we show one way to explicitly construct the real numbers R. First we need a definition. The Real Numbers Here we show one way to explicitly construct the real numbers R. First we need a definition. Definitions/Notation: A sequence of rational numbers is a funtion f : N Q. Rather than write

More information

Introduction to Greedy Algorithms: Huffman Codes

Introduction to Greedy Algorithms: Huffman Codes Introduction to Greedy Algorithms: Huffman Codes Yufei Tao ITEE University of Queensland In computer science, one interesting method to design algorithms is to go greedy, namely, keep doing the thing that

More information

Mathematical Logic Final Exam 14th June PROPOSITIONAL LOGIC

Mathematical Logic Final Exam 14th June PROPOSITIONAL LOGIC Mathematical Logic Final Exam 14th June 2013 1 PROPOSITIONAL LOGIC Exercise 1. [3 marks] Derive the following formulas via Natural Deduction: (A B) (A B) Solution. See slides of propositional reasoning

More information

Structural Induction

Structural Induction Structural Induction Jason Filippou CMSC250 @ UMCP 07-05-2016 Jason Filippou (CMSC250 @ UMCP) Structural Induction 07-05-2016 1 / 26 Outline 1 Recursively defined structures 2 Proofs Binary Trees Jason

More information

10.1 Elimination of strictly dominated strategies

10.1 Elimination of strictly dominated strategies Chapter 10 Elimination by Mixed Strategies The notions of dominance apply in particular to mixed extensions of finite strategic games. But we can also consider dominance of a pure strategy by a mixed strategy.

More information

Essays on Some Combinatorial Optimization Problems with Interval Data

Essays on Some Combinatorial Optimization Problems with Interval Data Essays on Some Combinatorial Optimization Problems with Interval Data a thesis submitted to the department of industrial engineering and the institute of engineering and sciences of bilkent university

More information

THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET

THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET MICHAEL PINSKER Abstract. We calculate the number of unary clones (submonoids of the full transformation monoid) containing the

More information

Syllogistic Logics with Verbs

Syllogistic Logics with Verbs Syllogistic Logics with Verbs Lawrence S Moss Department of Mathematics Indiana University Bloomington, IN 47405 USA lsm@csindianaedu Abstract This paper provides sound and complete logical systems for

More information

6: MULTI-PERIOD MARKET MODELS

6: MULTI-PERIOD MARKET MODELS 6: MULTI-PERIOD MARKET MODELS Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2016 M. Rutkowski (USydney) 6: Multi-Period Market Models 1 / 55 Outline We will examine

More information

Another Variant of 3sat. 3sat. 3sat Is NP-Complete. The Proof (concluded)

Another Variant of 3sat. 3sat. 3sat Is NP-Complete. The Proof (concluded) 3sat k-sat, where k Z +, is the special case of sat. The formula is in CNF and all clauses have exactly k literals (repetition of literals is allowed). For example, (x 1 x 2 x 3 ) (x 1 x 1 x 2 ) (x 1 x

More information

MAT25 LECTURE 10 NOTES. = a b. > 0, there exists N N such that if n N, then a n a < ɛ

MAT25 LECTURE 10 NOTES. = a b. > 0, there exists N N such that if n N, then a n a < ɛ MAT5 LECTURE 0 NOTES NATHANIEL GALLUP. Algebraic Limit Theorem Theorem : Algebraic Limit Theorem (Abbott Theorem.3.3) Let (a n ) and ( ) be sequences of real numbers such that lim n a n = a and lim n =

More information

Non replication of options

Non replication of options Non replication of options Christos Kountzakis, Ioannis A Polyrakis and Foivos Xanthos June 30, 2008 Abstract In this paper we study the scarcity of replication of options in the two period model of financial

More information

Logic and Artificial Intelligence Lecture 24

Logic and Artificial Intelligence Lecture 24 Logic and Artificial Intelligence Lecture 24 Eric Pacuit Currently Visiting the Center for Formal Epistemology, CMU Center for Logic and Philosophy of Science Tilburg University ai.stanford.edu/ epacuit

More information

Tug of War Game. William Gasarch and Nick Sovich and Paul Zimand. October 6, Abstract

Tug of War Game. William Gasarch and Nick Sovich and Paul Zimand. October 6, Abstract Tug of War Game William Gasarch and ick Sovich and Paul Zimand October 6, 2009 To be written later Abstract Introduction Combinatorial games under auction play, introduced by Lazarus, Loeb, Propp, Stromquist,

More information

Logic and Artificial Intelligence Lecture 25

Logic and Artificial Intelligence Lecture 25 Logic and Artificial Intelligence Lecture 25 Eric Pacuit Currently Visiting the Center for Formal Epistemology, CMU Center for Logic and Philosophy of Science Tilburg University ai.stanford.edu/ epacuit

More information

Introduction An example Cut elimination. Deduction Modulo. Olivier Hermant. Tuesday, December 12, Deduction Modulo

Introduction An example Cut elimination. Deduction Modulo. Olivier Hermant. Tuesday, December 12, Deduction Modulo Tuesday, December 12, 2006 Deduction and Computation Sequent calculus The cut rule The rewrite rules Sequent calculus The cut rule The rewrite rules Deduction system: Gentzen s sequent calculus Γ, P P

More information

Sy D. Friedman. August 28, 2001

Sy D. Friedman. August 28, 2001 0 # and Inner Models Sy D. Friedman August 28, 2001 In this paper we examine the cardinal structure of inner models that satisfy GCH but do not contain 0 #. We show, assuming that 0 # exists, that such

More information

CSE 21 Winter 2016 Homework 6 Due: Wednesday, May 11, 2016 at 11:59pm. Instructions

CSE 21 Winter 2016 Homework 6 Due: Wednesday, May 11, 2016 at 11:59pm. Instructions CSE 1 Winter 016 Homework 6 Due: Wednesday, May 11, 016 at 11:59pm Instructions Homework should be done in groups of one to three people. You are free to change group members at any time throughout the

More information

Microeconomics of Banking: Lecture 5

Microeconomics of Banking: Lecture 5 Microeconomics of Banking: Lecture 5 Prof. Ronaldo CARPIO Oct. 23, 2015 Administrative Stuff Homework 2 is due next week. Due to the change in material covered, I have decided to change the grading system

More information

Brief Notes on the Category Theoretic Semantics of Simply Typed Lambda Calculus

Brief Notes on the Category Theoretic Semantics of Simply Typed Lambda Calculus University of Cambridge 2017 MPhil ACS / CST Part III Category Theory and Logic (L108) Brief Notes on the Category Theoretic Semantics of Simply Typed Lambda Calculus Andrew Pitts Notation: comma-separated

More information

MSU CSE Spring 2011 Exam 2-ANSWERS

MSU CSE Spring 2011 Exam 2-ANSWERS MSU CSE 260-001 Spring 2011 Exam 2-NSWERS Name: This is a closed book exam, with 9 problems on 5 pages totaling 100 points. Integer ivision/ Modulo rithmetic 1. We can add two numbers in base 2 by using

More information

Unary PCF is Decidable

Unary PCF is Decidable Unary PCF is Decidable Ralph Loader Merton College, Oxford November 1995, revised October 1996 and September 1997. Abstract We show that unary PCF, a very small fragment of Plotkin s PCF [?], has a decidable

More information

1 Solutions to Tute09

1 Solutions to Tute09 s to Tute0 Questions 4. - 4. are straight forward. Q. 4.4 Show that in a binary tree of N nodes, there are N + NULL pointers. Every node has outgoing pointers. Therefore there are N pointers. Each node,

More information

Building Infinite Processes from Regular Conditional Probability Distributions

Building Infinite Processes from Regular Conditional Probability Distributions Chapter 3 Building Infinite Processes from Regular Conditional Probability Distributions Section 3.1 introduces the notion of a probability kernel, which is a useful way of systematizing and extending

More information

PARTITIONS OF 2 ω AND COMPLETELY ULTRAMETRIZABLE SPACES

PARTITIONS OF 2 ω AND COMPLETELY ULTRAMETRIZABLE SPACES PARTITIONS OF 2 ω AND COMPLETELY ULTRAMETRIZABLE SPACES WILLIAM R. BRIAN AND ARNOLD W. MILLER Abstract. We prove that, for every n, the topological space ω ω n (where ω n has the discrete topology) can

More information

Notes on the symmetric group

Notes on the symmetric group Notes on the symmetric group 1 Computations in the symmetric group Recall that, given a set X, the set S X of all bijections from X to itself (or, more briefly, permutations of X) is group under function

More information

Best response cycles in perfect information games

Best response cycles in perfect information games P. Jean-Jacques Herings, Arkadi Predtetchinski Best response cycles in perfect information games RM/15/017 Best response cycles in perfect information games P. Jean Jacques Herings and Arkadi Predtetchinski

More information

Yao s Minimax Principle

Yao s Minimax Principle Complexity of algorithms The complexity of an algorithm is usually measured with respect to the size of the input, where size may for example refer to the length of a binary word describing the input,

More information

Homework #4. CMSC351 - Spring 2013 PRINT Name : Due: Thu Apr 16 th at the start of class

Homework #4. CMSC351 - Spring 2013 PRINT Name : Due: Thu Apr 16 th at the start of class Homework #4 CMSC351 - Spring 2013 PRINT Name : Due: Thu Apr 16 th at the start of class o Grades depend on neatness and clarity. o Write your answers with enough detail about your approach and concepts

More information

The Traveling Salesman Problem. Time Complexity under Nondeterminism. A Nondeterministic Algorithm for tsp (d)

The Traveling Salesman Problem. Time Complexity under Nondeterminism. A Nondeterministic Algorithm for tsp (d) The Traveling Salesman Problem We are given n cities 1, 2,..., n and integer distances d ij between any two cities i and j. Assume d ij = d ji for convenience. The traveling salesman problem (tsp) asks

More information

CIS 500 Software Foundations Fall October. CIS 500, 6 October 1

CIS 500 Software Foundations Fall October. CIS 500, 6 October 1 CIS 500 Software Foundations Fall 2004 6 October CIS 500, 6 October 1 Midterm 1 is next Wednesday Today s lecture will not be covered by the midterm. Next Monday, review class. Old exams and review questions

More information

A Property Equivalent to n-permutability for Infinite Groups

A Property Equivalent to n-permutability for Infinite Groups Journal of Algebra 221, 570 578 (1999) Article ID jabr.1999.7996, available online at http://www.idealibrary.com on A Property Equivalent to n-permutability for Infinite Groups Alireza Abdollahi* and Aliakbar

More information

LECTURE 2: MULTIPERIOD MODELS AND TREES

LECTURE 2: MULTIPERIOD MODELS AND TREES LECTURE 2: MULTIPERIOD MODELS AND TREES 1. Introduction One-period models, which were the subject of Lecture 1, are of limited usefulness in the pricing and hedging of derivative securities. In real-world

More information

Interpolation of κ-compactness and PCF

Interpolation of κ-compactness and PCF Comment.Math.Univ.Carolin. 50,2(2009) 315 320 315 Interpolation of κ-compactness and PCF István Juhász, Zoltán Szentmiklóssy Abstract. We call a topological space κ-compact if every subset of size κ has

More information

Matching [for] the Lambda Calculus of Objects

Matching [for] the Lambda Calculus of Objects Matching [for] the Lambda Calculus of Objects Viviana Bono 1 Dipartimento di Informatica, Università di Torino C.so Svizzera 185, I-10149 Torino, Italy e-mail: bono@di.unito.it Michele Bugliesi Dipartimento

More information

Development Separation in Lambda-Calculus

Development Separation in Lambda-Calculus Development Separation in Lambda-Calculus Hongwei Xi Boston University Work partly funded by NSF grant CCR-0229480 Development Separation in Lambda-Calculus p.1/26 Motivation for the Research To facilitate

More information

Strongly compact Magidor forcing.

Strongly compact Magidor forcing. Strongly compact Magidor forcing. Moti Gitik June 25, 2014 Abstract We present a strongly compact version of the Supercompact Magidor forcing ([3]). A variation of it is used to show that the following

More information

Approximate Revenue Maximization with Multiple Items

Approximate Revenue Maximization with Multiple Items Approximate Revenue Maximization with Multiple Items Nir Shabbat - 05305311 December 5, 2012 Introduction The paper I read is called Approximate Revenue Maximization with Multiple Items by Sergiu Hart

More information

THE IRREDUCIBILITY OF CERTAIN PURE-CYCLE HURWITZ SPACES

THE IRREDUCIBILITY OF CERTAIN PURE-CYCLE HURWITZ SPACES THE IRREDUCIBILITY OF CERTAIN PURE-CYCLE HURWITZ SPACES FU LIU AND BRIAN OSSERMAN Abstract. We study pure-cycle Hurwitz spaces, parametrizing covers of the projective line having only one ramified point

More information

GUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv: v1 [math.lo] 25 Mar 2019

GUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv: v1 [math.lo] 25 Mar 2019 GUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv:1903.10476v1 [math.lo] 25 Mar 2019 Abstract. In this article we prove three main theorems: (1) guessing models are internally unbounded, (2)

More information