Pub Date : 2019-01-31DOI: 10.1142/S0219061321500112
F. Wehrung
Anti-elementarity is a strong way of ensuring that a class of structures , in a given first-order language, is not closed under elementary equivalence with respect to any infinitary language of the form L ∞λ. We prove that many naturally defined classes are anti-elementary, including the following: • the class of all lattices of finitely generated convex l-subgroups of members of any class of l-groups containing all Archimedean l-groups; • the class of all semilattices of finitely generated l-ideals of members of any nontrivial quasivariety of l-groups; • the class of all Stone duals of spectra of MV-algebras-this yields a negative solution for the MV-spectrum Problem; • the class of all semilattices of finitely generated two-sided ideals of rings; • the class of all semilattices of finitely generated submodules of modules; • the class of all monoids encoding the nonstable K_0-theory of von Neumann regular rings, respectively C*-algebras of real rank zero; • (assuming arbitrarily large Erd˝os cardinals) the class of all coordinatizable sectionally complemented modular lattices with a large 4-frame. The main underlying principle is that under quite general conditions, for a functor Φ : A → B, if there exists a non-commutative diagram D of A, indexed by a common sort of poset called an almost join-semilattice, such that • Φ D^I is a commutative diagram for every set I, • Φ D is not isomorphic to Φ X for any commutative diagram X in A, then the range of Φ is anti-elementary.
{"title":"From noncommutative diagrams to anti-elementary classes","authors":"F. Wehrung","doi":"10.1142/S0219061321500112","DOIUrl":"https://doi.org/10.1142/S0219061321500112","url":null,"abstract":"Anti-elementarity is a strong way of ensuring that a class of structures , in a given first-order language, is not closed under elementary equivalence with respect to any infinitary language of the form L ∞λ. We prove that many naturally defined classes are anti-elementary, including the following: • the class of all lattices of finitely generated convex l-subgroups of members of any class of l-groups containing all Archimedean l-groups; • the class of all semilattices of finitely generated l-ideals of members of any nontrivial quasivariety of l-groups; • the class of all Stone duals of spectra of MV-algebras-this yields a negative solution for the MV-spectrum Problem; • the class of all semilattices of finitely generated two-sided ideals of rings; • the class of all semilattices of finitely generated submodules of modules; • the class of all monoids encoding the nonstable K_0-theory of von Neumann regular rings, respectively C*-algebras of real rank zero; • (assuming arbitrarily large Erd˝os cardinals) the class of all coordinatizable sectionally complemented modular lattices with a large 4-frame. The main underlying principle is that under quite general conditions, for a functor Φ : A → B, if there exists a non-commutative diagram D of A, indexed by a common sort of poset called an almost join-semilattice, such that • Φ D^I is a commutative diagram for every set I, • Φ D is not isomorphic to Φ X for any commutative diagram X in A, then the range of Φ is anti-elementary.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2019-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77701518","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}
Pub Date : 2019-01-20DOI: 10.1142/s0219061322500180
Natasha Dobrinen
For $kge 3$, the Henson graph $mathcal{H}_k$ is the analogue of the Rado graph in which $k$-cliques are forbidden. Building on the author's result for $mathcal{H}_3$, we prove that for each $kge 4$, $mathcal{H}_k$ has finite big Ramsey degrees: To each finite $k$-clique-free graph $G$, there corresponds an integer $T(G,mathcal{H}_k)$ such that for any coloring of the copies of $G$ in $mathcal{H}_k$ into finitely many colors, there is a subgraph of $mathcal{H}_k$, again isomorphic to $mathcal{H}_k$, in which the coloring takes no more than $T(G, mathcal{H}_k)$ colors. Prior to this article, the Ramsey theory of $mathcal{H}_k$ for $kge 4$ had only been resolved for vertex colorings by El-Zahar and Sauer in 1989. We develop a unified framework for coding copies of $mathcal{H}_k$ into a new class of trees, called strong $mathcal{H}_k$-coding trees, and prove Ramsey theorems for these trees, forming a family of Halpern-Lauchli and Milliken-style theorems which are applied to deduce finite big Ramsey degrees. The approach here streamlines the one in cite{DobrinenH_317} for $mathcal{H}_3$ and provides a general methodology opening further study of big Ramsey degrees for homogeneous structures with forbidden configurations. The results have bearing on topological dynamics via work of Kechris, Pestov, and Todorcevic and recent work of Zucker.
{"title":"The Ramsey theory of Henson graphs","authors":"Natasha Dobrinen","doi":"10.1142/s0219061322500180","DOIUrl":"https://doi.org/10.1142/s0219061322500180","url":null,"abstract":"For $kge 3$, the Henson graph $mathcal{H}_k$ is the analogue of the Rado graph in which $k$-cliques are forbidden. Building on the author's result for $mathcal{H}_3$, we prove that for each $kge 4$, $mathcal{H}_k$ has finite big Ramsey degrees: To each finite $k$-clique-free graph $G$, there corresponds an integer $T(G,mathcal{H}_k)$ such that for any coloring of the copies of $G$ in $mathcal{H}_k$ into finitely many colors, there is a subgraph of $mathcal{H}_k$, again isomorphic to $mathcal{H}_k$, in which the coloring takes no more than $T(G, mathcal{H}_k)$ colors. Prior to this article, the Ramsey theory of $mathcal{H}_k$ for $kge 4$ had only been resolved for vertex colorings by El-Zahar and Sauer in 1989. We develop a unified framework for coding copies of $mathcal{H}_k$ into a new class of trees, called strong $mathcal{H}_k$-coding trees, and prove Ramsey theorems for these trees, forming a family of Halpern-Lauchli and Milliken-style theorems which are applied to deduce finite big Ramsey degrees. The approach here streamlines the one in cite{DobrinenH_317} for $mathcal{H}_3$ and provides a general methodology opening further study of big Ramsey degrees for homogeneous structures with forbidden configurations. The results have bearing on topological dynamics via work of Kechris, Pestov, and Todorcevic and recent work of Zucker.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2019-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83856817","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}
Pub Date : 2019-01-17DOI: 10.1142/s0219061320500087
Yatir Halevi, Assaf Hasson, Franziska Jahnke
We initiate the study of definable [Formula: see text]-topologies and show that there is at most one such [Formula: see text]-topology on a [Formula: see text]-henselian NIP field. Equivalently, we show that if [Formula: see text] is a bi-valued NIP field with [Formula: see text] henselian (respectively, [Formula: see text]-henselian), then [Formula: see text] and [Formula: see text] are comparable (respectively, dependent). As a consequence, Shelah’s conjecture for NIP fields implies the henselianity conjecture for NIP fields. Furthermore, the latter conjecture is proved for any field admitting a henselian valuation with a dp-minimal residue field. We conclude by showing that Shelah’s conjecture is equivalent to the statement that any NIP field not contained in the algebraic closure of a finite field is [Formula: see text]-henselian.
我们开始研究可定义的[公式:见文]-拓扑，并证明在[公式:见文]-henselian NIP域上最多有一个这样的[公式:见文]-拓扑。同样地，我们证明，如果[Formula: see text]是一个双值NIP字段，具有[Formula: see text] henselian(分别为[Formula: see text]-henselian)，则[Formula: see text]和[Formula: see text]具有可比性(分别为依赖性)。因此，Shelah的NIP域猜想暗示了NIP域的henselianity猜想。进一步证明了后一个猜想对于任何具有最小残差域的域都具有henselian值。我们通过证明Shelah的猜想等价于任何不包含在有限域的代数闭包中的NIP域都是-henselian的命题来得出结论。
{"title":"Definable V-topologies, Henselianity and NIP","authors":"Yatir Halevi, Assaf Hasson, Franziska Jahnke","doi":"10.1142/s0219061320500087","DOIUrl":"https://doi.org/10.1142/s0219061320500087","url":null,"abstract":"We initiate the study of definable [Formula: see text]-topologies and show that there is at most one such [Formula: see text]-topology on a [Formula: see text]-henselian NIP field. Equivalently, we show that if [Formula: see text] is a bi-valued NIP field with [Formula: see text] henselian (respectively, [Formula: see text]-henselian), then [Formula: see text] and [Formula: see text] are comparable (respectively, dependent). As a consequence, Shelah’s conjecture for NIP fields implies the henselianity conjecture for NIP fields. Furthermore, the latter conjecture is proved for any field admitting a henselian valuation with a dp-minimal residue field. We conclude by showing that Shelah’s conjecture is equivalent to the statement that any NIP field not contained in the algebraic closure of a finite field is [Formula: see text]-henselian.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2019-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86061973","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}
Pub Date : 2019-01-04DOI: 10.1142/s0219061320500191
Monroe Eskew
We show that it is consistent relative to a huge cardinal that for all infinite cardinals [Formula: see text], [Formula: see text] holds and there is a stationary [Formula: see text] such that [Formula: see text] is [Formula: see text]-saturated.
{"title":"Local saturation and square everywhere","authors":"Monroe Eskew","doi":"10.1142/s0219061320500191","DOIUrl":"https://doi.org/10.1142/s0219061320500191","url":null,"abstract":"We show that it is consistent relative to a huge cardinal that for all infinite cardinals [Formula: see text], [Formula: see text] holds and there is a stationary [Formula: see text] such that [Formula: see text] is [Formula: see text]-saturated.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72370061","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}
Pub Date : 2018-12-27DOI: 10.1142/s021906132250012x
L. Kolodziejczyk, Neil Thapen
We study a new class of NP search problems, those which can be proved total using standard combinatorial reasoning based on approximate counting. Our model for this kind of reasoning is the bounded arithmetic theory [Formula: see text] of [E. Jeřábek, Approximate counting by hashing in bounded arithmetic, J. Symb. Log. 74(3) (2009) 829–860]. In particular, the Ramsey and weak pigeonhole search problems lie in the new class. We give a purely computational characterization of this class and show that, relative to an oracle, it does not contain the problem CPLS, a strengthening of PLS. As CPLS is provably total in the theory [Formula: see text], this shows that [Formula: see text] does not prove every [Formula: see text] sentence which is provable in bounded arithmetic. This answers the question posed in [S. Buss, L. A. Kołodziejczyk and N. Thapen, Fragments of approximate counting, J. Symb. Log. 79(2) (2014) 496–525] and represents some progress in the program of separating the levels of the bounded arithmetic hierarchy by low-complexity sentences. Our main technical tool is an extension of the “fixing lemma” from [P. Pudlák and N. Thapen, Random resolution refutations, Comput. Complexity, 28(2) (2019) 185–239], a form of switching lemma, which we use to show that a random partial oracle from a certain distribution will, with high probability, determine an entire computation of a [Formula: see text] oracle machine. The introduction to the paper is intended to make the statements and context of the results accessible to someone unfamiliar with NP search problems or with bounded arithmetic.
{"title":"Approximate counting and NP search problems","authors":"L. Kolodziejczyk, Neil Thapen","doi":"10.1142/s021906132250012x","DOIUrl":"https://doi.org/10.1142/s021906132250012x","url":null,"abstract":"We study a new class of NP search problems, those which can be proved total using standard combinatorial reasoning based on approximate counting. Our model for this kind of reasoning is the bounded arithmetic theory [Formula: see text] of [E. Jeřábek, Approximate counting by hashing in bounded arithmetic, J. Symb. Log. 74(3) (2009) 829–860]. In particular, the Ramsey and weak pigeonhole search problems lie in the new class. We give a purely computational characterization of this class and show that, relative to an oracle, it does not contain the problem CPLS, a strengthening of PLS. As CPLS is provably total in the theory [Formula: see text], this shows that [Formula: see text] does not prove every [Formula: see text] sentence which is provable in bounded arithmetic. This answers the question posed in [S. Buss, L. A. Kołodziejczyk and N. Thapen, Fragments of approximate counting, J. Symb. Log. 79(2) (2014) 496–525] and represents some progress in the program of separating the levels of the bounded arithmetic hierarchy by low-complexity sentences. Our main technical tool is an extension of the “fixing lemma” from [P. Pudlák and N. Thapen, Random resolution refutations, Comput. Complexity, 28(2) (2019) 185–239], a form of switching lemma, which we use to show that a random partial oracle from a certain distribution will, with high probability, determine an entire computation of a [Formula: see text] oracle machine. The introduction to the paper is intended to make the statements and context of the results accessible to someone unfamiliar with NP search problems or with bounded arithmetic.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2018-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91368069","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}
Pub Date : 2018-12-27DOI: 10.1142/s0219061320500099
E. Baro, Pantelis E. Eleftheriou, Y. Peterzil
We prove the following instance of a conjecture stated in arXiv:1103.4770. Let $G$ be an abelian semialgebraic group over a real closed field $R$ and let $X$ be a semialgebraic subset of $G$. Then the group generated by $X$ contains a generic set and, if connected, it is divisible. More generally, the same result holds when $X$ is definable in any o-minimal expansion of $R$ which is elementarily equivalent to $mathbb R_{an,exp}$. We observe that the above statement is equivalent to saying: there exists an $m$ such that $Sigma_{i=1}^m(X-X)$ is an approximate subgroup of $G$.
{"title":"Locally definable subgroups of semialgebraic groups","authors":"E. Baro, Pantelis E. Eleftheriou, Y. Peterzil","doi":"10.1142/s0219061320500099","DOIUrl":"https://doi.org/10.1142/s0219061320500099","url":null,"abstract":"We prove the following instance of a conjecture stated in arXiv:1103.4770. Let $G$ be an abelian semialgebraic group over a real closed field $R$ and let $X$ be a semialgebraic subset of $G$. Then the group generated by $X$ contains a generic set and, if connected, it is divisible. More generally, the same result holds when $X$ is definable in any o-minimal expansion of $R$ which is elementarily equivalent to $mathbb R_{an,exp}$. We observe that the above statement is equivalent to saying: there exists an $m$ such that $Sigma_{i=1}^m(X-X)$ is an approximate subgroup of $G$.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2018-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76969515","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}
Pub Date : 2018-11-20DOI: 10.1142/S0219061318500113
O. Spinas
We prove that consistently the Lebesgue null ideal is not Tukey reducible to the Silver null ideal. This contrasts with the situation for the meager ideal which, by a recent result of the author, Spinas [Silver trees and Cohen reals, Israel J. Math. 211 (2016) 473–480] is Tukey reducible to the Silver ideal.
我们一致地证明了勒贝格零理想不可以土基约化为西尔弗零理想。这与作者Spinas [Silver trees and Cohen realals, Israel J. Math. 211(2016) 473-480]最近的结果形成鲜明对比，后者可归约为Silver理想。
{"title":"No Tukey reduction of Lebesgue null to Silver null sets","authors":"O. Spinas","doi":"10.1142/S0219061318500113","DOIUrl":"https://doi.org/10.1142/S0219061318500113","url":null,"abstract":"We prove that consistently the Lebesgue null ideal is not Tukey reducible to the Silver null ideal. This contrasts with the situation for the meager ideal which, by a recent result of the author, Spinas [Silver trees and Cohen reals, Israel J. Math. 211 (2016) 473–480] is Tukey reducible to the Silver ideal.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2018-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73756013","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}
Pub Date : 2018-11-20DOI: 10.1142/S0219061318500071
Will Johnson
We construct a nontrivial definable type V field topology on any dp-minimal field [Formula: see text] that is not strongly minimal, and prove that definable subsets of [Formula: see text] have small boundary. Using this topology and its properties, we show that in any dp-minimal field [Formula: see text], dp-rank of definable sets varies definably in families, dp-rank of complete types is characterized in terms of algebraic closure, and [Formula: see text] is finite for all [Formula: see text]. Additionally, by combining the existence of the topology with results of Jahnke, Simon and Walsberg [Dp-minimal valued fields, J. Symbolic Logic 82(1) (2017) 151–165], it follows that dp-minimal fields that are neither algebraically closed nor real closed admit nontrivial definable Henselian valuations. These results are a key stepping stone toward the classification of dp-minimal fields in [Fun with fields, Ph.D. thesis, University of California, Berkeley (2016)].
在任意非强极小的dp-极小域[公式:见文]上构造了一个非平凡可定义V型域拓扑，并证明了[公式:见文]的可定义子集具有小边界。利用该拓扑及其性质，我们证明了在任意dp-极小域[公式:见文]中，可定义集的dp-rank在族中是可定义变化的，完备型的dp-rank用代数闭包表示，并且[公式:见文]对所有[公式:见文]都是有限的。此外，通过将拓扑的存在性与Jahnke, Simon和Walsberg [dp-极小值域，J. Symbolic Logic 82(1)(2017) 151-165]的结果相结合，可以得出既不是代数闭也不是实闭的dp-极小域承认非平凡可定义的Henselian值。这些结果是[Fun with fields, phd . thesis, University of California, Berkeley(2016)]中dp-minimal field分类的关键垫脚石。
{"title":"The canonical topology on dp-minimal fields","authors":"Will Johnson","doi":"10.1142/S0219061318500071","DOIUrl":"https://doi.org/10.1142/S0219061318500071","url":null,"abstract":"We construct a nontrivial definable type V field topology on any dp-minimal field [Formula: see text] that is not strongly minimal, and prove that definable subsets of [Formula: see text] have small boundary. Using this topology and its properties, we show that in any dp-minimal field [Formula: see text], dp-rank of definable sets varies definably in families, dp-rank of complete types is characterized in terms of algebraic closure, and [Formula: see text] is finite for all [Formula: see text]. Additionally, by combining the existence of the topology with results of Jahnke, Simon and Walsberg [Dp-minimal valued fields, J. Symbolic Logic 82(1) (2017) 151–165], it follows that dp-minimal fields that are neither algebraically closed nor real closed admit nontrivial definable Henselian valuations. These results are a key stepping stone toward the classification of dp-minimal fields in [Fun with fields, Ph.D. thesis, University of California, Berkeley (2016)].","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2018-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90624378","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}
Pub Date : 2018-11-14DOI: 10.1142/S0219061321500100
Alex Kruckman, Chieu-Minh Tran, Erik Walsberg
We define the interpolative fusion [Formula: see text] of a family [Formula: see text] of first-order theories over a common reduct [Formula: see text], a notion that generalizes many examples of random or generic structures in the model-theoretic literature. When each [Formula: see text] is model-complete, [Formula: see text] coincides with the model companion of [Formula: see text]. By obtaining sufficient conditions for the existence of [Formula: see text], we develop new tools to show that theories of interest have model companions.
{"title":"Interpolative fusions","authors":"Alex Kruckman, Chieu-Minh Tran, Erik Walsberg","doi":"10.1142/S0219061321500100","DOIUrl":"https://doi.org/10.1142/S0219061321500100","url":null,"abstract":"We define the interpolative fusion [Formula: see text] of a family [Formula: see text] of first-order theories over a common reduct [Formula: see text], a notion that generalizes many examples of random or generic structures in the model-theoretic literature. When each [Formula: see text] is model-complete, [Formula: see text] coincides with the model companion of [Formula: see text]. By obtaining sufficient conditions for the existence of [Formula: see text], we develop new tools to show that theories of interest have model companions.","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2018-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82798124","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}
Pub Date : 2018-11-09DOI: 10.1142/s0219061321500082
Farmer Schlutzenberg
We establish natural criteria under which normally iterable premice are iterable for stacks of normal trees. Let [Formula: see text] be a regular uncountable cardinal. Let [Formula: see text] and [Formula: see text] be an [Formula: see text]-sound premouse and [Formula: see text] be an [Formula: see text]-iteration strategy for [Formula: see text] (roughly, a normal [Formula: see text]-strategy). We define a natural condensation property for iteration strategies, inflation condensation. We show that if [Formula: see text] has inflation condensation then [Formula: see text] is [Formula: see text]-iterable (roughly, [Formula: see text] is iterable for length [Formula: see text] stacks of normal trees each of length [Formula: see text]), and moreover, we define a specific such strategy [Formula: see text] and a reduction of stacks via [Formula: see text] to normal trees via [Formula: see text]. If [Formula: see text] has the Dodd-Jensen property and [Formula: see text] then [Formula: see text] has inflation condensation. We also apply some of the techniques developed to prove that if [Formula: see text] has strong hull condensation (introduced independently by John Steel), and [Formula: see text] is [Formula: see text]-generic for an [Formula: see text]-cc forcing, then [Formula: see text] extends to an [Formula: see text]-strategy [Formula: see text] for [Formula: see text] with strong hull condensation, in the sense of [Formula: see text]. Moreover, this extension is unique. We deduce that if [Formula: see text] is [Formula: see text]-generic for a ccc forcing then [Formula: see text] and [Formula: see text] have the same [Formula: see text]-sound, [Formula: see text]-iterable premice which project to [Formula: see text].
我们建立了自然准则，在该准则下，正常可迭代的先验对象对于正常树堆栈是可迭代的。设[公式:见正文]为规则不可数基数。假设[公式:参见文本]和[公式:参见文本]是[公式:参见文本]的声音预鼠标，[公式:参见文本]是[公式:参见文本]的[公式:参见文本]的[公式:参见文本]的迭代策略(粗略地说，是一个正常的[公式:参见文本]策略)。我们定义了迭代策略的自然凝聚性质，膨胀凝聚。我们表明，如果[Formula: see text]具有膨胀冷凝，那么[Formula: see text]就是[Formula: see text]-可迭代的(粗略地说，[Formula: see text]对于长度[Formula: see text]的正常树堆栈是可迭代的[Formula: see text])，此外，我们定义了一个特定的策略[Formula: see text]，并通过[Formula: see text]将堆栈减少到通过[Formula: see text]的正常树。如果[公式:见文本]具有多德-詹森属性，而[公式:见文本]则具有膨胀凝结。我们还应用开发的一些技术来证明，如果[公式:见文]具有强船体凝结(由John Steel独立介绍)，并且[公式:见文]是[公式:见文]-通用的[公式:见文]-cc强迫，那么[公式:见文]扩展到[公式:见文]-策略[公式:见文]具有强船体凝结，在[公式:见文]的意义上。此外，这个扩展是唯一的。我们推断，如果[公式:见文]是[公式:见文]- ccc强迫的通用，那么[公式:见文]和[公式:见文]具有相同的[公式:见文]-声音，[公式:见文]-可迭代的前提，投射到[公式:见文]。
{"title":"Iterability for (transfinite) stacks","authors":"Farmer Schlutzenberg","doi":"10.1142/s0219061321500082","DOIUrl":"https://doi.org/10.1142/s0219061321500082","url":null,"abstract":"We establish natural criteria under which normally iterable premice are iterable for stacks of normal trees. Let [Formula: see text] be a regular uncountable cardinal. Let [Formula: see text] and [Formula: see text] be an [Formula: see text]-sound premouse and [Formula: see text] be an [Formula: see text]-iteration strategy for [Formula: see text] (roughly, a normal [Formula: see text]-strategy). We define a natural condensation property for iteration strategies, inflation condensation. We show that if [Formula: see text] has inflation condensation then [Formula: see text] is [Formula: see text]-iterable (roughly, [Formula: see text] is iterable for length [Formula: see text] stacks of normal trees each of length [Formula: see text]), and moreover, we define a specific such strategy [Formula: see text] and a reduction of stacks via [Formula: see text] to normal trees via [Formula: see text]. If [Formula: see text] has the Dodd-Jensen property and [Formula: see text] then [Formula: see text] has inflation condensation. We also apply some of the techniques developed to prove that if [Formula: see text] has strong hull condensation (introduced independently by John Steel), and [Formula: see text] is [Formula: see text]-generic for an [Formula: see text]-cc forcing, then [Formula: see text] extends to an [Formula: see text]-strategy [Formula: see text] for [Formula: see text] with strong hull condensation, in the sense of [Formula: see text]. Moreover, this extension is unique. We deduce that if [Formula: see text] is [Formula: see text]-generic for a ccc forcing then [Formula: see text] and [Formula: see text] have the same [Formula: see text]-sound, [Formula: see text]-iterable premice which project to [Formula: see text].","PeriodicalId":50144,"journal":{"name":"Journal of Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2018-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79870223","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：