广义可实现性与直觉逻辑

IF 0.7 4区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS ACM Transactions on Computational Logic Pub Date : 2022-09-29 DOI:https://dl.acm.org/doi/10.1145/3565367

Aleksandr Yu. Konovalov

{"title":"广义可实现性与直觉逻辑","authors":"Aleksandr Yu. Konovalov","doi":"https://dl.acm.org/doi/10.1145/3565367","DOIUrl":null,"url":null,"abstract":"Let V be a set of number-theoretical functions. We define a notion of V-realizability for predicate formulas in such a way that the indices of functions in V are used for interpreting the implication and the universal quantifier. In this paper we prove that Intuitionistic Predicate Calculus is sound with respect to the semantics of V-realizability if and only if some natural conditions for V hold.","PeriodicalId":50916,"journal":{"name":"ACM Transactions on Computational Logic","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2022-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Generalized Realizability and Intuitionistic Logic\",\"authors\":\"Aleksandr Yu. Konovalov\",\"doi\":\"https://dl.acm.org/doi/10.1145/3565367\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let V be a set of number-theoretical functions. We define a notion of V-realizability for predicate formulas in such a way that the indices of functions in V are used for interpreting the implication and the universal quantifier. In this paper we prove that Intuitionistic Predicate Calculus is sound with respect to the semantics of V-realizability if and only if some natural conditions for V hold.\",\"PeriodicalId\":50916,\"journal\":{\"name\":\"ACM Transactions on Computational Logic\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2022-09-29\",\"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/https://dl.acm.org/doi/10.1145/3565367\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Computational Logic","FirstCategoryId":"94","ListUrlMain":"https://doi.org/https://dl.acm.org/doi/10.1145/3565367","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

设V是一组数论函数。我们定义了谓词公式的V可实现性的概念，用V中函数的指标来解释其蕴涵和全称量词。本文证明了直觉谓词演算对于V可实现性的语义是健全的，当且仅当V的一些自然条件成立。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A Generalized Realizability and Intuitionistic Logic

Let V be a set of number-theoretical functions. We define a notion of V-realizability for predicate formulas in such a way that the indices of functions in V are used for interpreting the implication and the universal quantifier. In this paper we prove that Intuitionistic Predicate Calculus is sound with respect to the semantics of V-realizability if and only if some natural conditions for V hold.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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.

期刊最新文献

Computationally Hard Problems for Logic Programs under Answer Set Semantics Fundamental Logic is Decidable SAT Modulo Symmetries for Graph Generation and Enumeration Strong Backdoors for Default Logic One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus