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

Journal of Symbolic Logic最新文献

筛选
英文 中文
UNDEFINABILITY OF MULTIPLICATION IN PRESBURGER ARITHMETIC WITH SETS OF POWERS 幂集普雷氏算术中乘法的不定义性
3区 数学
Journal of Symbolic Logic Pub Date : 2023-10-10 DOI: 10.1017/jsl.2023.71
CHRIS SCHULZ
{"title":"UNDEFINABILITY OF MULTIPLICATION IN PRESBURGER ARITHMETIC WITH SETS OF POWERS","authors":"CHRIS SCHULZ","doi":"10.1017/jsl.2023.71","DOIUrl":"https://doi.org/10.1017/jsl.2023.71","url":null,"abstract":"An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.","PeriodicalId":17088,"journal":{"name":"Journal of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136295795","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
FINITE UNDECIDABILITY IN NIP FIELDS 有限不确定性在nip领域
3区 数学
Journal of Symbolic Logic Pub Date : 2023-10-04 DOI: 10.1017/jsl.2023.73
BRIAN TYRRELL
{"title":"FINITE UNDECIDABILITY IN NIP FIELDS","authors":"BRIAN TYRRELL","doi":"10.1017/jsl.2023.73","DOIUrl":"https://doi.org/10.1017/jsl.2023.73","url":null,"abstract":"An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.","PeriodicalId":17088,"journal":{"name":"Journal of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135591953","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
Weak Indestructibility and Reflection 弱不可摧毁性和反射
3区 数学
Journal of Symbolic Logic Pub Date : 2023-10-04 DOI: 10.1017/jsl.2023.72
James Holland
{"title":"Weak Indestructibility and Reflection","authors":"James Holland","doi":"10.1017/jsl.2023.72","DOIUrl":"https://doi.org/10.1017/jsl.2023.72","url":null,"abstract":"An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.","PeriodicalId":17088,"journal":{"name":"Journal of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135592760","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
WEAK WELL ORDERS AND FRAÏSSÉ’S CONJECTURE 弱井阶和fraÏssÉ的猜想
3区 数学
Journal of Symbolic Logic Pub Date : 2023-09-27 DOI: 10.1017/jsl.2023.70
ANTON FREUND, DAVIDE MANCA
{"title":"WEAK WELL ORDERS AND FRAÏSSÉ’S CONJECTURE","authors":"ANTON FREUND, DAVIDE MANCA","doi":"10.1017/jsl.2023.70","DOIUrl":"https://doi.org/10.1017/jsl.2023.70","url":null,"abstract":"Abstract The notion of countable well order admits an alternative definition in terms of embeddings between initial segments. We use the framework of reverse mathematics to investigate the logical strength of this definition and its connection with Fraïssé’s conjecture, which has been proved by Laver. We also fill a small gap in Shore’s proof that Fraïssé’s conjecture implies arithmetic transfinite recursion over $mathbf {RCA}_0$ , by giving a new proof of $Sigma ^0_2$ -induction.","PeriodicalId":17088,"journal":{"name":"Journal of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135537916","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 proof complexity conjecture and the Incompleteness theorem 证明复杂性猜想和不完备性定理
3区 数学
Journal of Symbolic Logic Pub Date : 2023-09-19 DOI: 10.1017/jsl.2023.69
Jan Krajíček
{"title":"A proof complexity conjecture and the Incompleteness theorem","authors":"Jan Krajíček","doi":"10.1017/jsl.2023.69","DOIUrl":"https://doi.org/10.1017/jsl.2023.69","url":null,"abstract":"Abstract Given a sound first-order p-time theory T capable of formalizing syntax of first-order logic we define a p-time function $g_T$ that stretches all inputs by one bit and we use its properties to show that T must be incomplete. We leave it as an open problem whether for some T the range of $g_T$ intersects all infinite ${mbox {NP}}$ sets (i.e., whether it is a proof complexity generator hard for all proof systems). A propositional version of the construction shows that at least one of the following three statements is true: 1. There is no p-optimal propositional proof system (this is equivalent to the non-existence of a time-optimal propositional proof search algorithm). 2. $E not subseteq P/poly$ . 3. There exists function h that stretches all inputs by one bit, is computable in sub-exponential time, and its range $Rng(h)$ intersects all infinite ${text {NP}}$ sets.","PeriodicalId":17088,"journal":{"name":"Journal of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135015758","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
CLASSIFICATION OF ω-CATEGORICAL MONADICALLY STABLE STRUCTURES ω-绝对单稳定结构的分类
3区 数学
Journal of Symbolic Logic Pub Date : 2023-09-19 DOI: 10.1017/jsl.2023.66
BERTALAN BODOR
{"title":"CLASSIFICATION OF <i>ω</i>-CATEGORICAL MONADICALLY STABLE STRUCTURES","authors":"BERTALAN BODOR","doi":"10.1017/jsl.2023.66","DOIUrl":"https://doi.org/10.1017/jsl.2023.66","url":null,"abstract":"An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.","PeriodicalId":17088,"journal":{"name":"Journal of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135060292","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
First-order homotopical logic 一阶同调逻辑
3区 数学
Journal of Symbolic Logic Pub Date : 2023-09-18 DOI: 10.1017/jsl.2023.68
Joseph Helfer
{"title":"First-order homotopical logic","authors":"Joseph Helfer","doi":"10.1017/jsl.2023.68","DOIUrl":"https://doi.org/10.1017/jsl.2023.68","url":null,"abstract":"We introduce a homotopy-theoretic interpretation of intuitionistic first-order logic based on ideas from Homotopy Type Theory. We provide a categorical formulation of this interpretation using the framework of Grothendieck fibrations. We then use this formulation to prove the central property of this interpretation, namely homotopy invariance. To do this, we use the result from arXiv:1905.10690 that any Grothendieck fibration of the kind being considered can automatically be upgraded to a 2-dimensional fibration, after which the invariance property is reduced to an abstract theorem concerning pseudonatural transformations of morphisms into 2-dimensional fibrations.","PeriodicalId":17088,"journal":{"name":"Journal of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135110703","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
COMPUTABLE TOPOLOGICAL GROUPS 可计算拓扑群
3区 数学
Journal of Symbolic Logic Pub Date : 2023-09-18 DOI: 10.1017/jsl.2023.67
HEER TERN KOH, ALEXANDER G. MELNIKOV, KENG MENG NG
{"title":"COMPUTABLE TOPOLOGICAL GROUPS","authors":"HEER TERN KOH, ALEXANDER G. MELNIKOV, KENG MENG NG","doi":"10.1017/jsl.2023.67","DOIUrl":"https://doi.org/10.1017/jsl.2023.67","url":null,"abstract":"","PeriodicalId":17088,"journal":{"name":"Journal of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135154380","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
Coloring isosceles triangles in choiceless set theory 无选择集合论中等腰三角形的着色
3区 数学
Journal of Symbolic Logic Pub Date : 2023-09-11 DOI: 10.1017/jsl.2023.63
Yuxin Zhou
{"title":"Coloring isosceles triangles in choiceless set theory","authors":"Yuxin Zhou","doi":"10.1017/jsl.2023.63","DOIUrl":"https://doi.org/10.1017/jsl.2023.63","url":null,"abstract":"Abstract It is consistent relative to an inaccessible cardinal that ZF+DC holds, and the hypergraph of isosceles triangles on $mathbb {R}^2$ has countable chromatic number while the hypergraph of isosceles triangles on $mathbb {R}^3$ has uncountable chromatic number.","PeriodicalId":17088,"journal":{"name":"Journal of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135980726","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
Thorn forking, weak normality, and theories with selectors 荆棘分叉，弱正态性和选择器理论
3区 数学
Journal of Symbolic Logic Pub Date : 2023-09-11 DOI: 10.1017/jsl.2023.64
Daniel Max Hoffmann, Anand Pillay
{"title":"Thorn forking, weak normality, and theories with selectors","authors":"Daniel Max Hoffmann, Anand Pillay","doi":"10.1017/jsl.2023.64","DOIUrl":"https://doi.org/10.1017/jsl.2023.64","url":null,"abstract":"Abstract We discuss the role of weakly normal formulas in the theory of thorn forking, as part of a commentary on the paper [5]. We also give a counterexample to Corollary 4.2 from that paper, and in the process discuss “theories with selectors.”","PeriodicalId":17088,"journal":{"name":"Journal of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135938631","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学术官方微信