经典一阶逻辑中目标驱动证明搜索的一种方法

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2020-09-01 DOI:10.1109/SYNASC51798.2020.00023

Alexander V. Lyaletski, A. Lyaletsky

{"title":"经典一阶逻辑中目标驱动证明搜索的一种方法","authors":"Alexander V. Lyaletski, A. Lyaletsky","doi":"10.1109/SYNASC51798.2020.00023","DOIUrl":null,"url":null,"abstract":"An approach to a computer-oriented proof search in classical first-order logic leading to the construction of goal-driven sequent calculi that do not require skolemzation and one of which is a quantifier-rules-free one is presented. Results about the soundness and completeness of proposed sequent calculi are obtained through establishing their coextensivity with a usual Gentzen sequent calculus.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"347 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On One Approach to Goal-Driven Proof Search in Classical First-Order Logic\",\"authors\":\"Alexander V. Lyaletski, A. Lyaletsky\",\"doi\":\"10.1109/SYNASC51798.2020.00023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An approach to a computer-oriented proof search in classical first-order logic leading to the construction of goal-driven sequent calculi that do not require skolemzation and one of which is a quantifier-rules-free one is presented. Results about the soundness and completeness of proposed sequent calculi are obtained through establishing their coextensivity with a usual Gentzen sequent calculus.\",\"PeriodicalId\":278104,\"journal\":{\"name\":\"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"347 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC51798.2020.00023\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC51798.2020.00023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种经典一阶逻辑中面向计算机的证明搜索方法，该方法可构造目标驱动的序列演算，该演算不需要初始化，其中一个是无量词规则的序列演算。通过与一般根岑序演算建立其共广泛性，得到了所提序演算的完备性和完备性。

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

查看原文本刊更多论文

On One Approach to Goal-Driven Proof Search in Classical First-Order Logic

An approach to a computer-oriented proof search in classical first-order logic leading to the construction of goal-driven sequent calculi that do not require skolemzation and one of which is a quantifier-rules-free one is presented. Results about the soundness and completeness of proposed sequent calculi are obtained through establishing their coextensivity with a usual Gentzen sequent calculus.

求助全文

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

来源期刊

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

自引率

0.00%

发文量