{"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}
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.