Definability of Boolean Functions in Kripke Semantics

IF 0.6 3区 数学 Q2 LOGIC Notre Dame Journal of Formal Logic Pub Date : 2023-08-01 DOI:10.1215/00294527-2023-0011
Naosuke Matsuda
{"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":null,"pages":null},"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}
引用次数: 0

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Kripke语义中布尔函数的可定义性
如果每个布尔函数都可以通过组合F中的函数来定义,那么一个布尔函数集F就被称为功能完备的。Post澄清了什么时候一组布尔函数集是功能完备的(相对于经典语义)。在本文中,通过扩展Post定理,我们澄清了关于Kripke语义的一组布尔函数何时是函数完备的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.00
自引率
14.30%
发文量
14
审稿时长
>12 weeks
期刊介绍: 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.
期刊最新文献
An Invitation to Extension Domination Substitutional Validity for Modal Logic Weak Kleene and Other Weak Logics of Conditionals Lower Bounds of Sets of P-points Definability of Boolean Functions in Kripke Semantics
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1