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

Studia Logica最新文献

筛选
英文 中文
A Simple Way to Overcome Hyperconnexivity 克服超连接的简单方法
IF 0.7 3区 数学
Studia Logica Pub Date : 2023-07-05 DOI: 10.1007/s11225-023-10056-3
A. Belikov
{"title":"A Simple Way to Overcome Hyperconnexivity","authors":"A. Belikov","doi":"10.1007/s11225-023-10056-3","DOIUrl":"https://doi.org/10.1007/s11225-023-10056-3","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"10 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85389090","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
Executability and Connexivity in an Interpretation of Griss 《格里斯》解读中的可执行性与连通性
IF 0.7 3区 数学
Studia Logica Pub Date : 2023-07-05 DOI: 10.1007/s11225-023-10055-4
T. M. Ferguson
{"title":"Executability and Connexivity in an Interpretation of Griss","authors":"T. M. Ferguson","doi":"10.1007/s11225-023-10055-4","DOIUrl":"https://doi.org/10.1007/s11225-023-10055-4","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"12 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78457348","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
Connexive Logic, Probabilistic Default Reasoning, and Compound Conditionals 连接逻辑，概率默认推理和复合条件
IF 0.7 3区 数学
Studia Logica Pub Date : 2023-06-29 DOI: 10.1007/s11225-023-10054-5
N. Pfeifer, G. Sanfilippo
{"title":"Connexive Logic, Probabilistic Default Reasoning, and Compound Conditionals","authors":"N. Pfeifer, G. Sanfilippo","doi":"10.1007/s11225-023-10054-5","DOIUrl":"https://doi.org/10.1007/s11225-023-10054-5","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"80 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74086042","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
An Algebraic Investigation of the Connexive Logic $$textsf{C}$$ 连接逻辑的代数研究 $$textsf{C}$$
IF 0.7 3区 数学
Studia Logica Pub Date : 2023-06-21 DOI: 10.1007/s11225-023-10057-2
D. Fazio, S. Odintsov
{"title":"An Algebraic Investigation of the Connexive Logic $$textsf{C}$$","authors":"D. Fazio, S. Odintsov","doi":"10.1007/s11225-023-10057-2","DOIUrl":"https://doi.org/10.1007/s11225-023-10057-2","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"11 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82669048","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
FMP-Ensuring Logics, RA-Ensuring Logics and FA-Ensuring Logics in NExtK4.3documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{documen NExtK4.3documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amssyb} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document
IF 0.7 3区 数学
Studia Logica Pub Date : 2023-06-19 DOI: 10.1007/s11225-023-10046-5
Ming Xu
{"title":"FMP-Ensuring Logics, RA-Ensuring Logics and FA-Ensuring Logics in NExtK4.3documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{documen","authors":"Ming Xu","doi":"10.1007/s11225-023-10046-5","DOIUrl":"https://doi.org/10.1007/s11225-023-10046-5","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"6 1","pages":"899 - 946"},"PeriodicalIF":0.7,"publicationDate":"2023-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90828940","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
Refutation-Aware Gentzen-Style Calculi for Propositional Until-Free Linear-Time Temporal Logic 命题非自由线性时间时间逻辑的可反驳根岑式演算
IF 0.7 3区 数学
Studia Logica Pub Date : 2023-06-14 DOI: 10.1007/s11225-023-10052-7
N. Kamide
{"title":"Refutation-Aware Gentzen-Style Calculi for Propositional Until-Free Linear-Time Temporal Logic","authors":"N. Kamide","doi":"10.1007/s11225-023-10052-7","DOIUrl":"https://doi.org/10.1007/s11225-023-10052-7","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"22 1","pages":"979 - 1014"},"PeriodicalIF":0.7,"publicationDate":"2023-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81270467","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
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":"40 1","pages":"709 - 715"},"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":"27 1","pages":""},"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":"62 1","pages":"855 - 895"},"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":"308 1","pages":""},"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
首页 上一页 下一页 尾页
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学术官方微信