码迷,mamicode.com
首页 > 移动开发 > 详细

Discrete Mathematics and Its Applications | 1 CHAPTER The Foundations: Logic and Proofs | 1.3 Propositional Equivalences

时间:2019-05-05 21:53:47      阅读:349      评论:0      收藏:0      [点我收藏+]

标签:roo   ret   mamicode   gen   oat   als   case   width   sam   

DEFINITION 1

A compound proposition that is always true,no matter what the truth values of the proposi-tional variables that occur in it, is called atautology.

A compound proposition that is always false iscalled a contradiction.

A compound proposition that is neither a tautology nor a contradiction is called contingency.

 

Logical Equivalences

Compound propositions that have the same truth values in all possible cases are called logically equivalent.

 

DEFINITION 2

The compound propositions p and q are called logically equivalent if p ↔ q is a tautology.

The notation p ≡ q denotes that p and q are logically equivalent.

 

技术图片

 

 

 

 

 

 

 

 

技术图片

 

In general, 2**n rows are required if a compound proposition involves n propositional variables.

 

技术图片 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

技术图片

 

 

技术图片

 

技术图片

 

Discrete Mathematics and Its Applications | 1 CHAPTER The Foundations: Logic and Proofs | 1.3 Propositional Equivalences

标签:roo   ret   mamicode   gen   oat   als   case   width   sam   

原文地址:https://www.cnblogs.com/minost/p/10816510.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!