Fundamentals of Logic

Similar documents

0.1 Equivalence between Natural Deduction and Axiomatic Systems

Threshold logic proof systems

Security issues in contract-based computing

2 Deduction in Sentential Logic

Tableau Theorem Prover for Intuitionistic Propositional Logic

Tableau Theorem Prover for Intuitionistic Propositional Logic

Cut-free sequent calculi for algebras with adjoint modalities

5 Deduction in First-Order Logic

arxiv: v1 [math.lo] 24 Feb 2014

A Syntactic Realization Theorem for Justification Logics

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

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

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

Focusing on contraction

An Adaptive Characterization of Signed Systems for Paraconsistent Reasoning

TABLEAU-BASED DECISION PROCEDURES FOR HYBRID LOGIC

Implications as rules

Isabelle/FOL First-Order Logic

TEST 1 SOLUTIONS MATH 1002

American Option Pricing Formula for Uncertain Financial Market

Axiomatizing the Skew Boolean Propositional Calculus

Notes on Natural Logic

On Lukasiewicz's intuitionistic fuzzy disjunction and conjunction

CS 4110 Programming Languages and Logics Lecture #2: Introduction to Semantics. 1 Arithmetic Expressions

8. Propositional Logic Natural deduction - negation. Solved problems

Horn-formulas as Types for Structural Resolution

Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable

Online Algorithms SS 2013

Philipp Moritz Lücke

Logic and Artificial Intelligence Lecture 24

Contrariety and Subcontrariety: The Anatomy of Negation (with Special Reference to an Example of J.-Y. Béziau)

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

Semantics with Applications 2b. Structural Operational Semantics

Comparing Partial Rankings

On the supposed unity of soritical and semantic paradox

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

Riemannian Geometry, Key to Homework #1

Determinacy models and good scales at singular cardinals

On Toponogov s Theorem

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

Strong normalisation and the typed lambda calculus

BROWNIAN MOTION II. D.Majumdar

Decidability and Recursive Languages

A Knowledge-Theoretic Approach to Distributed Problem Solving

Syllogistic Logics with Verbs

Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable

A Logic-based Approach to Decision Making. Magdalena Ivanovska and Martin Giese

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

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

A semantics for concurrent permission logic. Stephen Brookes CMU

MAC Learning Objectives. Learning Objectives (Cont.)

CS792 Notes Henkin Models, Soundness and Completeness

Lecture 2: The Simple Story of 2-SAT

THE OPERATIONAL PERSPECTIVE

Definition: A proposition is a sentence that is either true or false, but not both.

Designing efficient market pricing mechanisms

A Translation of Intersection and Union Types

Syllogistic Logics with Verbs

Characterizing large cardinals in terms of layered partial orders

monotone circuit value

Generalising the weak compactness of ω

An Axiomatic Study of Scoring Rule Markets. January 2018

Probability Theory and Simulation Methods. April 9th, Lecture 20: Special distributions

Chain conditions, layered partial orders and weak compactness

Practical SAT Solving

Comparing Goal-Oriented and Procedural Service Orchestration

CHOICE THEORY, UTILITY FUNCTIONS AND RISK AVERSION

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

Mathematical Logic Final Exam 14th June PROPOSITIONAL LOGIC

Maximally Consistent Extensions

The illustrated zoo of order-preserving functions

The reverse self-dual serial cost-sharing rule M. Josune Albizuri, Henar Díez and Amaia de Sarachu. April 17, 2012

10/1/2012. PSY 511: Advanced Statistics for Psychological and Behavioral Research 1

A Probabilistic Logic for Sequences of Decisions

ISBN ISSN

Cook s Theorem: the First NP-Complete Problem

Covering properties of derived models

Lecture 2: The Neoclassical Growth Model

Level by Level Inequivalence, Strong Compactness, and GCH

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

4 Martingales in Discrete-Time

First-Order Logic in Standard Notation Basics

On Existence of Equilibria. Bayesian Allocation-Mechanisms

Optimizing S-shaped utility and risk management

Another Variant of 3sat

A Decidable Logic for Time Intervals: Propositional Neighborhood Logic

arxiv: v2 [q-fin.pr] 23 Nov 2017

2. This algorithm does not solve the problem of finding a maximum cardinality set of non-overlapping intervals. Consider the following intervals:

Lecture Notes on Bidirectional Type Checking

being saturated Lemma 0.2 Suppose V = L[E]. Every Woodin cardinal is Woodin with.

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

You may not start to read the questions printed on the subsequent pages of this question paper until instructed that you may do so by the Invigilator

Chapter 4: Estimation

Gödel algebras free over finite distributive lattices

Drunken Birds, Brownian Motion, and Other Random Fun

The Normal Distribution

REWIRING YOUR MATH KNOWLEDGE

GPD-POT and GEV block maxima

3 The Model Existence Theorem

Transcription:

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 of University) Logic 2015/5/11 1 / 17

So Far Propositional Logic Logical connectives Truth table Tautology Normal form Disjunctive normal form Conjunctive normal form Restricting logical connectives Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio of University) Logic 2015/5/11 2 / 17

Inference (Deduction) Using truth table to show the correctness of propositions Calculate the truth value from the truth value of propositional variables. Inference Infer new correct proposition from correct propositions already known Apply inference rules to propositions Infer A from premises B 1,..., B n Inference Rule Rule to infer correct proposition from correct premise propositions Example: From A and A B, infer B modus ponens or syllogium All men are mortal and Socrates is a man, therefore Socrates is mortal. Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio of University) Logic 2015/5/11 3 / 17

Axiom and Theorem Axiom Premises which we believe correct. There is only one straight line which goes through two different points. Parallel straight lines never meet. Theorem Propositions which are inferred from axioms using inference rules Proof is the inference steps of theorem The sum of internal angles of any triangle is 180 degrees. Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio of University) Logic 2015/5/11 4 / 17

Formal Logical Framework Framework for handling logic formally Framework for handling logical formulae Consist of axioms and inference rules Frameworks for Classical Propositional Logic: Hilbert framework (Hilbert style) Axiomatic framework Only one inference rule: modus ponens Natural Deduction by Gentzen NK framework (NK system) Close to ordinary (human) inference Sequent Calculus by Gentzen LK framework (LK system) Easy to formalize Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio of University) Logic 2015/5/11 5 / 17

LK Sequent LK system use sequent: A 1,..., A m B 1,..., B n Antecedent: A 1,..., A m Succedent: B 1,..., B n If A 1 to A m are true, at least one of B 1 to B n is also true. m and/or n may be zero. B 1,..., B n No antecedent At least one of B 1 to B n is true. A 1,..., A m No succedent If A 1 to A m are true, contradicts. At least one of A 1 to A m is not true. No antecedent, no succedent Contradiction. Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio of University) Logic 2015/5/11 6 / 17

LK Axiom and Inference Rules Axiom: Initial Sequent A A Inference rules for structure: (weakening-l) Γ A, Γ (weakening-r) Γ Γ, A (contraction-l) A, A, Γ A, Γ (contraction-r) Γ, A, A Γ, A (exchange-l) Γ, A, B, Π Γ, B, A, Π (exchange-r) Γ, A, B, Σ Γ, B, A, Σ Γ, A A, Π Σ (cut) Γ, Π, Σ (Γ,, Π, Σ are sequences of logical formulae) Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio of University) Logic 2015/5/11 7 / 17

Inference rules Inference rules for logical connectives: ( L1) A, Γ A B, Γ ( L2) B, Γ A B, Γ ( R) Γ, A Γ, B Γ, A B ( L) A, Γ B, Γ A B, Γ ( R1) Γ, A Γ, A B ( R2) Γ, B Γ, A B ( L) Γ, A B, Π Σ A B, Γ, Π, Σ ( R) A, Γ, B Γ, A B ( L) Γ, A A, Γ Initial sequent for propositional constants: ( R) A, Γ Γ, A Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio of University) Logic 2015/5/11 8 / 17

LK Proof Figure LK Proof Figure: Start from initial sequent and apply inference rules The bottom sequent is called end sequent of the proof figure. Example: Proof Figure A A A, A A, A A A A, A A A, A A A A End Sequent: A A When there is a proof figure of which end sequent is S, S is provable in LK. Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio of University) Logic 2015/5/11 9 / 17

Extending Inference Rules Applying inference rules to formula in the sequent other than left-most or right-most one. Using exchange rules, formula at any position can be moved to left-most or right-most position. Extend inference rules of contraction, weakening and logical connectives to formula at any position. When S can be inferred from S 1, S 2,..., S n using LK inference rules, we write: S 1 S 2 S n S The above inference is inferred in LK. Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio of University) Logic 2015/5/11 10 / 17

Meaning of Sequent Theorem: The followings are equivalent: 1 A sequent A 1,..., A m B 1,..., B n is provable in LK. 2 A sequent A 1 A m B 1 B n is provable in LK. 3 A formula A 1 A m B 1 B n is provable in LK. Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio of University) Logic 2015/5/11 11 / 17

Exercise (1) Show the proof figure of (A B) A B Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio of University) Logic 2015/5/11 12 / 17

Exercise (2) Show the proof figure of A B, A B A Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio of University) Logic 2015/5/11 13 / 17

Exercise (3) Show the proof figure of A B (A B) Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio of University) Logic 2015/5/11 14 / 17

Exercise (4) Show the proof figure of A A Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio of University) Logic 2015/5/11 15 / 17

Exercise (5) Show the proof figure of A A Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio of University) Logic 2015/5/11 16 / 17

Summary Inference Axiom Theorem LK System Sequent Initial and End Sequent LK Inference Rules Proof Proof Figure Tatsuya Hagino (Faculty of Environment and InformationFundamentals Studies Keio of University) Logic 2015/5/11 17 / 17