Transcription of Discrete Mathematics, Chapter 1.1.-1.3: Propositional Logic
{{id}} {{{paragraph}}}
Example: dental hygienist
Discrete Mathematics, Chapter 1.1.-1.3: Propositional Logic
Discrete mathematics , Chapter : Propositional LogicRichard MayrUniversity of Edinburgh, UKRichard Mayr (University of Edinburgh, UK) Discrete mathematics . Chapter / 21 Outline1 Propositions2 Logical Equivalences3 Normal FormsRichard Mayr (University of Edinburgh, UK) Discrete mathematics . Chapter / 21 PropositionsA proposition is a declarative sentence that is either true or of propositions:The Moon is made of green is the capital of New is the capital of + 0 = 10 + 0 = 2 Examples that are not down!What time is it?x + 1 = 2x + y = zRichard Mayr (University of Edinburgh, UK) Discrete mathematics . Chapter / 21 Propositional LogicConstructing PropositionsPropositional Variables:p,q,r,s.
Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 1.1-1.3 19 / 21. Transformation into Conjunctive Normal Form Fact For every propositional formula one can construct an equivalent one in conjunctive normal form. 1 Express all other operators by conjunction, disjunction and
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: