Applied Logics - A Review and Some New Results
|
|
- Amelia Owen
- 5 years ago
- Views:
Transcription
1 Applied Logics - A Review and Some New Results ICLA 2009 Esko Turunen Tampere University of Technology Finland January 10, 2009
2 Google Maps Introduction
3 Google Maps Introduction
4 Some historical remarks Modern mathematical logic was born some 150 years ago due to the need of clarifying the basis of mathematical reasoning: to answer questions like what is a well founded theory, what is a mathematical proof, etc. Disregarding maybe electrical circuits, mathematical logic was not much applied outside mathematics. Even today applying logic means for most of us solving mathematical problems by tools constructed by logicians - model theory is a good example. However, the last few decades have dramatically changed the situation. Indeed, there are traffic signal systems and natural reservoir regulation that are based on logical formalism, there are data mining soft wares that use first order logic, etc just to mention examples from my home country. However, the logics we are talking about are not Boolean logic but its generalizations and modifications.
5 Some historical remarks In the early twentieth century L. E. J. Brouwer represented his intuitionist logic, a more rigid logic than that of North Whitehead s and Bertrand Russell s formalism, today known as classical mathematical logic. A contemporary Jan Lukasiewicz was a pioneer investigator of multi-valued logics; his three-valued propositional calculus was introduced in However, this logic and his more general infinite valued logic was for decades far from the main stream in logic research. It was only in 1935 when Morchaj Wajsberg showed that infinite valued sentential logic was complete with respect to the axioms conjectured by Lukasiewicz. In 1957 C.C. Chang gave an algebraic proof for the same fact. Lukasiewicz predicate logic does not enjoy the completeness property. However, proved by Scarpellini in 1962, the predicate version of Lukasiewicz infinite valued logic becomes complete after adding an infinitary rule of inference. In 1965 Zadeh introduced Fuzzy Sets and this relieved a research boom in many valued logics.
6 Pavelka logic MV algebra Semantics Syntax In Lukasiewicz infinite valued propositional logic there are four axioms and Modus Ponens as a rule of inference. Formulae are valuated on the real unit interval [0, 1]. Unlike in classical logic, = α α&α. In 1979 Jan Pavelka extended Lukasiewicz logic by adding truth constants: they generalize the symbols and of classical logic. For each real in [0, 1] there is a truth constant in the formal language F. Unfortunately the language is no more countable (this problem was solved by Hájek who showed that it is enough to have a truth constant for each rational in [0, 1]). Pavelka also introduced a formal fuzzy theory and the concepts partial tautology and partial proof: He also proved that they coincide. Most remarkable is that everything that can be done in Boolean logic can be done in Lukasiewicz-Pavelka graded logic, too.
7 Pavelka logic MV algebra Semantics Syntax To understand Lukasiewicz Pavelka logic we need some algebra. An MV-algebra L = L,,, 0 is a structure such that L,, 0 is a commutative monoid, i.e., x y = y x, (1) x (y z) = (x y) z, (2) holds for all elements x, y, z L and, moreover, x 0 = x (3) x = x, (4) x 0 = 0, (5) (x y) y = (y x) x. (6)
8 Pavelka logic MV algebra Semantics Syntax Denote x y = (x y ) and 1 = 0. Then L,, 1 is another commutative monoid and hence x y = y x, (7) x (y z) = (x y) z, (8) x 1 = x (9) holds for all elements x, y, z L. It is obvious that x y = (x y ), thus the triple,, satisfies De Morgan laws. A partial order on the set L is introduced by By setting x y iff x y = 1 iff x y = 0. (10) x y = (x y) y, (11) x y = (x y ) [= (x y) y] (12) for all x, y, z L the structure L,, is a lattice.
9 Pavelka logic MV algebra Semantics Syntax Moreover, x y = (x y ) holds and therefore the triple,,, too, satisfies De Morgan laws. However, the unary operation called complementation is not a lattice complementation. By stipulating x y = x y (13) the structure L,,,,, 0, 1 is a residuated lattice with the bottom and top elements 0, 1, respectively [Ono s FL ew algebras!]. In particular, a Galois connection x y z iff x y z (14) holds for all x, y, z L. The couple, is an adjoint couple. Lattice operations on L can now be expressed via x y = (x y) y, (15) x y = x (x y). (16)
10 Pavelka logic MV algebra Semantics Syntax A standard example of an MV algebra is Lukasiewicz structure L: the underlying set is the real unit interval [0, 1] equipped with the usual order and, for each x, y [0, 1], Moreover, x y = min{x + y, 1}, (17) x = 1 x. (18) x y = max{0, x + y 1}, (19) x y = max{x, y}, (20) x y = min{x, y}, (21) x y = min{1, 1 x + y}, (22) x y = max{x y, 0}. (23) Boolean algebras are MV algebras where = and =.
11 Pavelka logic MV algebra Semantics Syntax Proved by Turunen in 1995, Pavelka s program is realizable in any injective MV algebra. Thus, assume a language F of sentential logic with truth constants is given. Any mapping v : F a L such that v(a) = a for all truth constants a extends into F by v(α imp β) = v(α) v(β) and v(α and β) = v(α) v(β). Such mappings v are called valuations. The degree of tautology is C sem (α) = {v(α) v is a valuation }. Fix a fuzzy set T F of wffs and consider valuations v such that T (β) v(β) for all wffs β. If such a valuation v exists, the T is called satisfiable. We say that T is a fuzzy theory and formulae α such that T (α) 0 are the non logical axioms of the fuzzy theory T. Then we consider values C sem (T )(α) = {v(α) v is a valuation, v satisfies T }.
12 Pavelka logic MV algebra Semantics Syntax There are eleven logical axioms denoted by a set A. A fuzzy rule of inference is a scheme α 1,, α n, a 1,, a n r syn (α 1,, α n ) r sem (α 1,, α n ), where the wffs α 1,, α n are premises and the wff r syn (α 1,, α n ) is the conclusion. The values a 1,, a n and r sem (α 1,, α n ) L are the corresponding truth values. The mappings r sem : L n L are semi continuous, i.e. r sem (α 1,, j Γ a k j,, α n ) = j Γ r sem (α 1,, a kj,, α n ) holds for all 1 k n. Moreover, fuzzy rules are required to be sound in a sense that r sem (v(α 1 ),, v(α n )) v(r syn (α 1,, α n )) holds for all valuations v.
13 Pavelka logic MV algebra Semantics Syntax The following are examples of fuzzy rules of inference, denoted by a set R: Generalized Modus Ponens : a Lifting rules : α, α imp β, a, b β a b α, b a imp α a b where a is an inner truth constant. Rule of Bold Conjunction: α, β, a, b α and β a b Proved by Turunen in 1997, any classical rule of inference has a sound counterpart in Pavelka logic!
14 Pavelka logic MV algebra Semantics Syntax A meta proof w of a wff α in a fuzzy theory T is a finite sequence α 1, a 1.. α m, a m where (i) α m = α, (ii) for each i, 1 i m, α i is a logical axiom, or is a non logical axiom, or there is a fuzzy rule of inference in R and wff formulae α i1,, α in with i 1,, i n < i such that α i = r syn (α i1,, α in ), (iii) for each i, 1 i m, the value a i L is given by a if α i is the axiom a 1 if α a i = i is in A T (α i ) if α i is a non logical axiom r sem (a i1,, a in ) if α i = r syn (α i1,, α in ) The value a m is called the degree of the meta proof w.
15 Pavelka logic MV algebra Semantics Syntax Since a wff α may have various meta proofs with different degrees, we define the degree of deduction of a formula α to be the supremum of all such values, i.e., C syn (T )(α) = {a m w is a meta proof for α in T }. A fuzzy theory T is consistent if C sem (T )(a) = a for all inner truth values a. Any satisfiable fuzzy theory is consistent. Theorem (Completeness of Pavelka style sentential logic) In consistent fuzzy theories T, C sem (T )(α) = C syn (T )(α), α F. Thus, in Pavelka style fuzzy sentential logic we may talk about tautologies of a degree a and theorems of a degree a for all truth values a L, and these concepts coincide.
16 Basic ideas A continuous valued extension In 1977 Belnap introduced four possible values associated with a formula α in first order logic. They are true, false, contradictory and unknown: 1. if there is evidence for α and no evidence against α, then α obtains the value true 2. if there is no evidence for α and evidence against α, then α obtains the value false 3. a value contradictory corresponds to a situation where there is simultaneously evidence for α and against α and, finally, 4. α is labeled by value unknown if there is no evidence for α nor evidence against α. More formally, the values are associated with ordered couples 1, 0, 0, 1, 1, 1 and 0, 0, respectively.
17 Basic ideas A continuous valued extension In 1998, 2007, Perny, Tsoukias and Özturk imposed - being unaware of MV algebras a continuous valued extension of. Given an ordered couple B(α), B( α), graded values are to be computed via t(α) = min{b(α), 1 B( α)}, (24) k(α) = max{b(α) + B( α) 1, 0}, (25) u(α) = max{1 B(α) B( α), 0}, (26) f (α) = min{1 B(α), B( α)}. (27) The intuitive meaning of B(α) and B( α) is the degree of evidence for α and against α, respectively. Moreover, the set of 2 2 matrices of a form [ ] f (α) k(α) u(α) t(α) is denoted by M. However, assuming a Boolean structure in M leads to anomalies.
18 New results Example We show how Belnap s ideas can be extended to a Pavelka style fuzzy sentential logic. We star by presenting some new algebraic results. Let L = L,,, 0 be an MV algebra. The product set L L can be equipped with an MV structure by setting a, b c, d = a c, b d, (28) a, b = a, b, (29) 0 = 0, 1 (30) for each ordered couple a, b, c, d L L. The order on L L is defined via a, b c, d if and only if a c, d b, (31)
19 New results Example The lattice operations are defined by and an adjoin couple, by a, b c, d = a c, b d, (32) a, b c, d = a c, b d, (33) a, b c, d = a c, b d, (34) a, b c, d = a c, (d b). (35) Notice that a c = a c and (d b) = (d b) = d b = b d.
20 New results Example Definition Given an MV-algebra L, denote the structure described via (28) - (35) by L EC and call it the MV algebra of evidence couples induced by L. Moreover, denote {[ a M = ] } b a b a b a b a, b L L and call it the set of evidence matrices induced by evidence couples. Then we have Theorem There is a one to one correspondence between L L and M: if A, B M are two evidence matrices induced by evidence couples a, b and x, y, respectively, then A = B if and only if a = x and b = y.
21 New results Example Next we observe that the MV structure descends from L EC to M in a natural way: if A, B M are two evidence matrices induced by evidence couples a, b and x, y, respectively, then the evidence couple a x, b y induces an evidence matrix C = [ (a x) (b y) (a x) (b y) (a x) (b y) (a x) (b y) Thus, we may define a binary operation on M by [ a ] [ b a b x ] y x y a b a b x y x y = C. ].
22 New results Example Similarly, if A M is an evidence matrix induced by an evidence couple a, b, then the evidence couple a, b induces an evidence matrix [ a b A a = b ] a b a. b In particular, the evidence couple 0, 1 induces the following evidence matrix [ 0 F = ] [ ] =. 0 0 Theorem Let L be an MV algebra. The structure M = M,,, F as defined above is an MV-algebra (called the MV algebra of evidence matrices).
23 New results Example Our main algebraic result is the following Theorem L is an injective MV algebra if, and only if the corresponding MV algebra of evidence matrices M is an injective MV algebra. A immediate consequence is that, starting from an injective MV algebra L, the corresponding M valued sentential logic is a sound and complete logic in Pavelka sense. Applications of this logic are now intensively studied in decision making theory.
24 New results Example To illustrate the use of this logic, assume we have the following four non logical axioms and evidence couples [0, 1] [0, 1]: Statement formally evidence (1) If wages rise or prices rise there will be inflation (p or q) imp r 1, 0 (2) In case of inflation, Government will stop it or people will suffer r imp (s or t) 0.9, 0.1 (3) If people will suffer, Government will lose popularity t imp w 0.8, 0.1 (4) Government will not stop inflation and will not lose popularity non s and non w 1, 0
25 New results Example 1 T is satisfiable and therefore consistent. Indeed, the evidence matrix induced by the following evidence couples satisfies T. Atomic formula Evidence couple p 0.3, 0.8 q 0, 1 r 0.3, 0.8 s 0, 1 t 0.2, 0.9 w 0, 1
26 New results Example 2 What can be said on logical cause about the claim wages will not rise, formally expressed by non p? The above consideration on evidence couples associates with (non p) an evidence couple 0.3, 0.8 = 0.7, 0.2 and the corresponding valuation v is given by the evidence matrix v(non p) = [ ] = [ and the degree of tautology of (non p) is less than or equal to v(non p). 3 We prove that the degree of tautology of the wff (non p) cannot be less that v(non p), thus it is equal to v(non p). ],
27 New results Example To this end consider the following meta proof: (1) (p or q) imp r 1, 0 non logical axiom (2) r imp (s or t) 0.9, 0.1 non logical axiom (3) t imp w 0.8, 0.1 non logical axiom (4) non s and non w 1, 0 non logical axiom (5) non w 1, 0 (4), GS2 (6) non s 1, 0 (4), GS1 (7) non t 0.8, 0.1 (5), (3), GMTT (8) non s and non t 0.8, 0.1 (6), (7), RBC (9) non (s or t) 0.8, 0.1 (8), GDeM1 (10) non r 0.7, 0.2 (9), (2), GMTT (11) non (p or q) 0.7, 0.2 (10), (1) GMTT (12) non p and non q 0.7, 0.2 (11), GDeM2 (13) non p 0.7, 0.2 (12), GS1
28 New results Example 4 By completeness of T we conclude C sem (T )(non p) = C syn (T )(non p) = [ We interpret this result by saying that, from a logical point of view, the claim wages will not rise is (much) more true than false, is not contradictory but lacks some information. Two marginal notes 1 The meta logic of Pavelka logic is Boolean logic. 2 In a philosophical sense, evidence matrices are not really truth-values. ].
29 Introduction New results Example
Paraconsistent Semantics for Pavelka Style Fuzzy Sentential Logic
1 1 Paraconsistent Semantics for Pavelka Style Fuzzy Sentential Logic E. Turunen, P.O. Box 553, 33101 Tampere, Finland M. Öztürk Artois, F 62307 Lens, France, A. Tsoukias 75775, Paris, France. May 26,
More informationParaconsistent Semantics for Pavelka Style Fuzzy Sentential Logic
Paraconsistent Semantics for Pavelka Style Fuzzy Sentential Logic E. Turunen Tampere Univ. of Technology, P.O. Box 553, 33101 Tampere, Finland, M. Öztürk CRIL, Univ. d Artois, F 62307 Lens, France, A.
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
More informationCHAPTER 11. Introduction to Intuitionistic Logic
CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated
More informationFuzzy Logic in Narrow Sense with Hedges
Fuzzy Logic in Narrow Sense with Hedges ABSTRACT Van-Hung Le Faculty of Information Technology Hanoi University of Mining and Geology, Vietnam levanhung@humg.edu.vn arxiv:1608.08033v1 [cs.ai] 29 Aug 2016
More information03 Review of First-Order Logic
CAS 734 Winter 2014 03 Review of First-Order Logic William M. Farmer Department of Computing and Software McMaster University 18 January 2014 What is First-Order Logic? First-order logic is the study of
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 informationcis32-ai lecture # 18 mon-3-apr-2006
cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem
More informationPropositional logic. First order logic. Alexander Clark. Autumn 2014
Propositional logic First order logic Alexander Clark Autumn 2014 Formal Logic Logical arguments are valid because of their form. Formal languages are devised to express exactly that relevant form and
More informationPropositional Logics and their Algebraic Equivalents
Propositional Logics and their Algebraic Equivalents Kyle Brooks April 18, 2012 Contents 1 Introduction 1 2 Formal Logic Systems 1 2.1 Consequence Relations......................... 2 3 Propositional Logic
More informationChapter 2: Introduction to Propositional Logic
Chapter 2: Introduction to Propositional Logic PART ONE: History and Motivation Origins: Stoic school of philosophy (3rd century B.C.), with the most eminent representative was Chryssipus. Modern Origins:
More informationSome consequences of compactness in Lukasiewicz Predicate Logic
Some consequences of compactness in Lukasiewicz Predicate Logic Luca Spada Department of Mathematics and Computer Science University of Salerno www.logica.dmi.unisa.it/lucaspada 7 th Panhellenic Logic
More information3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.
1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is
More informationConstructions of Models in Fuzzy Logic with Evaluated Syntax
Constructions of Models in Fuzzy Logic with Evaluated Syntax Petra Murinová University of Ostrava IRAFM 30. dubna 22 701 03 Ostrava Czech Republic petra.murinova@osu.cz Abstract This paper is a contribution
More informationPropositional logic (revision) & semantic entailment. p. 1/34
Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)
More informationFirst Order Logic: Syntax and Semantics
CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday
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 informationPřednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1
Přednáška 12 Důkazové kalkuly Kalkul Hilbertova typu 11/29/2006 Hilbertův kalkul 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: A. a language B. a set of axioms C. a set of
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 informationOn Urquhart s C Logic
On Urquhart s C Logic Agata Ciabattoni Dipartimento di Informatica Via Comelico, 39 20135 Milano, Italy ciabatto@dsiunimiit Abstract In this paper we investigate the basic many-valued logics introduced
More information1. Algebra H-B-M-S- <A, 0, 1,,,,,, >
Bulletin of the Section of Logic Volume 17:3/4 (1988), pp. 127 133 reedition 2005 [original edition, pp. 127 137] Alexander S. Karpenko ALGEBRAIC STRUCTURE OF THE TRUTH-VALUES FOR L ω This paper is an
More informationAn Introduction to Modal Logic III
An Introduction to Modal Logic III Soundness of Normal Modal Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, October 24 th 2013 Marco Cerami
More informationKLEENE LOGIC AND INFERENCE
Bulletin of the Section of Logic Volume 4:1/2 (2014), pp. 4 2 Grzegorz Malinowski KLEENE LOGIC AND INFERENCE Abstract In the paper a distinguished three-valued construction by Kleene [2] is analyzed. The
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationFleas and fuzzy logic a survey
Fleas and fuzzy logic a survey Petr Hájek Institute of Computer Science AS CR Prague hajek@cs.cas.cz Dedicated to Professor Gert H. Müller on the occasion of his 80 th birthday Keywords: mathematical fuzzy
More informationNon-classical Logics: Theory, Applications and Tools
Non-classical Logics: Theory, Applications and Tools Agata Ciabattoni Vienna University of Technology (TUV) Joint work with (TUV): M. Baaz, P. Baldi, B. Lellmann, R. Ramanayake,... N. Galatos (US), G.
More informationApplied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018
More informationPropositional Logic Language
Propositional Logic Language A logic consists of: an alphabet A, a language L, i.e., a set of formulas, and a binary relation = between a set of formulas and a formula. An alphabet A consists of a finite
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
More informationIntroduction to Fuzzy Sets and Fuzzy Logic
Introduction to Fuzzy Sets and Fuzzy Logic Luca Spada Department of Mathematics and Computer Science University of Salerno www.logica.dmi.unisa.it/lucaspada REASONPARK. Foligno, 17-19 September 2009 1/
More informationPropositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38
Propositional Logic Jason Filippou CMSC250 @ UMCP 05-31-2016 ason Filippou (CMSC250 @ UMCP) Propositional Logic 05-31-2016 1 / 38 Outline 1 Syntax 2 Semantics Truth Tables Simplifying expressions 3 Inference
More informationChapter I: Introduction to Mathematical Fuzzy Logic
Chapter I: Introduction to Mathematical Fuzzy Logic LIBOR BĚHOUNEK, PETR CINTULA, AND PETR HÁJEK This chapter provides an introduction to the field of mathematical fuzzy logic, giving an overview of its
More informationCHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC
CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC 1 Motivation and History The origins of the classical propositional logic, classical propositional calculus, as it was, and still often is called,
More informationFuzzy Logic. 1. Motivation, history and two new logics. Petr Cintula. Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic
Fuzzy Logic 1. Motivation, history and two new logics Petr Cintula Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic www.cs.cas.cz/cintula/mfl-tuw Petr Cintula (CAS) Fuzzy
More informationPropositional Logic Arguments (5A) Young W. Lim 10/11/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 informationAN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC
Iranian Journal of Fuzzy Systems Vol. 9, No. 6, (2012) pp. 31-41 31 AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC E. ESLAMI Abstract. In this paper we extend the notion of degrees of membership
More informationNatural Deduction for Propositional Logic
Natural Deduction for Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 10, 2018 Bow-Yaw Wang (Academia Sinica) Natural Deduction for Propositional Logic
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 informationLearning Goals of CS245 Logic and Computation
Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction
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 informationModal operators for meet-complemented lattices
Modal operators for meet-complemented lattices José Luis Castiglioni (CONICET and UNLP - Argentina) and Rodolfo C. Ertola-Biraben (CLE/Unicamp - Brazil) Talk SYSMICS 2016 Barcelona September 9, 2016 Skolem
More informationA note on fuzzy predicate logic. Petr H jek 1. Academy of Sciences of the Czech Republic
A note on fuzzy predicate logic Petr H jek 1 Institute of Computer Science, Academy of Sciences of the Czech Republic Pod vod renskou v 2, 182 07 Prague. Abstract. Recent development of mathematical fuzzy
More informationPropositional Language - Semantics
Propositional Language - Semantics Lila Kari University of Waterloo Propositional Language - Semantics CS245, Logic and Computation 1 / 41 Syntax and semantics Syntax Semantics analyzes Form analyzes Meaning
More informationFirst-Degree Entailment
March 5, 2013 Relevance Logics Relevance logics are non-classical logics that try to avoid the paradoxes of material and strict implication: p (q p) p (p q) (p q) (q r) (p p) q p (q q) p (q q) Counterintuitive?
More informationPropositional and Predicate Logic - VII
Propositional and Predicate Logic - VII Petr Gregor KTIML MFF UK WS 2015/2016 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - VII WS 2015/2016 1 / 11 Theory Validity in a theory A theory
More information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
More informationSubstructural Logics and Residuated Lattices an Introduction
Hiroakira Ono Substructural Logics and Residuated Lattices an Introduction Abstract. This is an introductory survey of substructural logics and of residuated lattices which are algebraic structures for
More informationFuzzy Does Not Lie! Can BAŞKENT. 20 January 2006 Akçay, Göttingen, Amsterdam Student No:
Fuzzy Does Not Lie! Can BAŞKENT 20 January 2006 Akçay, Göttingen, Amsterdam canbaskent@yahoo.com, www.geocities.com/canbaskent Student No: 0534390 Three-valued logic, end of the critical rationality. Imre
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 informationChapter 11: Automated Proof Systems (1)
Chapter 11: Automated Proof Systems (1) SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems
More informationPropositional Logic: Syntax
4 Propositional Logic: Syntax Reading: Metalogic Part II, 22-26 Contents 4.1 The System PS: Syntax....................... 49 4.1.1 Axioms and Rules of Inference................ 49 4.1.2 Definitions.................................
More informationTruth-Functional Logic
Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence
More informationMAI0203 Lecture 7: Inference and Predicate Calculus
MAI0203 Lecture 7: Inference and Predicate Calculus Methods of Artificial Intelligence WS 2002/2003 Part II: Inference and Knowledge Representation II.7 Inference and Predicate Calculus MAI0203 Lecture
More informationLogic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
More informationLogic: The Big Picture
Logic: The Big Picture A typical logic is described in terms of syntax: what are the legitimate formulas semantics: under what circumstances is a formula true proof theory/ axiomatization: rules for proving
More informationOn Hájek s Fuzzy Quantifiers Probably and Many
On Hájek s Fuzzy Quantifiers Probably and Many Petr Cintula Institute of Computer Science Academy of Sciences of the Czech Republic Lukasiewicz logic L Connectives: implication and falsum (we set ϕ = ϕ
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 informationPropositional Logic: Syntax
Logic Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and programs) epistemic
More informationDiscrete Mathematics (VI) Yijia Chen Fudan University
Discrete Mathematics (VI) Yijia Chen Fudan University Review Truth Assignments Definition A truth assignment A is a function that assigns to each propositional letter A a unique truth value A(A) {T, F}.
More informationOn the Complexity of the Reflected Logic of Proofs
On the Complexity of the Reflected Logic of Proofs Nikolai V. Krupski Department of Math. Logic and the Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Moscow 119899,
More informationAutomated Reasoning Lecture 2: Propositional Logic and Natural Deduction
Automated Reasoning Lecture 2: Propositional Logic and Natural Deduction Jacques Fleuriot jdf@inf.ed.ac.uk Logic Puzzles 1. Tomorrow will be sunny or rainy. Tomorrow will not be sunny. What will the weather
More informationcse541 LOGIC FOR COMPUTER SCIENCE
cse541 LOGIC FOR COMPUTER SCIENCE Professor Anita Wasilewska Spring 2015 LECTURE 2 Chapter 2 Introduction to Classical Propositional Logic PART 1: Classical Propositional Model Assumptions PART 2: Syntax
More informationPropositional and Predicate Logic - V
Propositional and Predicate Logic - V Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - V WS 2016/2017 1 / 21 Formal proof systems Hilbert s calculus
More informationIntelligent Agents. First Order Logic. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 19.
Intelligent Agents First Order Logic Ute Schmid Cognitive Systems, Applied Computer Science, Bamberg University last change: 19. Mai 2015 U. Schmid (CogSys) Intelligent Agents last change: 19. Mai 2015
More informationIt rains now. (true) The followings are not propositions.
Chapter 8 Fuzzy Logic Formal language is a language in which the syntax is precisely given and thus is different from informal language like English and French. The study of the formal languages is the
More informationA Fuzzy Formal Logic for Interval-valued Residuated Lattices
A Fuzzy Formal Logic for Interval-valued Residuated Lattices B. Van Gasse Bart.VanGasse@UGent.be C. Cornelis Chris.Cornelis@UGent.be G. Deschrijver Glad.Deschrijver@UGent.be E.E. Kerre Etienne.Kerre@UGent.be
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 informationLogic: Propositional Logic Truth Tables
Logic: Propositional Logic Truth Tables Raffaella Bernardi bernardi@inf.unibz.it P.zza Domenicani 3, Room 2.28 Faculty of Computer Science, Free University of Bolzano-Bozen http://www.inf.unibz.it/~bernardi/courses/logic06
More informationFuzzy Answer Set semantics for Residuated Logic programs
semantics for Logic Nicolás Madrid & Universidad de Málaga September 23, 2009 Aims of this paper We are studying the introduction of two kinds of negations into residuated : Default negation: This negation
More informationMarie Duží
Marie Duží marie.duzi@vsb.cz 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: 1. a language 2. a set of axioms 3. a set of deduction rules ad 1. The definition of a language
More informationTodays programme: Propositional Logic. Program Fac. Program Specification
Todays programme: Propositional Logic Familiarity with basic terminology of logics Syntax, logical connectives Semantics: models, truth, validity, logical consequence Proof systems: deductions, deductive
More informationCHAPTER 10. Gentzen Style Proof Systems for Classical Logic
CHAPTER 10 Gentzen Style Proof Systems for Classical Logic Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. By humans, not mentioning
More informationPropositional Logic: Models and Proofs
Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505
More information22c:145 Artificial Intelligence
22c:145 Artificial Intelligence Fall 2005 Propositional Logic Cesare Tinelli The University of Iowa Copyright 2001-05 Cesare Tinelli and Hantao Zhang. a a These notes are copyrighted material and may not
More informationFuzzy attribute logic over complete residuated lattices
Journal of Experimental & Theoretical Artificial Intelligence Vol. 00, No. 00, Month-Month 200x, 1 8 Fuzzy attribute logic over complete residuated lattices RADIM BĚLOHLÁVEK, VILÉM VYCHODIL Department
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 informationCHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS
CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS 1 Language There are several propositional languages that are routinely called classical propositional logic languages. It is due to the functional dependency
More informationNatural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson
Natural Deduction Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. An example 1. Validity by truth table 2. Validity by proof 2. What s a proof 1. Proof checker 3. Rules of
More informationChapter 11: Automated Proof Systems
Chapter 11: Automated Proof Systems SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems are
More informationcse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018
cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 Chapter 7 Introduction to Intuitionistic and Modal Logics CHAPTER 7 SLIDES Slides Set 1 Chapter 7 Introduction to Intuitionistic and Modal Logics
More informationMadhavan Mukund Chennai Mathematical Institute
AN INTRODUCTION TO LOGIC Madhavan Mukund Chennai Mathematical Institute E-mail: madhavan@cmiacin Abstract ese are lecture notes for an introductory course on logic aimed at graduate students in Computer
More informationOverview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural
More informationThe semantics of propositional logic
The semantics of propositional logic Readings: Sections 1.3 and 1.4 of Huth and Ryan. In this module, we will nail down the formal definition of a logical formula, and describe the semantics of propositional
More informationLecture 4: Proposition, Connectives and Truth Tables
Discrete Mathematics (II) Spring 2017 Lecture 4: Proposition, Connectives and Truth Tables Lecturer: Yi Li 1 Overview In last lecture, we give a brief introduction to mathematical logic and then redefine
More informationResiduated fuzzy logics with an involutive negation
Arch. Math. Logic (2000) 39: 103 124 c Springer-Verlag 2000 Residuated fuzzy logics with an involutive negation Francesc Esteva 1, Lluís Godo 1, Petr Hájek 2, Mirko Navara 3 1 Artificial Intelligence Research
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationInference in Propositional Logic
Inference in Propositional Logic Deepak Kumar November 2017 Propositional Logic A language for symbolic reasoning Proposition a statement that is either True or False. E.g. Bryn Mawr College is located
More informationLogic. Propositional Logic: Syntax. Wffs
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More informationFirst Order Logic: Syntax and Semantics
irst Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Logic Recap You should already know the basics of irst Order Logic (OL) It s a prerequisite of this course!
More informationPropositional Calculus - Hilbert system H Moonzoo Kim CS Division of EECS Dept. KAIST
Propositional Calculus - Hilbert system H Moonzoo Kim CS Division of EECS Dept. KAIST moonzoo@cs.kaist.ac.kr http://pswlab.kaist.ac.kr/courses/cs402-07 1 Review Goal of logic To check whether given a formula
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationCISC-102 Winter 2016 Lecture 17
CISC-102 Winter 2016 Lecture 17 Logic and Propositional Calculus Propositional logic was eventually refined using symbolic logic. The 17th/18th century philosopher Gottfried Leibniz (an inventor of calculus)
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
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 informationBL-Functions and Free BL-Algebra
BL-Functions and Free BL-Algebra Simone Bova bova@unisi.it www.mat.unisi.it/ bova Department of Mathematics and Computer Science University of Siena (Italy) December 9, 008 Ph.D. Thesis Defense Outline
More informationPropositional Logic Part 1
Propositional Logic Part 1 Yingyu Liang yliang@cs.wisc.edu Computer Sciences Department University of Wisconsin, Madison [Based on slides from Louis Oliphant, Andrew Moore, Jerry Zhu] slide 1 5 is even
More informationOn Very True Operators and v-filters
On Very True Operators and v-filters XUEJUN LIU Zhejiang Wanli University School of Computer and Information Technology Ningbo 315100 People s Republic of China ZHUDENG WANG Zhejiang Wanli University Institute
More informationBoolean Algebra and Propositional Logic
Boolean Algebra and Propositional Logic Takahiro Kato September 10, 2015 ABSTRACT. This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More information