42 views

Uploaded by JOhn Dadang

Attribution Non-Commercial (BY-NC)

- Alu
- Formal Logic
- LNOTES
- Cook1971_A4
- 1.4Introduction
- 4891 (1).doc
- DLD Lecture 2
- Logic HW4
- Facts and Propositions
- LSyn3 Unate
- L2 - Boolean Algebra.pdf
- Answers to Homework 1
- logic5b
- 02.Gates&LogicNetworks
- ComputableFunctions.pdf
- Digital Logic Design Front Pages
- Chapter1p1 Propositional Logic
- Discrete Math
- CC103 Sit Lnt 001 Intro&Logic
- EC 2203

You are on page 1of 10

Eli S. Mostrales esmostrales@gmail.com

Department of Computer Science MSU-Iligan Institute of Technology

Eli S. Mostrales

Boolean Functions

boolean functions

1. Construct a truth table for the following wff: (A0 (A1 A0 )) 2. Show that the following is a tautology: ((A B) (B A))

Eli S. Mostrales

Boolean Functions

boolean functions

Tautology there are well-formed formulas that evaluate to the value matter what the assigned values are of their respective constituent atomic formulas such a formula is called (logically) valid or a tautology examples of tautologies are: P P, P P, and P (Q P) no

Eli S. Mostrales

Boolean Functions

boolean functions

truth table of a wff if a wff contains n letters P, Q, . . . , (from now on we may use the word letters to refer to these aliases of atomic formulas), then there are 2n possible distributions of the truth values among these letters the 2n -row table that contains the calculations of these values is the truth table of the wff we already dened some of these truth tables calling them functions using our alternative notation (Haskell) again, we may use our alternative notation to dene these wffs and understand them to be truth tables, that is, evaluation of these wffs for all the possible assignments appropriate to these wffs

Eli S. Mostrales Boolean Functions

boolean functions

the function (==>) p q that evaluates to when p = is just evaluating the function, A((P Q)) where A = {(P, ), (Q, )} ,q =

the function (==>) p q is simply able to return the value of A((P Q)) for all the four possible assignments A

Eli S. Mostrales

Boolean Functions

boolean functions

now, set p q to > p = No > q = Oo and dene > formula1 = (hindi p) /\ (p ==> q) <=> hindi (q /\ (hindi p)) we check by evaluating the following: Main> formula1 No :: Boolean

Eli S. Mostrales

Boolean Functions

boolean functions

what happens when we dene formula2 below: > formula1 = (hindi p) /\ (p ==> q) <=> hindi (q /\ (hindi p)) > formula2 p q = ((hindi p) /\ (p ==> q) <=> hindi (q /\ (hindi p))) formula2 is formula1 with arguments p and q added so we can evaluate expressions like formula2 Oo No which of course should evaluate to the same value as formula1 Problem: How to evaluate formula2 to obtain all its values for all possible arguments?

Eli S. Mostrales

Boolean Functions

boolean functions

a boolean function of two arguments (like formula2 above) can be veried for validity by evaluating all the 4 possible combinations to its arguments: (bf Oo Oo) /\ (bf No /\ (bf Oo No) Oo) /\ (bf No No)

if we set bf as an argument to a function that does validity check we have: valid2 :: (Boolean -> Boolean -> Boolean) -> Boolean valid2 bf = (bf Oo Oo) /\ (bf Oo No) /\ (bf No Oo) /\ (bf No No)

Eli S. Mostrales Boolean Functions

boolean functions

a boolean function of two arguments (like formula2 above) can be veried for validity by evaluating all the 4 possible combinations to its arguments: (bf Oo Oo) /\ (bf No /\ (bf Oo No) Oo) /\ (bf No No)

if we set bf as an argument to a function that does validity check we have: valid2 :: (Boolean -> Boolean -> Boolean) -> Boolean valid2 bf = (bf Oo Oo) /\ (bf Oo No) /\ (bf No Oo) /\ (bf No No)

Eli S. Mostrales Boolean Functions

boolean functions

a boolean function of two arguments (like formula2 above) can be veried for validity by evaluating all the 4 possible combinations to its arguments: (bf Oo Oo) /\ (bf No /\ (bf Oo No) Oo) /\ (bf No No)

if we set bf as an argument to a function that does validity check we have: valid2 :: (Boolean -> Boolean -> Boolean) -> Boolean valid2 bf = (bf Oo Oo) /\ (bf Oo No) /\ (bf No Oo) /\ (bf No No)

Eli S. Mostrales Boolean Functions

- AluUploaded byLeslie Wright
- Formal LogicUploaded bydfkljdf
- LNOTESUploaded bymaathu123
- Cook1971_A4Uploaded byhappygrape2
- 1.4IntroductionUploaded bySHREE
- 4891 (1).docUploaded byMuhammad Sahil
- DLD Lecture 2Uploaded byHammna Ashraf
- Logic HW4Uploaded byapi-3729180
- Facts and PropositionsUploaded bymadan321
- LSyn3 UnateUploaded bySRIKRISHNA.SCU
- L2 - Boolean Algebra.pdfUploaded byjpana3467
- Answers to Homework 1Uploaded by45698722
- logic5bUploaded byrio cassidy
- 02.Gates&LogicNetworksUploaded byMa Seenivasan
- ComputableFunctions.pdfUploaded byyacobaschalew
- Digital Logic Design Front PagesUploaded byGECM85
- Chapter1p1 Propositional LogicUploaded bySagar Sagar
- Discrete MathUploaded byChie Calopez
- CC103 Sit Lnt 001 Intro&LogicUploaded bybhabish
- EC 2203Uploaded bySujy Cau
- Dg BOOL HandoutUploaded byMuhammad Saeed
- Curs 12-13 BMC 14.12.2010-1Uploaded byBogdan Maier
- DP-Assignment Brief A1_16ED2 - UpdatedUploaded byBaru Su
- Digital Electronics Lecture - VI Cannonical and Standard Forms RevistedUploaded byParag Parandkar
- ACFrOgBGrb2cD4jJFiglBfCEuprCD-ua_TEqXUewgXFbBP4AphglN2-J1adZiC3dK3JWQRE1vYjMkIgfvPbG15YgjocAGjfdalN7jLM-sR_ZcwBs0GGBreHY6XkDsXQ=Uploaded byDinesh
- DICA Manual Hardware ExpsUploaded byanandbabugopathoti
- VAPL Absence Property PatternUploaded bykoushikroopa hk
- 402lab10Uploaded byapi-284738200
- Alan H. Mekler and Saharon Shelah- Some Compact Logics - Results in ZFCUploaded byHutsDM
- Cec 2013 r SyllaUploaded byLakshmi Narayanan

- ch03Uploaded byCameron Hutchison
- Bochenski (1974) - Logic and OntologyUploaded bymacucorum
- Legal LogicUploaded byJoseph Park
- Legal Technique and LogicUploaded byNikasia Roxas
- Logic Cheat SheetUploaded byjc1838
- Reason PacketUploaded byDanzell-Patrick Knight
- Fallacies of AmbiguityUploaded byJay Emmanuel Aguilar Hayagan
- LESSON 2Uploaded byMargarette Vinas
- Unit-2 (39)METHODS OF PROOF.pdfUploaded byAnonymous 9hu7fl
- Hypothetical Syllogism.docxUploaded byYan Lean Dollison
- Logic Unit 3 Part 1Uploaded byalicenuoli
- Logic Midterm Reviewer(Categorical)Uploaded byZyra Mainot
- Leg Tech Syllabus-1Uploaded byAyra Arcilla
- Edward N. Zalta-Basic Concepts in Modal Logic (1995)Uploaded byLuiz Helvécio Marques Segundo
- Formal vs Informal LogicUploaded bytcorey7
- Logical Arithmetic 12Uploaded bygiftlin
- Logic Chapter 5Uploaded byRaymond Ruther
- Legal Techniques and LogicUploaded byLang Limocon-Flores
- Harman. Kulkarni-inducciónUploaded byCuirocampos
- Wesley Salmon - The Foundations of Scientific Inference (1967)Uploaded bymatiaslanas
- philo 105 propositional logic packetUploaded byapi-196193978
- [Reasoning] Logical Connectives (if, unless, either or) for CSAT, CAT shortcuts formulas approach explained « MrunalUploaded byMohit Arya
- emericonviews primer.pdfUploaded byNihan Çatal
- letter VzscdasfcaaUploaded byAbhishek Arora
- )(Philosophy of Mind) Paul Thagard (ed) - Mind Readings-2. T.pdfUploaded byRaluca Closanu
- Beliefe Bias Effect in Reasoning of Future Teachers-ARTICULO-2014Uploaded byGregory Veintimilla
- Logic Reviewer MidtermsUploaded byAteneo Economics Association
- An Introduction to Formal Logic - Peter SmithUploaded byalbundy00
- 1 4 validity truth soundness strengthUploaded byapi-295529194
- Logic Quiz 2Uploaded bycleahis cruz