发布求助
文献互助 智能选刊 最新文献

Logic and Machines最新文献

筛选
英文 中文
Some reordering properties for inequality proof trees 不等式证明树的一些重排序性质
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_41
M. Richter
{"title":"Some reordering properties for inequality proof trees","authors":"M. Richter","doi":"10.1007/3-540-13331-3_41","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_41","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134013744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Spektralproblem and completeness of logical decision problems 逻辑决策问题的谱问题与完备性
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_50
E. Börger
{"title":"Spektralproblem and completeness of logical decision problems","authors":"E. Börger","doi":"10.1007/3-540-13331-3_50","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_50","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129752684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Recurrence relations for the number of labeled structures on a finite set 有限集合上标记结构数目的递归关系
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_32
C. Blatter, E. Specker
{"title":"Recurrence relations for the number of labeled structures on a finite set","authors":"C. Blatter, E. Specker","doi":"10.1007/3-540-13331-3_32","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_32","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"327 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125935600","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
On r.e. inseparability of CPO index sets 关于CPO指标集的广义不可分性
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_36
D. Spreen
{"title":"On r.e. inseparability of CPO index sets","authors":"D. Spreen","doi":"10.1007/3-540-13331-3_36","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_36","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117070395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
A critical-pair/completion algorithm for finitely generated ideals in rings 环上有限生成理想的临界对补全算法
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_39
B. Buchberger
{"title":"A critical-pair/completion algorithm for finitely generated ideals in rings","authors":"B. Buchberger","doi":"10.1007/3-540-13331-3_39","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_39","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131559491","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 91
Modular decomposition of automata 自动机的模分解
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_42
Anne Brüggemann-Klein, L. Priese, D. Rödding, Rüdiger Schätz
{"title":"Modular decomposition of automata","authors":"Anne Brüggemann-Klein, L. Priese, D. Rödding, Rüdiger Schätz","doi":"10.1007/3-540-13331-3_42","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_42","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133080958","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Reduction to NP-complete problems by interpretations 通过解释简化到np完全问题
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_51
E. Dahlhaus
{"title":"Reduction to NP-complete problems by interpretations","authors":"E. Dahlhaus","doi":"10.1007/3-540-13331-3_51","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_51","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130183090","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 56
Implicit definability of finite binary trees by sets of equations 有限二叉树的方程组隐定义性
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_49
J. Tiuryn
{"title":"Implicit definability of finite binary trees by sets of equations","authors":"J. Tiuryn","doi":"10.1007/3-540-13331-3_49","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_49","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"293 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116871345","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Complexity of loop-problems in normed networks 规范网络中环问题的复杂性
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_45
H. K. Büning
{"title":"Complexity of loop-problems in normed networks","authors":"H. K. Büning","doi":"10.1007/3-540-13331-3_45","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_45","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127396613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Bounds for Hodes-Specker theorem Hodes-Specker定理的界
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_57
P. Pudlák
{"title":"Bounds for Hodes-Specker theorem","authors":"P. Pudlák","doi":"10.1007/3-540-13331-3_57","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_57","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133373577","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信