Fundamental Logic is Decidable

IF 0.7 4区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS ACM Transactions on Computational Logic Pub Date : 2024-06-17 DOI:10.1145/3665328
J. P. Aguilera, J. Bydžovský
{"title":"Fundamental Logic is Decidable","authors":"J. P. Aguilera, J. Bydžovský","doi":"10.1145/3665328","DOIUrl":null,"url":null,"abstract":"<p>It is shown that Holliday’s propositional Fundamental Logic is decidable in polynomial time and that first-order Fundamental Logic is decidable in double-exponential time. The proof also yields a double-exponential–time decision procedure for first-order orthologic.</p>","PeriodicalId":50916,"journal":{"name":"ACM Transactions on Computational Logic","volume":"72 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2024-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Computational Logic","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/3665328","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

It is shown that Holliday’s propositional Fundamental Logic is decidable in polynomial time and that first-order Fundamental Logic is decidable in double-exponential time. The proof also yields a double-exponential–time decision procedure for first-order orthologic.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基本逻辑是可判定的
证明霍利迪命题基本逻辑可在多项式时间内解题,一阶基本逻辑可在双指数时间内解题。证明还得出了一阶正交逻辑的双指数时间判定过程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
相关文献
Cost-Effectiveness of Behavior Modification Intervention for Patients With Chronic Kidney Disease in the FROM-J Study
IF 3.2 3区 医学Journal of Renal NutritionPub Date : 2021-09-01 DOI: 10.1053/j.jrn.2020.12.008
Reiko Okubo MD, PhD , Masahide Kondo MD, MSc, PhD , Shu-Ling Hoshi PhD , Masafumi Okada MD, PhD , Mariko Doi PhD , Hideto Takahashi PhD , Hirayasu Kai MD, PhD , Chie Saito MD, PhD , Kunitoshi Iseki MD, PhD , Chiho Iseki PhD , Tsuyoshi Watanabe MD, PhD , Ichiei Narita MD, PhD , Seiichi Matsuo MD, PhD , Hirofumi Makino MD, PhD , Akira Hishida MD, PhD , Kunihiro Yamagata MD, PhD
Effectiveness of a home telemonitoring program for patients with chronic obstructive pulmonary disease in Germany: Evidence from the first three years
IF 3.7 3区 综合性期刊PLoS ONEPub Date : 2022-05-12 DOI: 10.1371/journal.pone.0267952
F. Hofer, Jonas Schreyögg, T. Stargardt
来源期刊
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic 工程技术-计算机:理论方法
CiteScore
2.30
自引率
0.00%
发文量
37
审稿时长
>12 weeks
期刊介绍: TOCL welcomes submissions related to all aspects of logic as it pertains to topics in computer science. This area has a great tradition in computer science. Several researchers who earned the ACM Turing award have also contributed to this field, namely Edgar Codd (relational database systems), Stephen Cook (complexity of logical theories), Edsger W. Dijkstra, Robert W. Floyd, Tony Hoare, Amir Pnueli, Dana Scott, Edmond M. Clarke, Allen E. Emerson, and Joseph Sifakis (program logics, program derivation and verification, programming languages semantics), Robin Milner (interactive theorem proving, concurrency calculi, and functional programming), and John McCarthy (functional programming and logics in AI). Logic continues to play an important role in computer science and has permeated several of its areas, including artificial intelligence, computational complexity, database systems, and programming languages. The Editorial Board of this journal seeks and hopes to attract high-quality submissions in all the above-mentioned areas of computational logic so that TOCL becomes the standard reference in the field. Both theoretical and applied papers are sought. Submissions showing novel use of logic in computer science are especially welcome.
期刊最新文献
Fundamental Logic is Decidable Strong Backdoors for Default Logic One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus Stackelberg-Pareto Synthesis First-Order Temporal Logic on Finite Traces: Semantic Properties, Decidable Fragments, and Applications
×
引用
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