具有扩展指示和相等的拟谓词逻辑的一阶序演算

О.S. Shkilniak, S. Shkilniak
{"title":"具有扩展指示和相等的拟谓词逻辑的一阶序演算","authors":"О.S. Shkilniak, S. Shkilniak","doi":"10.15407/pp2022.03-04.011","DOIUrl":null,"url":null,"abstract":"The paper considers new classes of software-oriented logical formalisms – pure first-order logics of partial quasiary predicates with extended renomi- nations and predicates of strong equality and of weak equality.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"First-order sequent calculi of logics of quasiary predicates with extended renominations and equality\",\"authors\":\"О.S. Shkilniak, S. Shkilniak\",\"doi\":\"10.15407/pp2022.03-04.011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper considers new classes of software-oriented logical formalisms – pure first-order logics of partial quasiary predicates with extended renomi- nations and predicates of strong equality and of weak equality.\",\"PeriodicalId\":313885,\"journal\":{\"name\":\"PROBLEMS IN PROGRAMMING\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"PROBLEMS IN PROGRAMMING\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15407/pp2022.03-04.011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"PROBLEMS IN PROGRAMMING","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15407/pp2022.03-04.011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了面向软件的新一类逻辑形式——具有扩展元的部分拟谓词的纯一阶逻辑和强相等谓词和弱相等谓词。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
First-order sequent calculi of logics of quasiary predicates with extended renominations and equality
The paper considers new classes of software-oriented logical formalisms – pure first-order logics of partial quasiary predicates with extended renomi- nations and predicates of strong equality and of weak equality.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信