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

Studia Logica最新文献

筛选
英文 中文
Petr Cintula, Carles Noguera, Logic and Implication. An Introduction to the General Algebraic Study of Non-classical Logics, vol. 57 of Trends in Logic, Springer, 2021, pp. 465+xxii; ISBN: 978-3-030-85674-8 (Hardcover) 117.69€, ISBN: 978-3-030- 85675-5 (eBook) 93.08 €. 彼得·辛图拉，卡尔斯·诺格拉，《逻辑和暗示》。《非经典逻辑的一般代数研究导论》，《逻辑趋势》第57卷，Springer, 2021年，第465+xxii页;ISBN: 978-3-030-85674-8(精装)117.69€，ISBN: 978-3-030- 85675-5(电子书)93.08€。
IF 0.7 3区 数学
Studia Logica Pub Date : 2023-06-12 DOI: 10.1007/s11225-023-10050-9
R. Jansana
{"title":"Petr Cintula, Carles Noguera, Logic and Implication. An Introduction to the General Algebraic Study of Non-classical Logics, vol. 57 of Trends in Logic, Springer, 2021, pp. 465+xxii; ISBN: 978-3-030-85674-8 (Hardcover) 117.69€, ISBN: 978-3-030- 85675-5 (eBook) 93.08 €.","authors":"R. Jansana","doi":"10.1007/s11225-023-10050-9","DOIUrl":"https://doi.org/10.1007/s11225-023-10050-9","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90146387","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Proof Systems for Super- Strict Implication 超严格暗示的证明系统
IF 0.7 3区 数学
Studia Logica Pub Date : 2023-06-05 DOI: 10.1007/s11225-023-10048-3
G. Gherardi, E. Orlandelli, Eric Raidl
{"title":"Proof Systems for Super- Strict Implication","authors":"G. Gherardi, E. Orlandelli, Eric Raidl","doi":"10.1007/s11225-023-10048-3","DOIUrl":"https://doi.org/10.1007/s11225-023-10048-3","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85257127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Axiomatizing a Minimal Discussive Logic 最小讨论逻辑的公理化
IF 0.7 3区 数学
Studia Logica Pub Date : 2023-05-29 DOI: 10.1007/s11225-023-10042-9
Oleg M. Grigoriev, M. Nasieniewski, Krystyna Mruczek-Nasieniewska, Y. Petrukhin, V. Shangin
{"title":"Axiomatizing a Minimal Discussive Logic","authors":"Oleg M. Grigoriev, M. Nasieniewski, Krystyna Mruczek-Nasieniewska, Y. Petrukhin, V. Shangin","doi":"10.1007/s11225-023-10042-9","DOIUrl":"https://doi.org/10.1007/s11225-023-10042-9","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84478847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Situation-Based Connexive Logic 基于情境的连接逻辑
IF 0.7 3区 数学
Studia Logica Pub Date : 2023-05-29 DOI: 10.1007/s11225-023-10051-8
A. Giordani
{"title":"Situation-Based Connexive Logic","authors":"A. Giordani","doi":"10.1007/s11225-023-10051-8","DOIUrl":"https://doi.org/10.1007/s11225-023-10051-8","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76868720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
$$varvec{Brings~It~About~That}$$ Operators Decomposed with Relating Semantics $$varvec{Brings~It~About~That}$$ 用关联语义分解的操作符
IF 0.7 3区 数学
Studia Logica Pub Date : 2023-05-25 DOI: 10.1007/s11225-022-10030-5
Tomasz Jarmużek, Mateusz Klonowski, P. Kulicki
{"title":"$$varvec{Brings~It~About~That}$$ Operators Decomposed with Relating Semantics","authors":"Tomasz Jarmużek, Mateusz Klonowski, P. Kulicki","doi":"10.1007/s11225-022-10030-5","DOIUrl":"https://doi.org/10.1007/s11225-022-10030-5","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77681799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Simple Logic of the Hide and Seek Game 捉迷藏游戏的简单逻辑
3区 数学
Studia Logica Pub Date : 2023-05-17 DOI: 10.1007/s11225-023-10039-4
Dazhu Li, Sujata Ghosh, Fenrong Liu, Yaxin Tu
{"title":"A Simple Logic of the Hide and Seek Game","authors":"Dazhu Li, Sujata Ghosh, Fenrong Liu, Yaxin Tu","doi":"10.1007/s11225-023-10039-4","DOIUrl":"https://doi.org/10.1007/s11225-023-10039-4","url":null,"abstract":"We discuss a simple logic to describe one of our favourite games from childhood, hide and seek, and show how a simple addition of an equality constant to describe the winning condition of the seeker makes our logic undecidable. There are certain decidable fragments of first-order logic which behave in a similar fashion with respect to such a language extension, and we add a new modal variant to that class. We discuss the relative expressive power of the proposed logic in comparison to the standard modal counterparts. We prove that the model checking problem for the resulting logic is $$textsf{P}$$ -complete. In addition, by exploring the connection with related product logics, we gain more insight towards having a better understanding of the subtleties of the proposed framework.","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135861234","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Connexivity in the Logic of Reasons 理性逻辑中的连通性
IF 0.7 3区 数学
Studia Logica Pub Date : 2023-04-26 DOI: 10.1007/s11225-023-10041-w
Andrea Iacona
{"title":"Connexivity in the Logic of Reasons","authors":"Andrea Iacona","doi":"10.1007/s11225-023-10041-w","DOIUrl":"https://doi.org/10.1007/s11225-023-10041-w","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75252592","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Stalnakerian Connexive Logics
IF 0.7 3区 数学
Studia Logica Pub Date : 2023-04-25 DOI: 10.1007/s11225-023-10043-8
Xuefeng Wen
{"title":"Stalnakerian Connexive Logics","authors":"Xuefeng Wen","doi":"10.1007/s11225-023-10043-8","DOIUrl":"https://doi.org/10.1007/s11225-023-10043-8","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80023935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Williamson’s Abductive Case for the Material Conditional Account 威廉姆森的物质条件账户诱拐案
IF 0.7 3区 数学
Studia Logica Pub Date : 2023-04-15 DOI: 10.1007/s11225-023-10038-5
R. van Rooij, K. Krzyżanowska, I. Douven
{"title":"Williamson’s Abductive Case for the Material Conditional Account","authors":"R. van Rooij, K. Krzyżanowska, I. Douven","doi":"10.1007/s11225-023-10038-5","DOIUrl":"https://doi.org/10.1007/s11225-023-10038-5","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76275150","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A First-Order Expansion of Artemov and Protopopescu’s Intuitionistic Epistemic Logic Artemov和Protopopescu的直觉主义认知逻辑的一阶展开
IF 0.7 3区 数学
Studia Logica Pub Date : 2023-03-20 DOI: 10.1007/s11225-023-10037-6
Youan Su, Katsuhiko Sano
{"title":"A First-Order Expansion of Artemov and Protopopescu’s Intuitionistic Epistemic Logic","authors":"Youan Su, Katsuhiko Sano","doi":"10.1007/s11225-023-10037-6","DOIUrl":"https://doi.org/10.1007/s11225-023-10037-6","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86935748","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"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学术文献互助群
群 号：481959085
Book学术官方微信