Symposium on Logical Foundations of Computer Science最新文献

筛选
英文 中文
A Non-hyperarithmetical Gödel Logic 非超算术Gödel逻辑
Symposium on Logical Foundations of Computer Science Pub Date : 2021-12-16 DOI: 10.1007/978-3-030-93100-1_1
J. P. Aguilera, J. Bydžovský, D. Fernández-Duque
{"title":"A Non-hyperarithmetical Gödel Logic","authors":"J. P. Aguilera, J. Bydžovský, D. Fernández-Duque","doi":"10.1007/978-3-030-93100-1_1","DOIUrl":"https://doi.org/10.1007/978-3-030-93100-1_1","url":null,"abstract":"","PeriodicalId":204657,"journal":{"name":"Symposium on Logical Foundations of Computer Science","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114344705","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}
引用次数: 0
Computability Models over Categories and Presheaves 类别和预轴上的可计算模型
Symposium on Logical Foundations of Computer Science Pub Date : 2021-12-16 DOI: 10.1007/978-3-030-93100-1_16
I. Petrakis
{"title":"Computability Models over Categories and Presheaves","authors":"I. Petrakis","doi":"10.1007/978-3-030-93100-1_16","DOIUrl":"https://doi.org/10.1007/978-3-030-93100-1_16","url":null,"abstract":"","PeriodicalId":204657,"journal":{"name":"Symposium on Logical Foundations of Computer Science","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127967877","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}
引用次数: 0
Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems Horn约束系统中一读驳斥的精确和参数化算法
Symposium on Logical Foundations of Computer Science Pub Date : 2021-12-16 DOI: 10.1007/978-3-030-93100-1_21
K. Subramani, P. Wojciechowski
{"title":"Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems","authors":"K. Subramani, P. Wojciechowski","doi":"10.1007/978-3-030-93100-1_21","DOIUrl":"https://doi.org/10.1007/978-3-030-93100-1_21","url":null,"abstract":"","PeriodicalId":204657,"journal":{"name":"Symposium on Logical Foundations of Computer Science","volume":"1 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129762892","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}
引用次数: 0
The Isomorphism Problem for FST Injection Structures FST注入结构的同构问题
Symposium on Logical Foundations of Computer Science Pub Date : 2021-12-16 DOI: 10.1007/978-3-030-93100-1_3
D. Cenzer, R. Krogman
{"title":"The Isomorphism Problem for FST Injection Structures","authors":"D. Cenzer, R. Krogman","doi":"10.1007/978-3-030-93100-1_3","DOIUrl":"https://doi.org/10.1007/978-3-030-93100-1_3","url":null,"abstract":"","PeriodicalId":204657,"journal":{"name":"Symposium on Logical Foundations of Computer Science","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123001901","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}
引用次数: 0
On Inverse Operators in Dynamic Epistemic Logic 动态认知逻辑中的逆算子
Symposium on Logical Foundations of Computer Science Pub Date : 2021-12-16 DOI: 10.1007/978-3-030-93100-1_14
Shota Motoura, Shin-ya Katsumata
{"title":"On Inverse Operators in Dynamic Epistemic Logic","authors":"Shota Motoura, Shin-ya Katsumata","doi":"10.1007/978-3-030-93100-1_14","DOIUrl":"https://doi.org/10.1007/978-3-030-93100-1_14","url":null,"abstract":"","PeriodicalId":204657,"journal":{"name":"Symposium on Logical Foundations of Computer Science","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129404613","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}
引用次数: 0
Andrews Skolemization May Shorten Resolution Proofs Non-elementarily Andrews Skolemization可能缩短非初等分辨率证明
Symposium on Logical Foundations of Computer Science Pub Date : 2021-12-16 DOI: 10.1007/978-3-030-93100-1_2
M. Baaz, Anela Lolic
{"title":"Andrews Skolemization May Shorten Resolution Proofs Non-elementarily","authors":"M. Baaz, Anela Lolic","doi":"10.1007/978-3-030-93100-1_2","DOIUrl":"https://doi.org/10.1007/978-3-030-93100-1_2","url":null,"abstract":"","PeriodicalId":204657,"journal":{"name":"Symposium on Logical Foundations of Computer Science","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129961368","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}
引用次数: 1
A Parametrized Family of Tversky Metrics Connecting the Jaccard Distance to an Analogue of the Normalized Information Distance 将Jaccard距离与标准化信息距离的模拟相连接的参数化Tversky度量族
Symposium on Logical Foundations of Computer Science Pub Date : 2021-12-16 DOI: 10.1007/978-3-030-93100-1_8
B. Kjos-Hanssen, S. Niraula, Soowhan Yoon
{"title":"A Parametrized Family of Tversky Metrics Connecting the Jaccard Distance to an Analogue of the Normalized Information Distance","authors":"B. Kjos-Hanssen, S. Niraula, Soowhan Yoon","doi":"10.1007/978-3-030-93100-1_8","DOIUrl":"https://doi.org/10.1007/978-3-030-93100-1_8","url":null,"abstract":"","PeriodicalId":204657,"journal":{"name":"Symposium on Logical Foundations of Computer Science","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133268775","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}
引用次数: 2
Finite Generation and Presentation Problems for Lambda Calculus and Combinatory Logic λ演算与组合逻辑的有限生成与表示问题
Symposium on Logical Foundations of Computer Science Pub Date : 2021-12-16 DOI: 10.1007/978-3-030-93100-1_20
R. Statman
{"title":"Finite Generation and Presentation Problems for Lambda Calculus and Combinatory Logic","authors":"R. Statman","doi":"10.1007/978-3-030-93100-1_20","DOIUrl":"https://doi.org/10.1007/978-3-030-93100-1_20","url":null,"abstract":"","PeriodicalId":204657,"journal":{"name":"Symposium on Logical Foundations of Computer Science","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125830962","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}
引用次数: 0
Propositional Dynamic Logic with Quantification over Regular Computation Sequences 正则计算序列上具有量化的命题动态逻辑
Symposium on Logical Foundations of Computer Science Pub Date : 2021-12-16 DOI: 10.1007/978-3-030-93100-1_19
I. Sedlár
{"title":"Propositional Dynamic Logic with Quantification over Regular Computation Sequences","authors":"I. Sedlár","doi":"10.1007/978-3-030-93100-1_19","DOIUrl":"https://doi.org/10.1007/978-3-030-93100-1_19","url":null,"abstract":"","PeriodicalId":204657,"journal":{"name":"Symposium on Logical Foundations of Computer Science","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133811779","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}
引用次数: 0
Hyperarithmetical Worm Battles 超算术蠕虫战斗
Symposium on Logical Foundations of Computer Science Pub Date : 2021-12-16 DOI: 10.1007/978-3-030-93100-1_5
David Fern'andez-Duque, Konstnatinos Papafilippou, J. Joosten
{"title":"Hyperarithmetical Worm Battles","authors":"David Fern'andez-Duque, Konstnatinos Papafilippou, J. Joosten","doi":"10.1007/978-3-030-93100-1_5","DOIUrl":"https://doi.org/10.1007/978-3-030-93100-1_5","url":null,"abstract":"","PeriodicalId":204657,"journal":{"name":"Symposium on Logical Foundations of Computer Science","volume":"245 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127538363","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}
引用次数: 0
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学术官方微信
小红书