Slides 07 1 Restricted -terms and logics Definition (1D1) A -term P is called a I-term iff, for each subterm with the form x  M in P, x occurs free in.

Slides:



Advertisements
Similar presentations
Completeness and Expressiveness
Advertisements

Some important properties Lectures of Prof. Doron Peled, Bar Ilan University.
Ch 3.2: Solutions of Linear Homogeneous Equations; Wronskian
10 October 2006 Foundations of Logic and Constraint Programming 1 Unification ­An overview Need for Unification Ranked alfabeths and terms. Substitutions.
Possible World Semantics for Modal Logic
Kripke-Style Semantics for Normal Systems Arnon Avron and Ori Lahav Tel Aviv University LATD 2010.
1 In this lecture  Number Theory ● Rational numbers ● Divisibility  Proofs ● Direct proofs (cont.) ● Common mistakes in proofs ● Disproof by counterexample.
1 Logic Logic in general is a subfield of philosophy and its development is credited to ancient Greeks. Symbolic or mathematical logic is used in AI. In.
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 9,10,11- Logic; Deduction Theorem 23/1/09 to 30/1/09.
(CSC 102) Discrete Structures Lecture 14.
Section 1.6: Sets Sets are the most basic of discrete structures and also the most general. Several of the discrete structures we will study are built.
Artificial Intelligence Chapter 14. Resolution in the Propositional Calculus Artificial Intelligence Chapter 14. Resolution in the Propositional Calculus.
Computability and Complexity 9-1 Computability and Complexity Andrei Bulatov Logic Reminder (Cnt’d)
Logic 3 Tautological Implications and Tautological Equivalences
Induction Sections 4.1 and 4.2 of Rosen Fall 2010
Logic in Computer Science Transparency No Chapter 3 Propositional Logic 3.6. Propositional Resolution.
Logic in Computer Science Transparency No Chapter 3 Propositional Logic 3.6. Propositional Resolution 3.7. Natural Deduction.
Regular Expression (EXTRA)
Slides 09 1 Counting the Inhabitants of a Type Given a type , how many closed -terms in  - normal form can receive the type  in TA ? There exists an.
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
Slides 04 1 Deducibility in TA λ Definition (2A9) Let  be a type-context. If there is a TA -deduction of a formula  ' ↦ M:  for some  '   we shall.
PMOS & nMOS pMOS is open when input is high. nMOS is closed when input is high. Always pMOS at top (high) and nMOS at botom (ground) implement F in pMOS.
Slides 05 1 The Principal-Type Algorithm In general a typable term has an infinite set of types in TA. For example, it is possible to assign to I  x 
Restricted Satisfiability (SAT) Problem
Chapter 2 Properties from Algebra
Relations Chapter 9.
Mathematical Induction Assume that we are given an infinite supply of stamps of two different denominations, 3 cents and and 5 cents. Prove using mathematical.
Equational Reasoning Math Foundations of Computer Science.
Methods of Proof & Proof Strategies
1 Preliminaries Precalculus Review I Precalculus Review II
Query Answering Based on the Modal Correspondence Theory Evgeny Zolin University of Manchester Manchester, UK
MATH 224 – Discrete Mathematics
Chapter 3 – Set Theory  .
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Logic CL4 Episode 16 0 The language of CL4 The rules of CL4 CL4 as a conservative extension of classical logic The soundness and completeness of CL4 The.
Advanced Topics in Propositional Logic Chapter 17 Language, Proof and Logic.
P.1 Real Numbers. 2 What You Should Learn Represent and classify real numbers. Order real numbers and use inequalities. Find the absolute values of real.
Of 33 lecture 12: propositional logic – part I. of 33 propositions and connectives … two-valued logic – every sentence is either true or false some sentences.
2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.
0 What logic is or should be Propositions Boolean operations The language of classical propositional logic Interpretation and truth Validity (tautologicity)
Axiomatic Method A procedure by which we demonstrate as fact (prove) results (theorems) discovered by experimentation, observation, trial and error or.
Digraphs and Relations Warm Up. The Divisibility Relation Let “|” be the binary relation on N×N such that a|b (“a divides b”) iff there is an n ∈ N such.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Postulates and Algebraic Proofs Advanced Geometry Deductive Reasoning Lesson 2.
Section 2.3 Properties of Solution Sets
1 Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 2: Logic & Incidence Geometry Back To the Very Basic Fundamentals.
Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
© Kenneth C. Louden, Chapter 11 - Functional Programming, Part III: Theory Programming Languages: Principles and Practice, 2nd Ed. Kenneth C. Louden.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
CS6133 Software Specification and Verification
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
Mathematical Preliminaries
Of 38 lecture 13: propositional logic – part II. of 38 propositional logic Gentzen system PROP_G design to be simple syntax and vocabulary the same as.
2007 D iscrete The foundations C ounting theory N umber theory G raphs & trees structure s
Copyright © Curt Hill Axiomatic Approach Some needed groundwork.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Week 4 - Friday.  What did we talk about last time?  Floor and ceiling  Proof by contradiction.
Infinite Models for Propositional Calculi Zachary Ernst University of Missouri-Columbia
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Propositional Logic. Assignment Write any five rules each from two games which you like by using propositional logic notations.
CHAPTER 2 Boolean algebra and Logic gates
2. The Logic of Compound Statements Summary
Lecture 1 – Formal Logic.
Cirquent calculus Episode 15 About cirquent calculus in general
Computer Security: Art and Science, 2nd Edition
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
Episode 14 Logic CL4 The language of CL4 The rules of CL4
Presentation transcript:

Slides 07 1 Restricted -terms and logics Definition (1D1) A -term P is called a I-term iff, for each subterm with the form x  M in P, x occurs free in M at least once. Example: I  x  x is a I-term; K  xy  x is a non- I-term. Sometimes unrestricted -terms are called K- terms. I-terms are terms without vacuous binding.

Slides 07 2 Definition (1D2) A BCK -term is a -term P such that (i)for each subterm x  M of P, x occurs free in M at most once, (ii)each free variable of P has just one occurrence free in P. Examples: the following are BCK -terms: I  x  x, B  xyz  x(yz), B'  xyz  y(xz), C  xyz  xzy, K  xy  x, C 0  xy  y, C 1  xy  xy The following are not: C 2  xy  x(xy), S  xyz  xz(yz), W  xy  xyy

Slides 07 3 Definition (1D3) A BCI -term or linear -term is a -term P such that (i)for each subterm x  M of P, x occurs free in M exactly once, (ii)each free variable of P has just one occurrence free in P. Every BCI -term is a BCK -term, but the BCK - term K is not a BCI -term. A term is a BCI -term iff it is both a I-term and a BCK -term.

Slides 07 4 Definition (6C2) The implicational fragment of BCK-logic is defined exactly like intuitionistic logic in (6A2) on Slide 06.19, except that multiple discharging is not allowed. That is, when (  I) is used, its discharge-label must either be vacuous or contain only one occurrence of . BCK-logic is a logic in which an assumption cannot be used more than once; it is a logic of non-reusable information. Example: the proof of (a  a  c)  a  a  c in (6A2.2) is a BCK-proof.

Slides 07 5 Definition (6C3) The implicational fragment of BCI-logic is defined exactly like intuitionistic logic in (6A2) on Slide 06.19, except that both vacuous and multiple discharging are forbidden. That is, when (  I) is used, its discharge-label must contain exactly one occurrence of . BCI-logic is a relevance logic of non-reusable information. Example: the proof of (a  a  c)  a  a  c in (6A2.2) is also a BCI-proof.

Slides 07 6 Definition (6C1) The definition of the relevance logic R  is exactly like that of intuitionistic logic in (6A2) on Slide 06.19, except that vacuous discharging is forbidden. That is, when  is the conclusion of rule (  I), its discharge-label must contain at least one occurrence of . Example: the formula (a  a  c)  a  a  c is provable in R  (see 6A2.2).

Slides 07 7 Motivation for R  : In one important view of implication, a formula  should not be provable unless  is in some way relevant to . In this view the formula a  b  a is not universally valid, because it says in essence that if a statement a is true then every other statement b implies it, even when b has no connection with the meaning of a. R  is one of the earliest and simplest attempts to capture the notion of relevant implication. In it, we can only prove  when  has actually been used in the deduction of .

Slides 07 8 Refined Curry-Howard Theorem (6C5) (i)The provable formulas of R , BCK-logic, and BCI-logic are exactly the types of the following -terms: R  : types of the closed I-terms; BCK-logic: types of the closed BCK -terms; BCI-logic: types of the closed BCI -terms. (ii)The relation  1,...,  n ⊢  holds in R , BCK-logic or BCI-logic iff there exist M and x 1,..., x n (distinct) such that x 1 :  1,..., x n :  n ⊢ M:  and M is, respectively, a I-term, BCK -term or BCI -term.

Slides 07 9 Axiomatic (Hilbert-style) Systems Definition (6D1) Let A be any set of implicational formulas that are tautologies in the classical truth-table sense. Then A generates the following Hilbert-style system, which will be called the corresponding A-logic. Axioms: the members of A. Deduction-rules:   (  E):  [often called modus ponens]  (Sub):  [ if s is a substitution and no variable in Dom(s) s(  ) occurs in a non-axiom assumption in the deduction above the line ]

Slides Deductions in an A-logic are trees, with axioms and assumptions at the tops of branches and the conclusion at the bottom of the tree. The notation  1,...,  n ⊢ A  means that there is a deduction whose non-axiom assumptions are some or all of  1,...,  n and whose conclusion is . (  1,...,  n need not all be distinct.) When n = 0, the deduction is called a proof of  and we call  a provable formula or theorem of the A-logic in question, and we write ⊢ A . The set of all theorems in an A-logic may be called A ⊢.

Slides The rule (Sub) is the substitution rule. Its side-condition says that substitutions may be made only for variables that occur in axioms.

Slides Example (6D1.2): Let A contain the formulas C  (a  b  c)  b  a  c and K  a  b  a, and s  [(a  b  a)/b, a/c]. Then the following deduction gives ⊢ A a  a. (a  b  c)  b  a  c a  b  a  (Sub)  (Sub) (a  (a  b  a)  a)  (a  b  a)  a  a a  (a  b  a)  a  (  E) (a  b  a)  a  a a  b  a  (  E) a  a

Slides Definition (6D2) In any A-logic, a substitutions- first deduction is a deduction in which the rule (Sub) is only applied to axioms. Lemma (6D2.1) In any A-logic, every deduction  can be replaced by a substitutions-first deduction  * with the same assumptions, axioms and conclusion.

Slides Proof of Lemma (6D2.1): Suppose the rule (Sub) is applied below an application of the rule (  E), as follows:   (  E)   (Sub)  s(  ) Then (Sub) can be moved up above (  E), thus:   (Sub)  (Sub)  s(  )  s(  ) s(  ) (  E)  s(  )

Slides Two successive (Sub)'s can be combined into one. The moving-up procedure ends when all (Sub)'s are at the tops of branches in the deduction tree. By the restriction on (Sub) in (6D1), the top formula of each of these branches cannot be a non-axiom assumption, so it must be an axiom.

Slides Definition (6D3) Hilbert-style intuitionistic logic of implication is the A-logic whose A has just the following four members: (B) (a  b)  (c  a)  (c  b), (C) (a  b  c)  b  a  c, (K) a  b  a, (W)(a  a  b)  a  b.

Slides Definition (6D4) Hilbert-style R  is the A- logic whose A has just the following four members: (B) (a  b)  (c  a)  (c  b), (C) (a  b  c)  b  a  c, (I) a  a, (W)(a  a  b)  a  b.

Slides Definition (6D5) Hilbert-style BCK-logic of implication is the A-logic whose A has just the following three members: (B) (a  b)  (c  a)  (c  b), (C) (a  b  c)  b  a  c, (K) a  b  a.

Slides Definition (6D6) Hilbert-style BCI-logic of implication is the A-logic whose A has just the following three members: (B) (a  b)  (c  a)  (c  b), (C) (a  b  c)  b  a  c, (I) a  a.

Slides Example: By Example (6D1.2) I  a  a is provable in Hilbert-style BCK-logic and in Hilbert- style intuitionistic logic.

Slides (B), (C), (I), (K), and (W) are the principal types of the - terms B, C, I, K and W. Each of the formulas also expresses a property of implication that has its own interest quite independently of type-theory. (I)  a  a indicates the reflexivity property of implication, (C)  (a  b  c)  b  a  c states that hypotheses can be commuted, (K)  a  b  a states that redundant hypotheses can be added, (W)  (a  a  b)  a  b states that duplicates can be removed, (B)  (a  b)  (c  a)  (c  b) indicates a transitivity property of implication or a "right-handed" replacement property which says that if a  b holds, then a may be replaced by b in the formula c  a.

Slides Definition (9F1) If S is a set of -terms, an S-combination, or applicative combination of members of S, is a -term built from some or all of the members of S by application only. An S-and-variables combination is an applicative combination of members of S and variables. For subsets of {B, B', C, I, K, S, W} (see Slide 2) the S- combinations will be called BCK-combinations, BCIW- combinations,etc. Examples: If S = {B, C, K} then CKK and B are S- combinations and CKx, xy and CKK are S-and-variables combinations. But x.BC is neither an S-combination nor an S-and-variables combination.

Slides CKK  ?

Slides Curry-Howard Theorem for Hilbert systems (6D7) Let {C 1, C 2,...} be a finite or infinite set of typable closed -terms and let A = {  1,  2,...} where  i  PT(C i ). Then (i)the theorems of A-logic are exactly the types of the typable applicative combinations of C 1, C 2,..., (ii)the relation  1,...,  n ⊢ A  holds iff there exist an applicative combination M of C 1, C 2,..., and some distinct term-variables x 1,..., x n, such that x 1 :  1,..., x n :  n ⊢ M: .

Slides Proof: Part (i) is a special case of (ii) with n = 0. We prove (ii). First, the "if"-part. Let M be an applicative combination of x 1,..., x n, C 1, C 2,..., and let  be a TA -deduction of x 1 :  1,..., x n :  n ↦ M: . (1) Corresponding to each occurrence of a C i in M there will be an occurrence of ↦ C i :s(  i ) in  for some substitution s. Remove from  all steps above these occurrences of C 1, C 2,..., and replace each formula ↦ C i :s(  i ) by the type s(  i ). Then replace every other formula in , say  ↦ N: , by the type . The result is a Hilbert-style deduction giving  1,...,  n ⊢ .(2)

Slides Now, we prove the "only if"-part. Let  1,...,  n ⊢  in A- logic. Then by Lemma (6D2.1) there is a deduction  of  in which (Sub) is only applied to axioms. Change  to a TA - deduction as follows. First choose some distinct term- variables x 1,..., x n and replace each undischarged branch- top occurrence of each  i in  by x i :  i ↦ x i :  i. Next, since each application of (Sub) in  will be applied to an axiom to give, say, ↦ s(  k ); replace it by a TA -proof of ↦ C k :s(  k ). Then replace the logic rule (  E) by the TA -rule (  E) throughout. The result is a TA -deduction of (1) for some term M as required.

Slides Theorem (6D8: Hilbert-Gentzen link) For the intuitionistic logic, R  -logic, BCK- logic, and BCI-logic, the relation  1,...,  n ⊢  holds in the Natural Deduction version iff it holds in the Hilbert version. Note: This link is usually proved directly using the so- called Deduction Theorem, without going through - calculus.