逻辑和证明

C. Reis, S. Rankin
{"title":"逻辑和证明","authors":"C. Reis, S. Rankin","doi":"10.1142/9789814335652_0001","DOIUrl":null,"url":null,"abstract":"• A proposition is a declarative statement (sentence) that is true or false. For example, “Mars is a planet” is a proposition that is true, and “Jupiter is a star” is a proposition that is false. Questions, commands and exclamations are examples of sentences that are not propositions. • Truth values: They are the values “true” (denoted T) and “false” (denoted F). • A proposition that conveys a single fact is called a simple proposition. • Simple propositions can be combined and/or negated, using so-called logical connectives, to form more elaborate propositions called compound propositions. • Logical connectives: They are the logical operations “and”, “or”, and “not”. The first two are binary operations, that is, they take two operands where each operand is a proposition. The “not” is a unary operation in that it takes a single operation. • Examples of compound propositions: o Mars is a planet and Jupiter is a star o Mars is a planet or Jupiter is a star o not (Jupiter is a star). In plain English, this statement means “Jupiter is not a star”. o Mars is a planet and (Jupiter is a star or not(Pluto is a comet)) • Notations: o The operation “and” is denoted ∧. (In Boolean algebra, it is denoted by the dot “.” ). o The operation “or” is denoted ∨. (In Boolean algebra, it is denoted by + ). o The operation “not” is denoted ¬, ~, ̅(overbar), or ′. • Logic is concerned much more about the truth values of propositions than about their meanings. • Therefore, and for convenience and efficiency, propositions are often denoted with single-letter symbols such as p, q, r, etc. And the focus is on whether a proposition p is true or false, rather than on what p means/designates. For example, we can denote “Mars is a planet” by p, “Jupiter is a star” by q, and “Pluto is a comet” by r. Then the above examples of compound statements can be succinctly represented as: o “Mars is a planet and Jupiter is a star”: pp ∧ qq. This (i.e., pp ∧ qq) is called a conjunction. o “Mars is a planet or Jupiter is a star”: pp ∨ qq. This (i.e., pp ∨ qq) is called a disjunction. o “not (Jupiter is a star)”: ¬pp, ~pp, ?̅?p, or pp′.","PeriodicalId":258847,"journal":{"name":"Advanced Mathematics","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Logic and Proofs\",\"authors\":\"C. Reis, S. Rankin\",\"doi\":\"10.1142/9789814335652_0001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"• A proposition is a declarative statement (sentence) that is true or false. For example, “Mars is a planet” is a proposition that is true, and “Jupiter is a star” is a proposition that is false. Questions, commands and exclamations are examples of sentences that are not propositions. • Truth values: They are the values “true” (denoted T) and “false” (denoted F). • A proposition that conveys a single fact is called a simple proposition. • Simple propositions can be combined and/or negated, using so-called logical connectives, to form more elaborate propositions called compound propositions. • Logical connectives: They are the logical operations “and”, “or”, and “not”. The first two are binary operations, that is, they take two operands where each operand is a proposition. The “not” is a unary operation in that it takes a single operation. • Examples of compound propositions: o Mars is a planet and Jupiter is a star o Mars is a planet or Jupiter is a star o not (Jupiter is a star). In plain English, this statement means “Jupiter is not a star”. o Mars is a planet and (Jupiter is a star or not(Pluto is a comet)) • Notations: o The operation “and” is denoted ∧. (In Boolean algebra, it is denoted by the dot “.” ). o The operation “or” is denoted ∨. (In Boolean algebra, it is denoted by + ). o The operation “not” is denoted ¬, ~, ̅(overbar), or ′. • Logic is concerned much more about the truth values of propositions than about their meanings. • Therefore, and for convenience and efficiency, propositions are often denoted with single-letter symbols such as p, q, r, etc. And the focus is on whether a proposition p is true or false, rather than on what p means/designates. For example, we can denote “Mars is a planet” by p, “Jupiter is a star” by q, and “Pluto is a comet” by r. Then the above examples of compound statements can be succinctly represented as: o “Mars is a planet and Jupiter is a star”: pp ∧ qq. This (i.e., pp ∧ qq) is called a conjunction. o “Mars is a planet or Jupiter is a star”: pp ∨ qq. This (i.e., pp ∨ qq) is called a disjunction. o “not (Jupiter is a star)”: ¬pp, ~pp, ?̅?p, or pp′.\",\"PeriodicalId\":258847,\"journal\":{\"name\":\"Advanced Mathematics\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advanced Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/9789814335652_0001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advanced Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/9789814335652_0001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

命题是一个真假的陈述句(句子)。例如,“火星是一颗行星”是一个真命题,而“木星是一颗恒星”是一个假命题。疑问句、命令句和感叹句都是非命题句的例子。•真值:它们是值“真”(表示T)和“假”(表示F)。•传达单一事实的命题称为简单命题。•简单的命题可以组合和/或否定,使用所谓的逻辑连接词,形成更复杂的命题,称为复合命题。•逻辑连接词:它们是逻辑操作“and”、“or”和“not”。前两种是二元操作,也就是说,它们接受两个操作数,其中每个操作数是一个命题。“not”是一元操作,因为它只进行一次操作。•复合命题的例子:o火星是一颗行星,木星是一颗恒星o火星是一颗行星或木星是一颗恒星o not(木星是一颗恒星)。用简单的英语来说,这句话的意思是“木星不是一颗恒星”。o火星是行星(木星是不是恒星(冥王星是彗星))•注记:o操作“和”记为∧。(在布尔代数中,用点“”表示。”)。o对“或”操作进行∨表示。(在布尔代数中,用+表示)。o操作“not”表示为¬、~、`(上划线)或`。•逻辑学更关心命题的真值,而不是它们的意义。•因此,为了方便和效率,命题通常用单字母符号表示,如p、q、r等。重点是命题p是真还是假,而不是p的意思/所指。例如,我们可以用p表示“火星是一颗行星”,用q表示“木星是一颗恒星”,用r表示“冥王星是一颗彗星”。那么上述复合语句的例子可以简洁地表示为:o“火星是一颗行星,木星是一颗恒星”:pp∧qq。这(即pp∧qq)称为合取。o“火星是行星还是木星是恒星”:pp∨qq。这种(即pp∨qq)称为析取。o“not(木星是一颗恒星)”:¬pp, ~pp, ?P或pp '。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Logic and Proofs
• A proposition is a declarative statement (sentence) that is true or false. For example, “Mars is a planet” is a proposition that is true, and “Jupiter is a star” is a proposition that is false. Questions, commands and exclamations are examples of sentences that are not propositions. • Truth values: They are the values “true” (denoted T) and “false” (denoted F). • A proposition that conveys a single fact is called a simple proposition. • Simple propositions can be combined and/or negated, using so-called logical connectives, to form more elaborate propositions called compound propositions. • Logical connectives: They are the logical operations “and”, “or”, and “not”. The first two are binary operations, that is, they take two operands where each operand is a proposition. The “not” is a unary operation in that it takes a single operation. • Examples of compound propositions: o Mars is a planet and Jupiter is a star o Mars is a planet or Jupiter is a star o not (Jupiter is a star). In plain English, this statement means “Jupiter is not a star”. o Mars is a planet and (Jupiter is a star or not(Pluto is a comet)) • Notations: o The operation “and” is denoted ∧. (In Boolean algebra, it is denoted by the dot “.” ). o The operation “or” is denoted ∨. (In Boolean algebra, it is denoted by + ). o The operation “not” is denoted ¬, ~, ̅(overbar), or ′. • Logic is concerned much more about the truth values of propositions than about their meanings. • Therefore, and for convenience and efficiency, propositions are often denoted with single-letter symbols such as p, q, r, etc. And the focus is on whether a proposition p is true or false, rather than on what p means/designates. For example, we can denote “Mars is a planet” by p, “Jupiter is a star” by q, and “Pluto is a comet” by r. Then the above examples of compound statements can be succinctly represented as: o “Mars is a planet and Jupiter is a star”: pp ∧ qq. This (i.e., pp ∧ qq) is called a conjunction. o “Mars is a planet or Jupiter is a star”: pp ∨ qq. This (i.e., pp ∨ qq) is called a disjunction. o “not (Jupiter is a star)”: ¬pp, ~pp, ?̅?p, or pp′.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书