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ý

引用次数: 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.

查看原文本刊更多论文

基本逻辑是可判定的

证明霍利迪命题基本逻辑可在多项式时间内解题，一阶基本逻辑可在双指数时间内解题。证明还得出了一阶正交逻辑的双指数时间判定过程。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

ACM Transactions on Computational Logic 工程技术-计算机：理论方法

CiteScore

2.30

自引率

0.00%

发文量

审稿时长

>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.