关键词不能为空

当前您在: 主页 > 英语 >

《离散数学》双语教学 第一章 真值表,逻辑和证明

作者:高考题库网
来源:https://www.bjmy2z.cn/gaokao
2021-02-13 01:29
tags:

-

2021年2月13日发(作者:人造花)


《离散数学》双语教学



第一章



真值表,逻辑和证明



《离散数学》双语教学



第一章



真值表,逻辑和证明



CHAPTER 1


TRUTH TABLES, LOGIC, AND PROOFS


Glossary


statement, proposition:


命题


logical connective:


命题联结词



compound statement:


复合命题


propositional variable:


命题变元



ne gation:


否定


(



)


truth table:


真值表



conjunction:


合取


disjunction:


析取


propositional function:


命题公式



fallacy:


谬误



syllogism:


三段论



universal quantification:


全称量词化


existential quantification:


存在


量词化


hypothesis(premise):


假设~前提~前件


conditional statement,


implication:


条件式~蕴 涵式


consequent, conclusion:


结论~后件


converse:



命题



contrapositive:


逆否命题



biconditional, equivalence:


双条件式~等价



(


逻辑


)


等价的


logically equivalent:


contingency:


可满足式



tautology:


永真式


(


重言式


)


contradiction, absurdity:


永假


(


矛盾


)



logically follow:


是…的逻辑结



argument:


论证



axioms:


公理




1





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明


postulate:


公设



rules of reference:


推理规则



modus ponens:


肯定律


modus tollens:


否定律



reductio ad absurdum:


归谬律



proof by contradiction:


反证法



counterexample:


反例


minterm:


极小项



disjunctive normal form:


主析取范式



maxterm:


极大项



conjunctive normal form:


主合取范式




2





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



本章内容及教学要点


:


1.1 Statements and Connectives


教学内容


:statements(propositions)


compound statement



connect ives:negation



conjunction



disjunction



truth tables 1.2


Conditional Statements


教学内容


:implication s(conditional statements)



bi conditional



equivalent



and quantifications


1.3 Equivalent Statements


教学内容


:logical equivalence



converse



inverse



contrapositive



tautology



c ontradiction(absurdity)



cont ingency



properties of logical


connectives


1.4 Axiomatic Systems: Arguments and Proofs


教学内容


:rules of reference

< p>


augument



v alid argument



hypotheses



premises



law of detachment(modus ponens)



syllogism



modus tollens< /p>



addition


< br>proof by contradiction 1.5 Normal Forms


教学内容


:minterm



disjunctive normal form



max term



conjunctive


normal form


定理证明及例题解答




3





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



Logic, developed by Aristotle, has been used through the centuries


in the development of many areas of learning including theology,


philosophy, and mathematics. It is the foundation on which the whole


structure of mathematics is built. Basically it is the science of


reasoning, which may allow us to determine statements about mathematics


whether are true or false based on a set of basic assumptions called


axioms. Logic is also used in computer science to construct computer


programs and to show that programs do what they are designed to do.


逻辑学是研究人的思维形式的科学


.


而数理逻辑是逻辑学的一个重要分支~



是用数学形式化的方法研究思维规律的一门学科


.


由于它使用了一套符号来简




地表达出各种推理的逻辑关系~故它又称符号逻辑


.


数理逻辑用数学方法研究推理、利用符号体系研究推理过程中前提和结论之


间的关系


.


数理逻辑的主要内 容


:


逻辑演算


(L


L)


、公理化集合论、模型论、


S p


构造主义与证明论


.


数理逻 辑在电子线路、机器证明、自动化系统、编译理


论、



算法设计方法方面有广泛的应用


.


The rules of logic specify the meaning of mathematical


statements. Logic is the basis of all mathematical reasoning, and it


has practical applications to the design of computing machines, to


system specifications, to artificial intelligence(AI), to computer


programming, to programming languages, and to other areas of computer


science, as well as to many other fields of study.



4





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



1.1 Statements and Connectivess(


命题和联结词


)


命题逻辑研究的对象是命题及命题之间的逻辑关系


.


Propositions are the basic building blocks of logic. Many


mathematical statements are constructed by combining one or more


propositions.


定义


1.1.1 A proposition is a statement or declarative sentence that


is either true or false, but not both,


命题是一个非真即假的陈述句


,.


因此不能判断真假的陈述句、疑问句、祈使句和感叹句都不是命题


.


,1, The true or false value assigned to a statement is called its


truth value; (


一个命题的真或假称为命题的真值


.


真用


T



1


表示~假用


F



0

表示


)


,2,


一个陈述句有真值与是否知道它的真假是两回事


.



1.1.1


判断下列语句是不是命 题


,


若是~给出命题的真值


: (1)


陕西师大不


是一座工厂


.


(2)


你喜欢唱歌吗


,


(3)


给我一块钱吧


:


(4)


我不是陕西师大的学生


.


(5)


我正在说谎


.


Logical connectives(


命题联结词


)

< br>数理逻辑的特点是并不关心具体某个命题的真假~而是将逻辑推理变成类似



数学演算的形式化过程


,


关心的是命题之间的关联性


.


因此需要进行命题符号



.


命题联结词的作用是为了将简单命题组合成复合命题


.


We will now introduce the logical connectives that are used to form


new propositions from existing propositions. And once truth values have


been assigned to simple propositions, we can progress to more


complicated compound statements.


A statement that contains no connectives is called a simple



5





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



statement. We will use p,q,r…to represent simple statements(简单命




就 是简单陈述句~用字母


p,q,r…(或带下标


)


表示


),Sometimes, the letters


p,q,r,s,…are used to denote propositional variables that can be


replaced


by statements(


命题变元


:


可以用命题代替的变元


).


A statement that contains logical connectives(


命题联结词


) is called


compound statements(


复合命题


). In general, a compound statement may have


many component parts, each of which is itself a statement,


represented by some propositional variable. The truth of a compound


proposition is determined by the truth or falsity of the component


parts.


propositional consta nt(


命题常元


):T(1)



F(0)


~或者表示一个确定的命




,


propositional variable(


命题变元


):


可用 一个特定的命题取代。



指派


(


解释


):


用一个具体命题或


T



F


代替一个命题变元


.


常用的有五种命题联结词~先介绍三种


:



(1) negation connective


否定联结词,


,,

< br>,


p(


否定式


):



p (not p)


If p is a statement, the negation of p is the statement not p,


denoted by



p.



p:


不~非~没有

< br>


规定,


p



T


当且仅当


p


< p>
F.


,(2) conjunction connective


合取联结词



, pq(


合取式


) :p

< p>
并且


q



p


合取


q


, :


并且~且~既…又…~不仅…而且…



If p and q are statements, the conjunction of p and q(p



q


的合取


)


,is the compound statement “p and q”, denoted by pq. The


proposition ,,pq is true when both p and q are true and is false


otherwise. (


规定


pq



T


当且仅当


p


q


都是


T.)


,(3) disjunction connective


析取联结词




6





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



, pq(< /p>


析取式


):p


或者


q



p


析取


q


,:


或~或者说~不是…就是~要么…要么



If p and q are statements, the disjunction of p and q(p



q


的析取


)


,is the compound statement “p or q”, denoted by pq. The


proposition ,pq is true when p or q are true and is false when both p


and q are false.


,This is used in an inclusive sense. (


规定


pq



T


当且仅当


p



q


中至少




,


个是


T


或者


pq



F


当且仅当< /p>


p



q


都是


F).


Now we will introduces truth table to decide how the truth of a


compound proposition is determined by the truth or falsity of the


component parts.


A truth table lists all possible combinations (cases) of the truth


and falsity of the component truth table(


真值表


) of a


compound proposition is as follows: The left columns are the


component parts and their truth values, and the right column are the


truth value of the compound proposition(


左边部分是组成复合命题的各简


< /p>


单命题的真值指派


,


右边部分是复合命题 的相应真值


).


,,



1.1.2 The truth tables of pq, pq and



p.


,,q p q pq p q p



p p T T T T T T


T F F T F T T F


F T F F T T F T


F F F F F F


,,



1.1.3 The truth table of p(



qr).


,,p ((



q) r) p q r


T T T T T F T F T


T T F T T F T F F


T F T T T T F T T



7





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



T F F T T T F F F


F T T F F F T F T


F T F F F F T F F


F F T F T T F T T


F F F F F T F F F


1 * 2 1 3 1


ASSIGNMENTS: < /p>


PP6-9:12



14



28



30



34



40



58



60



8





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



1.2 Conditional Statements,


条件式


,


,,


联结词


,, (4) conditional connective


条件


,


蕴含


,


, pq(


条件式、蕴涵式


):


如果


p

< p>


q


,In the implication pq, p is called the hypothsis(antecedent or


premise) and q is called the conclusion(consequence). The


,implication pq is the proposition that is false when p is true and


q is


,false, and is true otherwise. (


规定


pq



F


当且仅当


p



T



q



F. p

< p>
称为条件式的前件


(


前提


)



q


称为条件式的后件


(


结论


))


,:


如果


(


若)…就


(< /p>



)


~只要…就~若…才能



,



1.2.1 The truth table of pq.


,q pp q


T T T


T F F


F T T


F F T


The conditional is expressed in English in several ways:


If p, then q.


p is sufficient for q.


p is a sufficient condition for q.


q is necessary for p.


q is a necessary condition for p.


p only if q(or only if q then p)


,(5) biconditional connective


双条件


(


等值


)


联结词


,, ,


,pq (


双条件式


) :p


当且仅当


q


,The biconditional pq is the proposition that is true when p and q


,have the same truth values, and is false otherwise. (


规定


pq



T


< p>
且仅当


p



q

< p>
或者都是


T


~或者都是


F .)



9





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明




1.2.2 The truth table of p,q.


,q pp q


T T T


T F F


F T F


F F T


The biconditional is also expressed in English in several ways:


p if and only if q.


p is necessary and sufficient for q.


p is a necessary and sufficient condition for q.


Translating sentences into logical expressions removes ambiguity.


Once we have translated sentences from English(Chinese,etc.) into


logical expressions we can analyze them to determine their truth values,


manipulate them, and use rules of reference to reason abut them. (

命题符


号化的目的在于用五个联结词将日常语言中的命题转化为数理逻



辑中的形式命题~其关键在于使用适当的联结词


.


对自然语言中语句之间的逻




关系以及命题联结词的含义要有正确的理解


:


(1)


确定语句是否是一个命题


,


(2)


找出句中连词~用适当的命题联结词表示


.,



1.2.3


试将下列命题符号化


:


(1)


若你不看电影~则我也不看电影


.


(2)


小王一边吃饭~一边看书


.


(3)


只有在生病时~我才不去学校


.


(4)


当且仅当我生病时~我才不去学校


.





1.2.3


,,



1.2.4 Change each of the following to the form pq or qp:


(1) He will succeed only if he works hard.


(2) Having money is sufficient for being happy.



10





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



(3) Sam will play golf if and only if it is warm.


(4) Having money is necessary for being happy.


(5) Sam will play golf if and only if it is warm.


(6) Being lucky is a necessary and sufficient condition for being


successful.


命题表达式


(logical expression) < /p>


一个命题越复杂~符号化该命题所需的命题变元和联结词就越来越多


.


如何安


排这么多的东西使之有意义呢


,


一个命题表达式是由下列方式递归定义的


:


(1)


命题常元或命题变元是一个命题表达式


,


(2)



A


是一个命题表达式~则


(



A)


也是一个命题表达式


,


,,,,(3)



A



B


是命题表达式~则


(AB)



(AB)



(AB)



(AB)


均为命题表达式


,


(4)


只有经过有限次地应用


(1)



(2)



( 3)


所得的结果才是命题表达式


.



:1


、对于一个命题表达式~数理逻辑的目的在于利用这些形式 化的表达式来研究


命题之间的逻辑关系


.

这种逻辑关系是用真假来表示的


,


只有对其所有的变元指派


以确定的真值后~它才有真值


;


2


、命题表达式无限多


,


3



Precedence of logical connectives(


命题联结词的优先级


)


在一个复杂的


命题表达式中~常常有许多括号和联结词~为 了简便起见~规定下列运算顺



,,,,



:


,~~~~


.


从而外层括号可以省略


,


在不会引起混淆的情形中~可 以


省略命题表达式中的一些括号


.


若命题表达式


A


是命题表达式


A


的一部分~则称< /p>


A



A


的子命题 表达式


. 11


,,,,



1.2.5


求命题表达式


(p(qs))


(ps)


的子命题表达式


.


定义


1.2.1


设命


题表达式


A(p, p, …, p)含有


n


个命题变元


p, p, …, p~



12n12np, p, …, p


是其中的


r


个不同命题变元


.


用命题表达式


B, B, …, B


同时分


j1j2jr12r


别代替


p , p, …, p



A


中每一次出现 所得到的命题表达式


B


称为


A


的一个代


j1j2jr



11





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



入实例


.


,,,,,



1.2.6

< p>
设命题表达式


A(p,q,s)



(pqs)



(ps)



B



pq


~则用< /p>


B


,,,,


代入


A


中的


p


所得的代入实例为命题表达 式


((pq)(qs))




,,((pq)s).


,



C



qp


~则用


B



C


分别取代< /p>


A


中的


p



s


所得的代入实例为命题表



,,,,,,,,


达式


((pq)(q(qp)))



((pq)(qp)).


在命题逻辑中~还有一种所谓的替换


.


但代入是对命题变元来进行的


.


而替 换


则是对某一子命题表达式来进行的~它只要求对该子命题表达式的某一处出现或某


几处出现进行替换


.


,,,,,



1.2.7

< p>
设公式


A(p



q)



(p(qs))



(ps)



B


为,

< br>p



s


~则用

< br>B


,,,,


代入


A

< p>
中的子公式,


(p?s)


所得的公式为

< p>
(p(qs))(



p



s).


Assignments:

PP11-13:6



8



40



44



48



12





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



1.3 Equivalent Statements,


等价命题


,


If two compound statements p and q are true in exactly the same


cases, then they are said to be logically equivalent(


逻辑等价的或等价



,



) , or we say that p is equivalent to q. We will denote this by


pq. We


can establish their equivalence by constructing truth tables for


them and then comparing the two truth tables. Or by using the


tautologies, which we will introduce in the following text.


,,



1.3.1



p



q and



(pq) are logically equivalent, i.e.



,,,



q


(pq). p


,Associated with the conditional statement pq are three other


statements: its converse, inverse, and contrapositive.


,, qp is the converse(


逆命题


) of pq.


,,



q



p is the contrapositive(


逆否命题


) of pq.


,,



p


,< /p>


q is the inverse(


否命题


) of pq.



1.3.2 Let the implication be “If it is raining, then I get wet.”


Give its


converse, inverse and contrapositive.


A statement that is true in every case is called a tautology. A


statement that is always false in every case is called a


contradiction


or an absurdity. And a statement that can be true or false,


depending on the truth values of its component parts, is called a


contingency(




A


是一个命题表达式~若


A


在任何指派下都为


T


~则称为永真式

< p>
(


重言式


),



A


在任何指派下都为


F


~则称


A


为永假式


(


矛盾式


),


若至少存在一个指派使

A



T




则称


A


为可满足式

).


,,,



1.3.3


判断下列几个公式的类型


: p



p



p



p



pq.


,,



1.3.4

< br>用真值表决定公式,


(



pq) p


的类型


.





1.3.4



: 1


、永真式必为可满足式~反之 则不然


,


永真式的否定是永假式~反之亦然

,



13





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



2

< p>
、决定一个公式是否是一个永真式、永假式或可满足式有两种方法


:


真值表法


(


适用于变元少而简单的公式


)


和公式推理


,


等价 取代


,



,


n223


、共有个不同的


n


元真值表


,


4


、永真式的合取、析取、蕴含 和等值式都是永真式


.


,


定理


1.3.1 p is equivalent to q if and only if pq is a tautology.


,,,


定理


1.3.2 pq


是永真式当且仅当条件式


pq



qp


都是永真式


.


定理


1.3.3


The connectives for propositions have the following


properties (


命题运算满足下列性质


):


Idempotent laws(


等幂律


):


,,,,ppp, ppp


Double negation law(


双否律


):

< br>,



(



p)p


De Morgan’s laws(德


.


摩根律


):


,,,,,,



(pq)


p



q,


(pq)



p

< br>,


q


Commutative laws(


交换律


):


,,,,,,pqqp, pqqp


Associative laws(


结合律


):


,,,,,,,,,,p(qr)(pq)r, p(qr)(pq)r


Distributive laws(


分配律


):


,,,,,,,,,,,,p(qr)(pq)(pr), p(qr)(pq)(pr)


Identity laws(


同一律


):


,,,,pTp, pFp


Domination laws(


零一律


):


,,,,pTT, pFF


Absorption laws(


吸收律


):


,,,,,,p(pq)p, p(pq)p


Negation laws(


有补律


):


,,,,p



pT, p



pF


Logical equivalences involving implications:



14





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



,p,q,< /p>



pq(


条件式转化律

< br>), p,q,



q,



p (


逆否律


),


,,,,,, (pq)(pr)p(qr)


,,,,,,(pr)(qr)(pq)r


Logical equivalences involving biconditionals:


,,,,,pq(pq)(qp),


,,,,,pq(pq )(



p



q ) (


双条件式转化律


)


where T can represent any tautology and F can represent any


contradiction.


Any component of a compound statement can be replaced by any


statement logically equivalent to that statement without changing


the


truth value of the statement.


定理


1.3.4(


代入原理


)


永真


(< /p>



)


式的代入实例是永真


(



)


.


,


定理


1.3.5(


替换原理


)



A< /p>


为命题公式


C


的子命题公式~若


AB


~且将


C




,A


的一处或若干处出现用


B


代替得到


D


~则


CD.


替换和代入虽都是从一个命题公式变换得到另一个新的命题公 式~但代入是对


命题变元进行的~且必须同时替换某变元的所有出现

(


处处代入


),


而替换的对象则< /p>


是子命题公式~且只需取代某子命题公式的一处或若干处出现


(< /p>


部分替换


).



1.3.5 Establishes the equivalence:


,,,,,, (qr)(p



r) (pq)r


Assignments:


PP17-19:8

< p>


10



12

< p>


14



28

< p>


30



40

< p>


48



52

< p>


54



56



15





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



1.4 Axiomatic Systems: Arguments and Proofs


Much of mathematics deals with theorems and proofs of theorems.


Theorems are “true” statements about the mathematical system being


considered.


A theorem is a statement that can be shown to be true. We


demonstrate that a theorem is true with a sequence of statements that


form an argument (


证明~推理


).


Two important questions will arise in the study of mathematics are:


(1) When is a mathematical argument valid(correct)? (2) What


methods can be used to construct a valid mathematical argument?


An argument consists of a collection of statements called hypotheses


and a statement called its conclusion. A valid


argument is an argument whose conclusion true whenever all the


hypotheses are true.


To construct proofs, methods are needed to derive new statements


from old ones. The statements used in a proof can include axioms(





) or postulates(


公设


), the hypotheses of the theorem to be proved,


and previously proved theorems. The rules of inference(


推理规则


),


which are means used to draw conclusions from other assertions, tie


together the steps of a proof.


In a mathematical system, all of the information necessary to prove


a theorem must be contained in axioms and previously proven theorems.


推理就是从一组已知的命题出发~按照一组推理 规则推出新的命题的过程


.


已知命题称为推理的前提~推出的命题称为推理的结论


.


推理过程是一个有限




式序列~它以一个前提开始


.


它的最 后一个公式是结论~其余的公式或者是一



< br>公理、公设或给定的前提~或者是由若干个在它前面出现的公式的有效结论


.


定义


1.4.1 Suppose that the implication H?H?…?H ?C is a 12n




16





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



tautology, we say that C logically follows from H,H,…,H


. 12n


Virtually all mathematical theorems are composed of implications of


the type


H?H?…?H?C 12n



,The H are called the hypotheses(


假设


) or premises(


前提


), si


and C is called the conclusion.


To prove the theorem, we are trying to show that C will be true if


all the H are true. i


The first method of showing that an argument is valid is to


construct a truth table and show that whenever all of the hypotheses are


true, then the conclusion is true too.



1.4.1 Determine whether the following argument are valid or not:


,(1) pq


, pr


, qr



r


,(2) pq


, qr


r



p





1.4.1


The second is to use the rules of inference to prove the validity of


the conclusion. The various steps in a mathematical proof of a theorem


must follow from the use of various rules of inference, and a


mathematical proof of a theorem must begin with the hypotheses, proceed


through various steps, each justified by some rule of inference,



17





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



and arrive at the conclusion.


In fact, in order to prov


e a theorem of the typical form H?H?…?H?C,


we begin with the hypotheses H,H,…,H and show 12n12n



that some result C logically follows. Then, using H,H,…,H,C, we


112n1


show that some other result C logically follows. We continue this 2


process, producing int


ermediate statements C,C,…,C, called steps in


12k


the proof, until we can finally show that the conclusion C logically


follows H,H,…,H, C,C,…,C. Each logical step must be justified by


12n12k


some valid proof technique, based on the rules of inference or


some other rules that come from tautological implications,


永真蕴涵



,.


In all, a valid argument is formally a sequence of statements each


of which is


(1) A hypothesis


(2) An axiom or postulate


(3) A previously proven theorem or proposition


(4) A statement implied by previous statements as a conclusion of


a valid argument


(5) Logically equivalent to a previous statement


前面讲过的逻辑等价式和永真蕴含式都可以适当地变成可用的推 理规则


.




用的有


:


(1) Addition rule(


附加规则


)


p



,pq


(2) Specialization rule(


化简规则


)


p,q



p


(3) Modus ponens (law of detachment,


假言推理

,


肯定律


)


p


p,q



18





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明




q


(4) Modus tollens (


拒取式


,


否定律< /p>


)



q


p,q


?,


p


(5) Disjunctive syllogism (


析取三段论


)



p


p,q


?,


q


(6) Syllogism(


假言三段论


)


p,q


q,r


,



pr


(7) Conjunction rule(


合取引入


)


p


q



,pq



1.4.2 Is the following argument valid?


If you invest in the stock market, then you will get rich.


If you get rich, then you will be happy.



If you invest in the stock market, then you will be happy.



1.4.3 Is the following argument valid?


Smoking is healthy.


If smoking is healthy, then cigarettes are prescribed by


physicians.



Cigarettes are prescribed by physicians.



1.4.4 Is the


following argument valid?


If taxes are lowered, then income rises.


Income rises.



19





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明




Taxes are lowered.


There are several different proof techniques: direct method(


直接证明



), indirect method(


间接证明法


), proof by contradiction(


反证法


), and


mathematical induction(


数学归纳法


).


An important proof techniques is indirect method(


间接证明法


). It


,,,q)(



q


p), which means that an based on the tautology (p


implication is equivalent to its contrapositive.


2



1.4.5 Let n be an integer. Prove that if n is odd, then n is odd.


Another important proof technique is proof by contradiction(




,,,


证法


). It is based on the tautology ((pq)



q)



p. To prove that C


logically follows from H,H,…,H, we show that H?H?…?H?,


C 12n12nimplies


a contradiction.



1.4.6 Prove there is no rational number whose square is 2. In


other


words, show that 2 is irrational.


定义


1.4.2 Let A be a logical expression that includes only


,~


and ,.


Interchanging and , T and F(if there are some) in A, we will ,,,


*have the antithesis of A, and we denote it A.(


设< /p>


A


是仅含,~和这


,,

< br>三种命题联结词的公式~在


A


中将和互换、


T



F(


若有的话


)


所得到的公式称


,,


*



A


的对偶式

,antithesis,


~记为


A.)


,,,,q)s(



(pq)s

的对偶式


).



1.4.7 Construct the antithesis of (p





1.4.7


定理


1.4.1 Let A be a logical expression that includes only


,~


and ,


*,. Then


,A(p, p, …, p) A (,


p,


,p, …, ,


p)(



A(p, p, …,


p),12n12n12n


*,


是仅含,~和这三种命题联结词的公式~则,A(p, p, …, p) A


(



,,12np,


,p, …, ,


p).) 12n


定理


1.4.2(


对偶原理


) Let A and B be logical expressions that includes



20





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



**,,only


,~


and . If AB



then AB.(


设< /p>


A



B


都是仅含 ,~和这


,,,,


**,,


三种命题 联结词的公式~若


AB


~则


AB.)


,


定义


1.4.3 Let A and B are logical expressions. If AB is a tautology,


,then we say that B logically follows from A.(



A



B


是两个公式~若

< br>AB


是永真式~则称


A


永真蕴 含


B)


永真蕴含关系的性质


:


,(1)(Reflexivity,


自反性

< br>) A logically follows from A,AA


是永真式


,,


(2)(Tr ansitivity,


传递性


) If B logically follows from A and C logically


,,follows from B, then C logically follows from A(



AB



BC


是永真


,


式~则


AC


是永真式

< p>
),


,(3) If both B and C logically follow from A, then BC logically


follows


,,,,from A(

< br>若


AB



AC

< br>是永真式~则


A(BC)


是永真式


),


(4) If A logically follows from B and C, then A logically follows


from < /p>


,,,,,BC(



BA



CA


是永真式~则


BCA< /p>


是永真式


),


,,,(5) AB is a tautology if and only if AB and BA are

< p>
,,,tautologies(AB


是永真式当且仅当

< br>AB



BA


都是永真式


),


,,,(6) If AB is a tautology, then



B



A is a tautology too(



AB




,


永真式则,


B



A


是永真式


).


永真蕴含关系的证明


:


(1) Using truth tables(


真值表法


),


(2) Suppose that the premise be true and show that the consequence


is


true(


前件真推出后件也真法


),


(3) Suppose that the consequence be false and show that the premise


is false(


后件假推出前件也假法


),


(4) Using the transitivity of the relation(


利用永真蕴含关系的传递性


).


,,,



1.4.8 Show that (p(pq))q is a tautology.


证明




1.4.8



21





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



定理


1.4.3 Let A and B be logical expressions that includes only


,~



**,,and . IF AB is a tautology, then BA is a tautology too.(



A,,


**,,


和这三种命题联结词的公式~若


AB


是永真式 ~则


BA



B


都是仅含,~


,,


是永真式


.)


,,,



1.4.9 Prove:(1) (pq)(p(p,q)) is a tautology,


,,,(2) (q



(((



p)(



q)),p ))((



p)q) is a tautology. ,


证明




1.4.9



1.4.10 Use the alternative to the truth table method to determine


which of the following arguments are valid:


,q (1) p


,



q



s


, st


,tq



, ps


,(2) st


, tr


, sw



, rw



1.4.11 Determine which of the following arguments are valid:


,(1) pq


, pr


, qr



p



22





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明



,(2) pq


, pr


,



(pq)





p



1.4.12 Use the rules of reference and equivalent statements to


show that the following arguments are valid:


,(1)



(



pq)


,



z



s


,, (p



q)s


,



zr



r


,(2) pq


, qr


,



s



r


,st



t



p


Using premis es(P


规则


,


前提引入


): We can use premises wherever(


在推 导


过程中~前提可视需要引入使用


).


Using rules of inference(T


规则


,


结论引入


): We can produce


intermediate conclusions from previous statements(


在推导过程中~利用推理

< br>定律可引入前面已导出的结论的有效结论


).


Using complementary premises (CP


规则


,


附加前提引入


): If The


,conclusion is expressed as SC, then we will show H,H,…,H~


SC ,12n


,,instead of showing H,H,…,HSC(若结论是形为


SC


的公式~则要


,12n



23





47



2010-12-27


《离散数学》双语教学



第一章



真值表,逻辑和证明




H,H,…,HS,C~只需证


H,H,…,H~


S C). ,,12n 12n


,,,,Proof by contradiction(


反证法):Show that HH…H,


C is a 12n


,,,,contradi ction(


即证


HH…H,


C


是永假式


). 12n



1.4.13 Prove:


,,,(1) a



a



b


~,


bc



cd d; ,


,,(2) p(qs)



q



p



s



s r; ,,


,,,,,(3) (uv)(mn)



up



p(qs)


~,


q



s m; ,,,


证明




1.4.13



1.4.14 Prove:


,,(1) pq


~,


(qr)



p; ,


,,,,(2) (pq)s (pq)s; ,


,,,(3)



pq



s



q


~,


r< /p>



rs p ,


证明




1.4.14



1.4.15


为庆祝九七香港回归 祖国~四支足球队进行比赛~已知情况如下~



问结论是否有效


?


前提


:


(1)

< br>若


A


队得第一~则


B

< p>
队或


C


队获亚军


; (2)



C


队获亚军~则

< p>
A


队不能获


冠军


;


(3)



D


队获亚军~则


B


队不能获亚军


;


(4) A


队获第一


;


结论


: (5) D


队不是亚军


.


证明




1.4.15



1.4.16 Prove:

-


-


-


-


-


-


-


-



本文更新与2021-02-13 01:29,由作者提供,不代表本网站立场,转载请注明出处:https://www.bjmy2z.cn/gaokao/647192.html

《离散数学》双语教学 第一章 真值表,逻辑和证明的相关文章

《离散数学》双语教学 第一章 真值表,逻辑和证明随机文章