{"title":"Kripke语义中布尔函数的可定义性","authors":"Naosuke Matsuda","doi":"10.1215/00294527-2023-0011","DOIUrl":null,"url":null,"abstract":"A set F of Boolean functions is said to be functionally complete if every Boolean function is definable by combining functions in F. Post clarified when a set of Boolean functions is functionally complete (with respect to classical semantics). In this paper, by extending Post’s theorem, we clarify when a set of Boolean functions is functionally complete with respect to Kripke semantics.","PeriodicalId":51259,"journal":{"name":"Notre Dame Journal of Formal Logic","volume":"47 1","pages":"0"},"PeriodicalIF":0.6000,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Definability of Boolean Functions in Kripke Semantics\",\"authors\":\"Naosuke Matsuda\",\"doi\":\"10.1215/00294527-2023-0011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A set F of Boolean functions is said to be functionally complete if every Boolean function is definable by combining functions in F. Post clarified when a set of Boolean functions is functionally complete (with respect to classical semantics). In this paper, by extending Post’s theorem, we clarify when a set of Boolean functions is functionally complete with respect to Kripke semantics.\",\"PeriodicalId\":51259,\"journal\":{\"name\":\"Notre Dame Journal of Formal Logic\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Notre Dame Journal of Formal Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1215/00294527-2023-0011\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Notre Dame Journal of Formal Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1215/00294527-2023-0011","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}
Definability of Boolean Functions in Kripke Semantics
A set F of Boolean functions is said to be functionally complete if every Boolean function is definable by combining functions in F. Post clarified when a set of Boolean functions is functionally complete (with respect to classical semantics). In this paper, by extending Post’s theorem, we clarify when a set of Boolean functions is functionally complete with respect to Kripke semantics.
期刊介绍：
The Notre Dame Journal of Formal Logic, founded in 1960, aims to publish high quality and original research papers in philosophical logic, mathematical logic, and related areas, including papers of compelling historical interest. The Journal is also willing to selectively publish expository articles on important current topics of interest as well as book reviews.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
