{"title":"布尔逻辑","authors":"Martin Frické","doi":"10.4135/9781446288061.n17","DOIUrl":null,"url":null,"abstract":"The article describes and explains Boolean logic (or Boolean algebra) in its two principal forms: that of truth-values and the Boolean connectives and, or, and not, and that of set membership and the set operations of intersection, union and complement. The main application areas of Boolean logic to knowledge organization, namely post-coordinate indexing and search, are introduced and discussed. Some wider application areas are briefly mentioned, such as: propositional logic, the Shannon-style approach to electrical switching and logic gates, computer programming languages, probability theory, and database queries. An analysis is offered of shortcomings that Boolean logic has in terms of potential uses in knowledge organization.","PeriodicalId":46091,"journal":{"name":"Knowledge Organization","volume":"8 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Boolean Logic\",\"authors\":\"Martin Frické\",\"doi\":\"10.4135/9781446288061.n17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The article describes and explains Boolean logic (or Boolean algebra) in its two principal forms: that of truth-values and the Boolean connectives and, or, and not, and that of set membership and the set operations of intersection, union and complement. The main application areas of Boolean logic to knowledge organization, namely post-coordinate indexing and search, are introduced and discussed. Some wider application areas are briefly mentioned, such as: propositional logic, the Shannon-style approach to electrical switching and logic gates, computer programming languages, probability theory, and database queries. An analysis is offered of shortcomings that Boolean logic has in terms of potential uses in knowledge organization.\",\"PeriodicalId\":46091,\"journal\":{\"name\":\"Knowledge Organization\",\"volume\":\"8 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Knowledge Organization\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.4135/9781446288061.n17\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"INFORMATION SCIENCE & LIBRARY SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Knowledge Organization","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.4135/9781446288061.n17","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"INFORMATION SCIENCE & LIBRARY SCIENCE","Score":null,"Total":0}
引用次数: 3
摘要
本文描述和解释了布尔逻辑(或布尔代数)的两种主要形式:真值和布尔连接词and, or, and not的形式,集合隶属度和交集,并和补的集合运算的形式。介绍并讨论了布尔逻辑在知识组织中的主要应用领域,即后坐标索引和搜索。简要地提到了一些更广泛的应用领域,例如:命题逻辑、香农风格的电气开关和逻辑门方法、计算机编程语言、概率论和数据库查询。分析了布尔逻辑在知识组织中的潜在应用方面的缺点。
The article describes and explains Boolean logic (or Boolean algebra) in its two principal forms: that of truth-values and the Boolean connectives and, or, and not, and that of set membership and the set operations of intersection, union and complement. The main application areas of Boolean logic to knowledge organization, namely post-coordinate indexing and search, are introduced and discussed. Some wider application areas are briefly mentioned, such as: propositional logic, the Shannon-style approach to electrical switching and logic gates, computer programming languages, probability theory, and database queries. An analysis is offered of shortcomings that Boolean logic has in terms of potential uses in knowledge organization.