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

Journal of Mathematical Logic最新文献

筛选
英文 中文
On piecewise hyperdefinable groups 关于分段超可定义群
IF 0.9 1区 数学
Journal of Mathematical Logic Pub Date : 2022-12-17 DOI: 10.1142/s0219061322500271
A. Rodriguez Fanlo
{"title":"On piecewise hyperdefinable groups","authors":"A. Rodriguez Fanlo","doi":"10.1142/s0219061322500271","DOIUrl":"https://doi.org/10.1142/s0219061322500271","url":null,"abstract":"The aim of this paper is to generalize and improve two of the main model-theoretic results of “Stable group theory and approximate subgroups” by Hrushovski to the context of piecewise hyperdefinable sets. The first one is the existence of Lie models. The second one is the Stabilizer Theorem. In the process, a systematic study of the structure of piecewise hyperdefinable sets is developed. In particular, we show the most significant properties of their logic topologies.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"1 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2022-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64341575","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Degrees of categoricity and treeable degrees 分类度和可树度
IF 0.9 1区 数学
Journal of Mathematical Logic Pub Date : 2022-09-09 DOI: 10.1142/s0219061324500028
Barbara F. Csima, D. Rossegger
{"title":"Degrees of categoricity and treeable degrees","authors":"Barbara F. Csima, D. Rossegger","doi":"10.1142/s0219061324500028","DOIUrl":"https://doi.org/10.1142/s0219061324500028","url":null,"abstract":"We give a characterization of the strong degrees of categoricity of computable structures greater or equal to $mathbf 0''$. They are precisely the emph{treeable} degrees -- the least degrees of paths through computable trees -- that compute $mathbf 0''$. As a corollary, we obtain several new examples of degrees of categoricity. Among them we show that every degree $mathbf d$ with $mathbf 0^{(alpha)}leq mathbf dleq mathbf 0^{(alpha+1)}$ for $alpha$ a computable ordinal greater than $2$ is the strong degree of categoricity of a rigid structure. Using quite different techniques we show that every degree $mathbf d$ with $mathbf 0'leq mathbf dleq mathbf 0''$ is the strong degree of categoricity of a structure. Together with the above example this answers a question of Csima and Ng. To complete the picture we show that there is a degree $mathbf d$ with $mathbf 0'<mathbf d<mathbf 0''$ that is not the degree of categoricity of a rigid structure.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":" ","pages":""},"PeriodicalIF":0.9,"publicationDate":"2022-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43179565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Forcing the Σ31-separation property 强制Σ31-separation属性
IF 0.9 1区 数学
Journal of Mathematical Logic Pub Date : 2022-06-22 DOI: 10.1142/s0219061322500088
Stefan Hoffelner
{"title":"Forcing the Σ31-separation property","authors":"Stefan Hoffelner","doi":"10.1142/s0219061322500088","DOIUrl":"https://doi.org/10.1142/s0219061322500088","url":null,"abstract":"We generically construct a model in which the [Formula: see text]-separation property is true, i.e. every pair of disjoint [Formula: see text]-sets can be separated by a [Formula: see text]-definable set. This answers an old question from the problem list “Surrealist landscape with figures” by A. Mathias from 1968. We also construct a model in which the (lightface) [Formula: see text]-separation property is true.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"105 1","pages":"2250008:1-2250008:38"},"PeriodicalIF":0.9,"publicationDate":"2022-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78558140","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Strong compactness and the ultrapower axiom I: the least strongly compact cardinal 强紧性与超幂公理1:最小强紧基数
IF 0.9 1区 数学
Journal of Mathematical Logic Pub Date : 2022-06-22 DOI: 10.1142/s0219061322500052
G. Goldberg
{"title":"Strong compactness and the ultrapower axiom I: the least strongly compact cardinal","authors":"G. Goldberg","doi":"10.1142/s0219061322500052","DOIUrl":"https://doi.org/10.1142/s0219061322500052","url":null,"abstract":"The Ultrapower Axiom is a combinatorial principle concerning the structure of large cardinals that is true in all known canonical inner models of set theory. A longstanding test question for inner model theory is the equiconsistency of strongly compact and supercompact cardinals. In this paper, it is shown that under the Ultrapower Axiom, the least strongly compact cardinal is supercompact. A number of stronger results are established, setting the stage for a complete analysis of strong compactness and supercompactness under UA that will be carried out in the sequel to this paper.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"30 1","pages":"2250005:1-2250005:41"},"PeriodicalIF":0.9,"publicationDate":"2022-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84381353","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Every Δ20 degree is a strong degree of categoricity 每一个Δ20度都是一个很强的分类度
IF 0.9 1区 数学
Journal of Mathematical Logic Pub Date : 2022-06-17 DOI: 10.1142/s0219061322500222
Barbara F. Csima, K. Ng
{"title":"Every Δ20 degree is a strong degree of categoricity","authors":"Barbara F. Csima, K. Ng","doi":"10.1142/s0219061322500222","DOIUrl":"https://doi.org/10.1142/s0219061322500222","url":null,"abstract":"","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"73 1","pages":"2250022:1-2250022:18"},"PeriodicalIF":0.9,"publicationDate":"2022-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83566442","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Decomposing Aronszajn lines 分解Aronszajn线
IF 0.9 1区 数学
Journal of Mathematical Logic Pub Date : 2022-06-17 DOI: 10.1142/s0219061322500179
Keegan Dasilva Barbosa
{"title":"Decomposing Aronszajn lines","authors":"Keegan Dasilva Barbosa","doi":"10.1142/s0219061322500179","DOIUrl":"https://doi.org/10.1142/s0219061322500179","url":null,"abstract":"","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"54 1","pages":"2250017:1-2250017:20"},"PeriodicalIF":0.9,"publicationDate":"2022-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90081332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Logical Metatheorems for Accretive and (Generalized) Monotone Set-Valued Operators 累加和(广义)单调集值算子的逻辑元定理
IF 0.9 1区 数学
Journal of Mathematical Logic Pub Date : 2022-05-03 DOI: 10.1142/s0219061323500083
Nicholas Pischke
{"title":"Logical Metatheorems for Accretive and (Generalized) Monotone Set-Valued Operators","authors":"Nicholas Pischke","doi":"10.1142/s0219061323500083","DOIUrl":"https://doi.org/10.1142/s0219061323500083","url":null,"abstract":"Accretive and monotone operator theory are central branches of nonlinear functional analysis and constitute the abstract study of set-valued mappings between function spaces. This paper deals with the computational properties of certain large classes of operators, namely accretive and (generalized) monotone set-valued ones. In particular, we develop (and extend) for this field the theoretical framework of proof mining, a program in mathematical logic that seeks to extract computational information from prima facie `non-computational' proofs from the mainstream literature. To this end, we establish logical metatheorems that guarantee and quantify the computational content of theorems pertaining to accretive and (generalized) monotone set-valued operators. On one hand, our results unify a number of recent case studies, while they also provide characterizations of central analytical notions in terms of proof theoretic ones on the other, which provides a crucial perspective on needed quantitative assumptions in future applications of proof mining to these branches.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":" ","pages":""},"PeriodicalIF":0.9,"publicationDate":"2022-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46950370","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Hindman's theorem in the hierarchy of choice principles 选择层次原则中的Hindman定理
IF 0.9 1区 数学
Journal of Mathematical Logic Pub Date : 2022-03-11 DOI: 10.1142/s0219061323500022
David J. Fern'andez-Bret'on
{"title":"Hindman's theorem in the hierarchy of choice principles","authors":"David J. Fern'andez-Bret'on","doi":"10.1142/s0219061323500022","DOIUrl":"https://doi.org/10.1142/s0219061323500022","url":null,"abstract":"In the context of $mathsf{ZF}$, we analyze a version of Hindman's finite unions theorem on infinite sets, which normally requires the Axiom of Choice to be proved. We establish the implication relations between this statement and various classical weak choice principles, thus precisely locating the strength of the statement as a weak form of the $mathsf{AC}$.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":" ","pages":""},"PeriodicalIF":0.9,"publicationDate":"2022-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45407190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Coloring closed Noetherian graphs 闭noether图的着色
IF 0.9 1区 数学
Journal of Mathematical Logic Pub Date : 2022-03-04 DOI: 10.1142/s0219061323500101
J. Zapletal
{"title":"Coloring closed Noetherian graphs","authors":"J. Zapletal","doi":"10.1142/s0219061323500101","DOIUrl":"https://doi.org/10.1142/s0219061323500101","url":null,"abstract":"If [Formula: see text] is a closed Noetherian graph on a [Formula: see text]-compact Polish space with no infinite cliques, it is consistent with the choiceless set theory ZF[Formula: see text][Formula: see text][Formula: see text]DC that [Formula: see text] is countably chromatic and there is no Vitali set.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":" ","pages":""},"PeriodicalIF":0.9,"publicationDate":"2022-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47044052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Valued fields with a total residue map 具有总残差映射的有值字段
IF 0.9 1区 数学
Journal of Mathematical Logic Pub Date : 2022-03-04 DOI: 10.1142/s0219061324500053
Konstantinos Kartas
{"title":"Valued fields with a total residue map","authors":"Konstantinos Kartas","doi":"10.1142/s0219061324500053","DOIUrl":"https://doi.org/10.1142/s0219061324500053","url":null,"abstract":"When $k$ is a finite field, Becker-Denef-Lipschitz (1979) observed that the total residue map $text{res}:k(!(t)!)to k$, which picks out the constant term of the Laurent series, is definable in the language of rings with a parameter for $t$. Driven by this observation, we study the theory $text{VF}_{text{res},iota}$ of valued fields equipped with a linear form $text{res}:Kto k$ which specializes to the residue map on the valuation ring. We prove that $text{VF}_{text{res},iota}$ does not admit a model companion. In addition, we show that the power series field $(k(!(t)!),text{res})$, equipped with such a total residue map, is undecidable whenever $k$ is an infinite field. As a consequence, we get that $(mathbb{C}(!(t)!), text{Res}_0)$ is undecidable, where $text{Res}_0:mathbb{C}(!(t)!)to mathbb{C}:fmapsto text{Res}_0(f)$ maps $f$ to its complex residue at $0$.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"13 4","pages":""},"PeriodicalIF":0.9,"publicationDate":"2022-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41293526","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"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学术官方微信