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

arXiv - MATH - Logic最新文献

筛选
英文 中文
There is a deep 1-generic set 有一个深度 1 般集
arXiv - MATH - Logic Pub Date : 2024-09-01 DOI: arxiv-2409.00631
Ang Li
{"title":"There is a deep 1-generic set","authors":"Ang Li","doi":"arxiv-2409.00631","DOIUrl":"https://doi.org/arxiv-2409.00631","url":null,"abstract":"An infinite binary sequence is Bennett deep if, for any computable time\u0000bound, the difference between the time-bounded prefix-free Kolmogorov\u0000complexity and the prefix-free Kolmogorov complexity of its initial segments is\u0000eventually unbounded. It is known that weakly 2-generic sets are shallow, i.e.\u0000not deep. In this paper, we show that there is a deep 1-generic set.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187747","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
Limit Groups and Automorphisms of $κ$-Existentially Closed Groups κ$-存在封闭群的极限群和自动形
arXiv - MATH - Logic Pub Date : 2024-08-31 DOI: arxiv-2409.00545
Burak Kaya, Mahmut Kuzucuoğlu, Patrizia Longobardi, Mercede Maj
{"title":"Limit Groups and Automorphisms of $κ$-Existentially Closed Groups","authors":"Burak Kaya, Mahmut Kuzucuoğlu, Patrizia Longobardi, Mercede Maj","doi":"arxiv-2409.00545","DOIUrl":"https://doi.org/arxiv-2409.00545","url":null,"abstract":"The structure of automorphism groups of $kappa$-existentially closed groups\u0000are studied by Kaya-Kuzucuou{g}lu in 2022. It was proved that Aut(G) is the union of subgroups of level preserving\u0000automorphisms and $|Aut(G)|=2^kappa$ whenever $kappa$ is an inaccessible cardinal and $G$ is the unique $kappa$-existentially closed group of cardinality $kappa$. The cardinality of the automorphism group of a\u0000$kappa$-existentially closed group of cardinality $lambda>kappa$ is asked in Kourovka Notebook\u0000Question 20.40. Here we answer positively the promised case $kappa=lambda$ namely: If $G$ is a $kappa$-existentially closed group of cardinality $kappa$, then $|Aut(G)|=2^{kappa}$. We also answer Kegel's question on universal groups, namely: For any uncountable cardinal $kappa$, there exist universal groups of cardinality $kappa$.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187746","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
Strong reducibilities and set theory 强还原性与集合论
arXiv - MATH - Logic Pub Date : 2024-08-30 DOI: arxiv-2408.17393
Noah Schweber
{"title":"Strong reducibilities and set theory","authors":"Noah Schweber","doi":"arxiv-2408.17393","DOIUrl":"https://doi.org/arxiv-2408.17393","url":null,"abstract":"We study Medvedev reducibility in the context of set theory -- specifically,\u0000forcing and large cardinal hypotheses. Answering a question of Hamkins and Li\u0000cite{HaLi}, we show that the Medvedev degrees of countable ordinals are far\u0000from linearly ordered in multiple ways, our main result here being that there\u0000is a club of ordinals which is an antichain with respect to Medvedev\u0000reducibility. We then generalize these results to arbitrary\u0000``reasonably-definable\" reducibilities, under appropriate set-theoretic\u0000hypotheses. We then turn from ordinals to general structures. We show that some of the\u0000results above yield characterizations of counterexamples to Vaught's\u0000conjecture; another applies to all situations, assigning an ordinal to any\u0000reasonable class of structures and ``measure\" on that class. We end by\u0000discussing some directions for future research.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187749","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
Algebraic structure theory and interpolation failures in semilinear logics 半线性逻辑中的代数结构理论和插值失败
arXiv - MATH - Logic Pub Date : 2024-08-30 DOI: arxiv-2408.17400
Valeria Giustarini, Sara Ugolini
{"title":"Algebraic structure theory and interpolation failures in semilinear logics","authors":"Valeria Giustarini, Sara Ugolini","doi":"arxiv-2408.17400","DOIUrl":"https://doi.org/arxiv-2408.17400","url":null,"abstract":"In this work we study integral residuated chains, and we solve some open\u0000problems related to the study of the amalgamation property in varieties of\u0000residuated lattices, or equivalently, about the deductive interpolation\u0000property in substructural logics. More precisely, we find a V-formation\u0000consisting of 2-potent finite commutative integral chains that does not have an\u0000amalgam, nor a one-amalgam, in residuated chains; as most relevant\u0000consequences, this entails that the following varieties do not have the\u0000amalgamation property: semilinear commutative (integral) residuated lattices,\u0000MTL-algebras, involutive and pseudocomplemented MTL-algebras, and all of their\u0000n-potent subvarieties for n strictly larger than 1. These results entail the\u0000failure of the deductive interpolation property for the corresponding\u0000substructural logics.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187748","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
Relational Companions of Logics 逻辑学的关系伴侣
arXiv - MATH - Logic Pub Date : 2024-08-30 DOI: arxiv-2408.17019
Sankha S. Basu, Sayantan Roy
{"title":"Relational Companions of Logics","authors":"Sankha S. Basu, Sayantan Roy","doi":"arxiv-2408.17019","DOIUrl":"https://doi.org/arxiv-2408.17019","url":null,"abstract":"The variable inclusion companions of logics have lately been thoroughly\u0000studied by multiple authors. There are broadly two types of these companions:\u0000the left and the right variable inclusion companions. Another type of\u0000companions of logics induced by Hilbert-style presentations (Hilbert-style\u0000logics) were introduced in a recent paper. A sufficient condition for the\u0000restricted rules companion of a Hilbert-style logic to coincide with its left\u0000variable inclusion companion was proved there, while a necessary condition\u0000remained elusive. The present article has two parts. In the first part, we give\u0000a necessary and sufficient condition for the left variable inclusion and the\u0000restricted rules companions of a Hilbert-style logic to coincide. In the rest\u0000of the paper, we recognize that the variable inclusion restrictions used to\u0000define variable inclusion companions of a logic\u0000$langlemathcal{L},vdashrangle$ are relations from\u0000$mathcal{P}(mathcal{L})$ to $mathcal{L}$. This leads to a more general idea\u0000of a relational companion of a logical structure, a framework that we borrow\u0000from the field of universal logic. We end by showing that even Hilbert-style\u0000logics and the restricted rules companions of these can be brought under the\u0000umbrella of the general notions of logical structures and their relational\u0000companions that are discussed here.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187751","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 complexity of classifying continuous t-norms up to isomorphism 直到同构为止的连续 t-norms 分类的复杂性
arXiv - MATH - Logic Pub Date : 2024-08-29 DOI: arxiv-2408.16456
Jialiang He, Lili Shen, Yi Zhou
{"title":"The complexity of classifying continuous t-norms up to isomorphism","authors":"Jialiang He, Lili Shen, Yi Zhou","doi":"arxiv-2408.16456","DOIUrl":"https://doi.org/arxiv-2408.16456","url":null,"abstract":"It is shown that the isomorphism relation between continuous t-norms is Borel\u0000bireducible with the relation of order isomorphism between linear orders on the\u0000set of natural numbers, and therefore, it is Borel bireducible with every Borel\u0000complete equivalence relation.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187752","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
Collapsing Constructive and Intuitionistic Modal Logics 折叠构造模态逻辑和直觉模态逻辑
arXiv - MATH - Logic Pub Date : 2024-08-29 DOI: arxiv-2408.16428
Leonardo Pacheco
{"title":"Collapsing Constructive and Intuitionistic Modal Logics","authors":"Leonardo Pacheco","doi":"arxiv-2408.16428","DOIUrl":"https://doi.org/arxiv-2408.16428","url":null,"abstract":"In this note, we prove that the constructive and intuitionistic variants of\u0000the modal logic $mathsf{KB}$ coincide. This result contrasts with a recent\u0000result by Das and Marin, who showed that the constructive and intuitionistic\u0000variants of $mathsf{K}$ do not prove the same diamond-free formulas.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142188023","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
Every Polish group has a non-trivial topological group automorphism 每个波兰群都有一个非三维拓扑群自形变
arXiv - MATH - Logic Pub Date : 2024-08-28 DOI: arxiv-2408.16162
Carlos Pérez Estrada, Ulises Ariet Ramos-García
{"title":"Every Polish group has a non-trivial topological group automorphism","authors":"Carlos Pérez Estrada, Ulises Ariet Ramos-García","doi":"arxiv-2408.16162","DOIUrl":"https://doi.org/arxiv-2408.16162","url":null,"abstract":"We prove that every Polish group admits a non-trivial topological group\u0000automorphism. This answers a question posed by Forte Shinko. As a consequence,\u0000we prove that there are no uniquely homogeneous Polish groups.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187753","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 equational theory of the Weihrauch lattice with (iterated) composition 具有（迭代）构成的魏赫劳赫网格的等式理论
arXiv - MATH - Logic Pub Date : 2024-08-27 DOI: arxiv-2408.14999
Cécilia Pradic
{"title":"The equational theory of the Weihrauch lattice with (iterated) composition","authors":"Cécilia Pradic","doi":"arxiv-2408.14999","DOIUrl":"https://doi.org/arxiv-2408.14999","url":null,"abstract":"We study the equational theory of the Weihrauch lattice with composition and\u0000iterations, meaning the collection of equations between terms built from\u0000variables, the lattice operations $sqcup$, $sqcap$, the composition operator\u0000$star$ and its iteration $(-)^diamond$ , which are true however we substitute\u0000(slightly extended) Weihrauch degrees for the variables. We characterize them\u0000using B\"uchi games on finite graphs and give a complete axiomatization that\u0000derives them. The term signature and the axiomatization are reminiscent of\u0000Kleene algebras, except that we additionally have meets and the lattice\u0000operations do not fully distributes over composition. The game characterization\u0000also implies that it is decidable whether an equation is universally valid. We\u0000give some complexity bounds; in particular, the problem is Pspace-hard in\u0000general and we conjecture that it is solvable in Pspace.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187776","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
Simple Models of Randomization and Preservation Theorems 随机化和保存定理的简单模型
arXiv - MATH - Logic Pub Date : 2024-08-27 DOI: arxiv-2408.15014
Karim Khanaki, Massoud Pourmahdian
{"title":"Simple Models of Randomization and Preservation Theorems","authors":"Karim Khanaki, Massoud Pourmahdian","doi":"arxiv-2408.15014","DOIUrl":"https://doi.org/arxiv-2408.15014","url":null,"abstract":"The main purpose of this paper is to present new and more uniform\u0000model-theoretic/combinatorial proofs of the theorems (in [5] and [4]): The\u0000randomization $T^{R}$ of a complete first-order theory $T$ with $NIP$/stability\u0000is a (complete) first-order continuous theory with $NIP$/stability. The proof\u0000method for both theorems is based on the significant use of a particular type\u0000of models of $T^{R}$, namely simple models, and certain indiscernible arrays.\u0000Using simple models of $T^R$ gives the advantage of re-proving these theorems\u0000in a simpler and quantitative manner. We finally turn our attention to $NSOP$\u0000in randomization. We show that based on the definition of $NSOP$ given [11],\u0000$T^R$ is stable if and only if it is $NIP$ and $NSOP$.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142187754","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学术文献互助群
群 号：481959085
Book学术官方微信