纽曼引理——证明自动化和几何逻辑的案例研究，《计算机科学逻辑》专栏

{"title":"纽曼引理——证明自动化和几何逻辑的案例研究，《计算机科学逻辑》专栏","authors":"M. Bezem, T. Coquand","doi":"10.1142/9789812562494_0050","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"20 12","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Newman's lemma - a case study in proof automation and geometric logic, Logic in Computer Science Column\",\"authors\":\"M. Bezem, T. Coquand\",\"doi\":\"10.1142/9789812562494_0050\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":388781,\"journal\":{\"name\":\"Bull. EATCS\",\"volume\":\"20 12\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bull. EATCS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/9789812562494_0050\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bull. EATCS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/9789812562494_0050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}