Infinitary logic with infinite sequents: syntactic investigations

IF 0.4 4区 数学 Q4 LOGIC Mathematical Logic Quarterly Pub Date : 2023-12-04 DOI:10.1002/malq.202300011
Matteo Tesi
{"title":"Infinitary logic with infinite sequents: syntactic investigations","authors":"Matteo Tesi","doi":"10.1002/malq.202300011","DOIUrl":null,"url":null,"abstract":"<p>The present paper deals with a purely syntactic analysis of infinitary logic with infinite sequents. In particular, we discuss sequent calculi for classical and intuitionistic infinitary logic with good structural properties based on sequents possibly containing infinitely many formulas. A cut admissibility proof is proposed which employs a new strategy and a new inductive parameter. We conclude the paper by discussing related issues and possible themes for future research.</p>","PeriodicalId":49864,"journal":{"name":"Mathematical Logic Quarterly","volume":"70 1","pages":"79-98"},"PeriodicalIF":0.4000,"publicationDate":"2023-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Logic Quarterly","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/malq.202300011","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 0

Abstract

The present paper deals with a purely syntactic analysis of infinitary logic with infinite sequents. In particular, we discuss sequent calculi for classical and intuitionistic infinitary logic with good structural properties based on sequents possibly containing infinitely many formulas. A cut admissibility proof is proposed which employs a new strategy and a new inductive parameter. We conclude the paper by discussing related issues and possible themes for future research.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有无限序列的无限逻辑:句法研究
本文讨论了具有无穷序列的无穷逻辑的纯句法分析。特别地,我们讨论了基于可能包含无限多个公式的序列的具有良好结构性质的经典和直觉无穷逻辑的序列演算。提出了一种采用新策略和新归纳参数的割容许性证明方法。最后,我们讨论了相关问题和未来可能的研究主题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
0.60
自引率
0.00%
发文量
49
审稿时长
>12 weeks
期刊介绍: Mathematical Logic Quarterly publishes original contributions on mathematical logic and foundations of mathematics and related areas, such as general logic, model theory, recursion theory, set theory, proof theory and constructive mathematics, algebraic logic, nonstandard models, and logical aspects of theoretical computer science.
期刊最新文献
Issue Information Decidable quasivarieties of p-algebras Issue Information Limit models in strictly stable abstract elementary classes Apartness relations between propositions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1