首页 > 最新文献

Journal of Mathematical Logic最新文献

英文 中文
Model theory of differential fields with finite group actions 有限群作用下微分场的模型理论
IF 0.9 1区 数学 Q1 LOGIC Pub Date : 2020-12-28 DOI: 10.1142/s0219061322500027
D. Hoffmann, Omar Le'on S'anchez
Let G be a finite group. We explore the model theoretic properties of the class of differential fields of characteristic zero in m commuting derivations equipped with a G-action by differential field automorphisms. In the language of G-differential rings (i.e. the language of rings with added symbols for derivations and automorphisms), we prove that this class has a modelcompanion – denoted G -DCF0,m. We then deploy the model-theoretic tools developed in the first author’s paper [11] to show that any model of G -DCF0,m is supersimple (but unstable whenG is nontrivial), a PAC-differential field (and hence differentially large in the sense of the second author and Tressl [30]), and admits elimination of imaginaries after adding a tuple of parameters. We also address model-completeness and supersimplicity of theories of bounded PACdifferential fields (extending the results of Chatzidakis-Pillay [5] on bounded PAC-fields).
设G是一个有限群。利用微分场自同构探讨了具有g作用的m个交换导数中特征为零的微分场的模型理论性质。在G微分环语言中(即带派生和自同构符号的环语言),我们证明了该类有一个模型伴子-记为G- dcf0,m。然后,我们使用第一作者论文[11]中开发的模型理论工具来证明G -DCF0,m的任何模型都是超简单的(但当eng是非平凡时不稳定),是pac -微分场(因此在第二作者和Tressl[30]的意义上是差分大的),并且在添加元组参数后允许消除虚。我们还讨论了有界pac微分场理论的模型完备性和超简单性(扩展了Chatzidakis-Pillay[5]关于有界pac微分场的结果)。
{"title":"Model theory of differential fields with finite group actions","authors":"D. Hoffmann, Omar Le'on S'anchez","doi":"10.1142/s0219061322500027","DOIUrl":"https://doi.org/10.1142/s0219061322500027","url":null,"abstract":"Let G be a finite group. We explore the model theoretic properties of the class of differential fields of characteristic zero in m commuting derivations equipped with a G-action by differential field automorphisms. In the language of G-differential rings (i.e. the language of rings with added symbols for derivations and automorphisms), we prove that this class has a modelcompanion – denoted G -DCF0,m. We then deploy the model-theoretic tools developed in the first author’s paper [11] to show that any model of G -DCF0,m is supersimple (but unstable whenG is nontrivial), a PAC-differential field (and hence differentially large in the sense of the second author and Tressl [30]), and admits elimination of imaginaries after adding a tuple of parameters. We also address model-completeness and supersimplicity of theories of bounded PACdifferential fields (extending the results of Chatzidakis-Pillay [5] on bounded PAC-fields).","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"12 1","pages":"2250002:1-2250002:31"},"PeriodicalIF":0.9,"publicationDate":"2020-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82173119","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
Extender-based forcings with overlapping extenders and negations of the Shelah Weak Hypothesis 具有重叠扩展器的基于扩展器的强迫与希拉弱假设的否定
IF 0.9 1区 数学 Q1 LOGIC Pub Date : 2020-12-01 DOI: 10.1142/s0219061320500130
M. Gitik
Extender based Prikry-Magidor forcing for overlapping extenders is introduced. As an application, models with strong forms of negations of the Shelah Weak Hypothesis for various cofinalities are constructed.
介绍了一种基于扩展器的重叠扩展器的Prikry-Magidor强制。作为一种应用,构造了具有各种合意性的Shelah弱假设的强否定形式的模型。
{"title":"Extender-based forcings with overlapping extenders and negations of the Shelah Weak Hypothesis","authors":"M. Gitik","doi":"10.1142/s0219061320500130","DOIUrl":"https://doi.org/10.1142/s0219061320500130","url":null,"abstract":"Extender based Prikry-Magidor forcing for overlapping extenders is introduced. As an application, models with strong forms of negations of the Shelah Weak Hypothesis for various cofinalities are constructed.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"5 1","pages":"2050013:1-2050013:34"},"PeriodicalIF":0.9,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76464539","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
The property "arithmetic-is-recursive" on a cone 圆锥上“算术-递归”的性质
IF 0.9 1区 数学 Q1 LOGIC Pub Date : 2020-11-20 DOI: 10.1142/s0219061321500215
U. Andrews, M. Harrison-Trainor, N. Schweber
We say that a theory [Formula: see text] satisfies arithmetic-is-recursive if any [Formula: see text]-computable model of [Formula: see text] has an [Formula: see text]-computable copy; that is, the models of [Formula: see text] satisfy a sort of jump inversion. We give an example of a theory satisfying arithmetic-is-recursive non-trivially and prove that the theories satisfying arithmetic-is-recursive on a cone are exactly those theories with countably many [Formula: see text]-back-and-forth types.
我们说一个理论[公式:见文]满足算术-递归,如果任何[公式:见文]的[公式:见文]-可计算模型有一个[公式:见文]-可计算副本;也就是说,[公式:见文本]的模型满足一种跳跃反转。我们给出了一个非平凡地满足算术-递归的理论的例子,并证明了在锥上满足算术-递归的理论正是那些具有可数多个[公式:见文本]-来回类型的理论。
{"title":"The property \"arithmetic-is-recursive\" on a cone","authors":"U. Andrews, M. Harrison-Trainor, N. Schweber","doi":"10.1142/s0219061321500215","DOIUrl":"https://doi.org/10.1142/s0219061321500215","url":null,"abstract":"We say that a theory [Formula: see text] satisfies arithmetic-is-recursive if any [Formula: see text]-computable model of [Formula: see text] has an [Formula: see text]-computable copy; that is, the models of [Formula: see text] satisfy a sort of jump inversion. We give an example of a theory satisfying arithmetic-is-recursive non-trivially and prove that the theories satisfying arithmetic-is-recursive on a cone are exactly those theories with countably many [Formula: see text]-back-and-forth types.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"35 1","pages":"2150021:1-2150021:18"},"PeriodicalIF":0.9,"publicationDate":"2020-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73636152","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
The Ultrapower Axiom and the GCH 超功率公理和GCH
IF 0.9 1区 数学 Q1 LOGIC Pub Date : 2020-10-27 DOI: 10.1142/s0219061321500173
G. Goldberg
The Ultrapower Axiom is an abstract combinatorial principle inspired by the fine structure of canonical inner models of large cardinal axioms. In this paper, it is established that the Ultrapower Axiom implies that the Generalized Continuum Hypothesis holds above the least supercompact cardinal.
超功率公理是一个抽象的组合原理,灵感来自于大基本公理的规范内模型的精细结构。本文证明了超幂公理意味着广义连续统假设在最小超紧基数以上成立。
{"title":"The Ultrapower Axiom and the GCH","authors":"G. Goldberg","doi":"10.1142/s0219061321500173","DOIUrl":"https://doi.org/10.1142/s0219061321500173","url":null,"abstract":"The Ultrapower Axiom is an abstract combinatorial principle inspired by the fine structure of canonical inner models of large cardinal axioms. In this paper, it is established that the Ultrapower Axiom implies that the Generalized Continuum Hypothesis holds above the least supercompact cardinal.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"30 1","pages":"2150017:1-2150017:22"},"PeriodicalIF":0.9,"publicationDate":"2020-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83863345","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
An unpublished theorem of Solovay on OD partitions of reals into two non-OD parts, revisited 索洛维关于实数的OD划分为两个非OD部分的一个未发表的定理
IF 0.9 1区 数学 Q1 LOGIC Pub Date : 2020-10-07 DOI: 10.1142/s0219061321500148
A. Enayat, V. Kanovei
A definable pair of disjoint non-OD sets of reals (hence, indiscernible sets) exists in the Sacks and [Formula: see text]o-large generic extensions of the constructible universe L. More specifically, if [Formula: see text] is either Sacks generic or [Formula: see text]o generic real over L, then it is true in L[Formula: see text] that there is a lightface [Formula: see text] equivalence relation Q on the [Formula: see text] set [Formula: see text] with exactly two equivalence classes, and both those classes are non-OD sets.
可构造宇宙L的0个大泛型扩展中存在一对可定义的不相交的非od实数集(因此,不可分辨的集合)。更具体地说,如果[公式:见文]是Sacks泛型或[公式:见文]是L上的0个泛型实数,则在L[公式:见文]中存在一个lightface[公式:见文]等价关系Q,在[公式:见文]集合[公式:见文]上存在一个[公式:见文]等价关系Q。有两个等价类,而且这两个类都是非od集。
{"title":"An unpublished theorem of Solovay on OD partitions of reals into two non-OD parts, revisited","authors":"A. Enayat, V. Kanovei","doi":"10.1142/s0219061321500148","DOIUrl":"https://doi.org/10.1142/s0219061321500148","url":null,"abstract":"A definable pair of disjoint non-OD sets of reals (hence, indiscernible sets) exists in the Sacks and [Formula: see text]o-large generic extensions of the constructible universe L. More specifically, if [Formula: see text] is either Sacks generic or [Formula: see text]o generic real over L, then it is true in L[Formula: see text] that there is a lightface [Formula: see text] equivalence relation Q on the [Formula: see text] set [Formula: see text] with exactly two equivalence classes, and both those classes are non-OD sets.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"54 1","pages":"2150014:1-2150014:22"},"PeriodicalIF":0.9,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91082252","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}
引用次数: 9
Model-theoretic Elekes-Szabó in the strongly minimal case 模型理论Elekes-Szabó在强极小情况下
IF 0.9 1区 数学 Q1 LOGIC Pub Date : 2020-10-06 DOI: 10.1142/S0219061321500045
A. Chernikov, S. Starchenko
We prove a generalization of the Elekes–Szabó theorem [G. Elekes and E. Szabó, How to find groups? (and how to use them in Erdos geometry?), Combinatorica 32(5) 537–571 (2012)] for relations definable in strongly minimal structures that are interpretable in distal structures.
我们证明了Elekes-Szabó定理的一个推广[G]。Elekes和E. Szabó,如何找到小组?(以及如何在Erdos几何中使用它们?),Combinatorica 32(5) 537-571(2012)]用于在远端结构中可解释的强最小结构中可定义的关系。
{"title":"Model-theoretic Elekes-Szabó in the strongly minimal case","authors":"A. Chernikov, S. Starchenko","doi":"10.1142/S0219061321500045","DOIUrl":"https://doi.org/10.1142/S0219061321500045","url":null,"abstract":"We prove a generalization of the Elekes–Szabó theorem [G. Elekes and E. Szabó, How to find groups? (and how to use them in Erdos geometry?), Combinatorica 32(5) 537–571 (2012)] for relations definable in strongly minimal structures that are interpretable in distal structures.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"17 1","pages":"2150004:1-2150004:20"},"PeriodicalIF":0.9,"publicationDate":"2020-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81174572","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}
引用次数: 9
Compactness versus hugeness at successor cardinals 后继基数的紧凑性与巨大性
IF 0.9 1区 数学 Q1 LOGIC Pub Date : 2020-09-29 DOI: 10.1142/s0219061322500167
Sean D. Cox, Monroe Eskew
If $kappa$ is regular and $2^{
如果$kappa$是正则的并且$2^{
{"title":"Compactness versus hugeness at successor cardinals","authors":"Sean D. Cox, Monroe Eskew","doi":"10.1142/s0219061322500167","DOIUrl":"https://doi.org/10.1142/s0219061322500167","url":null,"abstract":"If $kappa$ is regular and $2^{<kappa}leqkappa^+$, then the existence of a weakly presaturated ideal on $kappa^+$ implies $square^*_kappa$. This partially answers a question of Foreman and Magidor about the approachability ideal on $omega_2$. As a corollary, we show that if there is a presaturated ideal $I$ on $omega_2$ such that $mathcal{P}(omega_2)/I$ is semiproper, then CH holds. We also show some barriers to getting the tree property and a saturated ideal simultaneously on a successor cardinal from conventional forcing methods.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"646 1","pages":"2250016:1-2250016:16"},"PeriodicalIF":0.9,"publicationDate":"2020-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77536849","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
Exact saturation in pseudo-elementary classes for simple and stable theories 简单稳定理论的准初等类的精确饱和
IF 0.9 1区 数学 Q1 LOGIC Pub Date : 2020-09-17 DOI: 10.1142/s0219061322500209
Itay Kaplan, N. Ramsey, S. Shelah
We study PC-exact saturation for stable and simple theories. Among other results, we show that PC-exact saturation characterizes the stability cardinals of size at least continuum of a countable stable theory and, additionally, that simple unstable theories have PC-exact saturation at singular cardinals, satisfying mild set-theoretic hypotheses, which had previously been open even for the random graph. We characterize supersimplicity of countable theories in terms of having PC-exact saturation at singular cardinals of countable cofinality. We also consider the local analogue of PC-exact saturation, showing that local PC-exact saturation for singular cardinals of countable cofinality characterizes supershort theories.
我们研究pc精确饱和的稳定和简单的理论。在其他结果中,我们证明了pc -精确饱和表征了至少是可数稳定理论的连续统大小的稳定基数,此外,简单的不稳定理论在奇异基数上具有pc -精确饱和,满足温和的集合论假设,这在以前甚至对随机图也是开放的。我们用在可数共通性的奇异基数上具有pc精确饱和来描述可数理论的超简单性。我们还考虑了pc -精确饱和的局部类似,证明了可数共性奇异基的局部pc -精确饱和是超短理论的特征。
{"title":"Exact saturation in pseudo-elementary classes for simple and stable theories","authors":"Itay Kaplan, N. Ramsey, S. Shelah","doi":"10.1142/s0219061322500209","DOIUrl":"https://doi.org/10.1142/s0219061322500209","url":null,"abstract":"We study PC-exact saturation for stable and simple theories. Among other results, we show that PC-exact saturation characterizes the stability cardinals of size at least continuum of a countable stable theory and, additionally, that simple unstable theories have PC-exact saturation at singular cardinals, satisfying mild set-theoretic hypotheses, which had previously been open even for the random graph. We characterize supersimplicity of countable theories in terms of having PC-exact saturation at singular cardinals of countable cofinality. We also consider the local analogue of PC-exact saturation, showing that local PC-exact saturation for singular cardinals of countable cofinality characterizes supershort theories.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"41 1","pages":"2250020:1-2250020:26"},"PeriodicalIF":0.9,"publicationDate":"2020-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77126301","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
Canonical fragments of the strong reflection principle 强反射原理的规范片段
IF 0.9 1区 数学 Q1 LOGIC Pub Date : 2020-09-13 DOI: 10.1142/S0219061321500239
G. Fuchs
For an arbitrary forcing class [Formula: see text], the [Formula: see text]-fragment of Todorčević’s strong reflection principle SRP is isolated in such a way that (1) the forcing axiom for [Formula: see text] implies the [Formula: see text]-fragment of SRP , (2) the stationary set preserving fragment of SRP is the full principle SRP , and (3) the subcomplete fragment of SRP implies the major consequences of the subcomplete forcing axiom. This fragment of SRP is consistent with CH , and even with Jensen’s principle [Formula: see text]. Along the way, some hitherto unknown effects of (the subcomplete fragment of) SRP on mutual stationarity are explored, and some limitations to the extent to which fragments of SRP may capture the effects of their corresponding forcing axioms are established.
对于任意强迫类[公式:见文],todor evevic强反射原理SRP的[公式:见文]片段以这样的方式被孤立:(1)[公式:见文]的强迫公理暗示[公式:见文]的SRP片段,(2)SRP的平稳集保持片段是完整原则SRP, (3) SRP的次完备片段暗示次完备强迫公理的主要结果。这段SRP与CH,甚至与Jensen原理一致[公式:见文]。在此过程中,探索了SRP(亚完全片段)对相互平稳性的一些迄今未知的影响,并建立了SRP片段可能捕获其相应强迫公理影响的程度的一些限制。
{"title":"Canonical fragments of the strong reflection principle","authors":"G. Fuchs","doi":"10.1142/S0219061321500239","DOIUrl":"https://doi.org/10.1142/S0219061321500239","url":null,"abstract":"For an arbitrary forcing class [Formula: see text], the [Formula: see text]-fragment of Todorčević’s strong reflection principle SRP is isolated in such a way that (1) the forcing axiom for [Formula: see text] implies the [Formula: see text]-fragment of SRP , (2) the stationary set preserving fragment of SRP is the full principle SRP , and (3) the subcomplete fragment of SRP implies the major consequences of the subcomplete forcing axiom. This fragment of SRP is consistent with CH , and even with Jensen’s principle [Formula: see text]. Along the way, some hitherto unknown effects of (the subcomplete fragment of) SRP on mutual stationarity are explored, and some limitations to the extent to which fragments of SRP may capture the effects of their corresponding forcing axioms are established.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"26 1","pages":"2150023:1-2150023:58"},"PeriodicalIF":0.9,"publicationDate":"2020-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78247006","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}
引用次数: 4
New jump operators on equivalence relations 等价关系上的新跳转算子
IF 0.9 1区 数学 Q1 LOGIC Pub Date : 2020-08-15 DOI: 10.1142/S0219061322500155
J. Clemens, Samuel Coskey
We introduce a new family of jump operators on Borel equivalence relations; specifically, for each countable group $Gamma$ we introduce the $Gamma$-jump. We study the elementary properties of the $Gamma$-jumps and compare them with other previously studied jump operators. One of our main results is to establish that for many groups $Gamma$, the $Gamma$-jump is emph{proper} in the sense that for any Borel equivalence relation $E$ the $Gamma$-jump of $E$ is strictly higher than $E$ in the Borel reducibility hierarchy. On the other hand there are examples of groups $Gamma$ for which the $Gamma$-jump is not proper. To establish properness, we produce an analysis of Borel equivalence relations induced by continuous actions of the automorphism group of what we denote the infinite $Gamma$-tree, and relate these to iterates of the $Gamma$-jump. We also produce several new examples of equivalence relations that arise from applying the $Gamma$-jump to classically studied equivalence relations and derive generic ergodicity results related to these. We apply our results to show that the complexity of the isomorphism problem for countable scattered linear orders properly increases with the rank.
在Borel等价关系上引入了一类新的跳跃算子;具体来说,对于每个可数群$Gamma$,我们引入$Gamma$ -跳转。我们研究了$Gamma$ -跳跃算子的基本性质,并将它们与其他先前研究过的跳跃算子进行了比较。我们的主要结果之一是建立了对于许多群$Gamma$, $Gamma$ -跳转是emph{适当}的,因为对于任何Borel等价关系$E$, $E$的$Gamma$ -跳转在Borel可约性层次结构中严格高于$E$。另一方面,也有一些组$Gamma$的例子,其中$Gamma$ -跳转是不合适的。为了证明其正确性,我们分析了无限$Gamma$ -树的自同构群的连续作用所引起的Borel等价关系,并将其与$Gamma$ -跳的迭代联系起来。我们还提出了几个新的等价关系的例子,这些例子是通过将$Gamma$ -jump应用于经典研究的等价关系而产生的,并推导了与这些等价关系相关的一般遍历性结果。我们应用我们的结果证明了可数离散线性序列的同构问题的复杂度随秩适当增加。
{"title":"New jump operators on equivalence relations","authors":"J. Clemens, Samuel Coskey","doi":"10.1142/S0219061322500155","DOIUrl":"https://doi.org/10.1142/S0219061322500155","url":null,"abstract":"We introduce a new family of jump operators on Borel equivalence relations; specifically, for each countable group $Gamma$ we introduce the $Gamma$-jump. We study the elementary properties of the $Gamma$-jumps and compare them with other previously studied jump operators. One of our main results is to establish that for many groups $Gamma$, the $Gamma$-jump is emph{proper} in the sense that for any Borel equivalence relation $E$ the $Gamma$-jump of $E$ is strictly higher than $E$ in the Borel reducibility hierarchy. On the other hand there are examples of groups $Gamma$ for which the $Gamma$-jump is not proper. To establish properness, we produce an analysis of Borel equivalence relations induced by continuous actions of the automorphism group of what we denote the infinite $Gamma$-tree, and relate these to iterates of the $Gamma$-jump. We also produce several new examples of equivalence relations that arise from applying the $Gamma$-jump to classically studied equivalence relations and derive generic ergodicity results related to these. We apply our results to show that the complexity of the isomorphism problem for countable scattered linear orders properly increases with the rank.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":"34 12 1","pages":"2250015:1-2250015:44"},"PeriodicalIF":0.9,"publicationDate":"2020-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77918601","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}
引用次数: 6
期刊
Journal of Mathematical Logic
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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