Annals of Pure and Applied Logic最新文献

筛选
英文 中文
Computably and punctually universal spaces 可计算和准时通用空间
IF 0.6 2区 数学
Annals of Pure and Applied Logic Pub Date : 2024-07-10 DOI: 10.1016/j.apal.2024.103491
Ramil Bagaviev , Ilnur I. Batyrshin , Nikolay Bazhenov , Dmitry Bushtets , Marina Dorzhieva , Heer Tern Koh , Ruslan Kornev , Alexander G. Melnikov , Keng Meng Ng
{"title":"Computably and punctually universal spaces","authors":"Ramil Bagaviev ,&nbsp;Ilnur I. Batyrshin ,&nbsp;Nikolay Bazhenov ,&nbsp;Dmitry Bushtets ,&nbsp;Marina Dorzhieva ,&nbsp;Heer Tern Koh ,&nbsp;Ruslan Kornev ,&nbsp;Alexander G. Melnikov ,&nbsp;Keng Meng Ng","doi":"10.1016/j.apal.2024.103491","DOIUrl":"10.1016/j.apal.2024.103491","url":null,"abstract":"<div><p>We prove that the standard computable presentation of the space <span><math><mi>C</mi><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo></math></span> of continuous real-valued functions on the unit interval is computably and punctually (primitively recursively) universal. From the perspective of modern computability theory, this settles a problem raised by Sierpiński in the 1940s.</p><p>We prove that the original Urysohn's construction of the universal separable Polish space <span><math><mi>U</mi></math></span> is punctually universal. We also show that effectively compact, punctual Stone spaces are punctually homeomorphically embeddable into Cantor space <span><math><msup><mrow><mn>2</mn></mrow><mrow><mi>ω</mi></mrow></msup></math></span>; note that we do not require effective compactness be primitive recursive. We also prove that effective compactness cannot be dropped from the premises by constructing a counterexample.</p></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"176 1","pages":"Article 103491"},"PeriodicalIF":0.6,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141715638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Concerning Keisler measures over ultraproducts 关于超积物上的凯斯勒量纲
IF 0.6 2区 数学
Annals of Pure and Applied Logic Pub Date : 2024-07-09 DOI: 10.1016/j.apal.2024.103492
Kyle Gannon
{"title":"Concerning Keisler measures over ultraproducts","authors":"Kyle Gannon","doi":"10.1016/j.apal.2024.103492","DOIUrl":"10.1016/j.apal.2024.103492","url":null,"abstract":"<div><p>As consequence of the VC theorem, any pseudo-finite measure over an NIP ultraproduct is generically stable. We demonstrate a converse of this theorem and prove that any finitely approximable measure over an ultraproduct is itself pseudo-finite (even without the NIP assumption). We also analyze the connection between the Morley product and the pseudo-finite product. In particular, we show that if <em>μ</em> is definable and both <em>μ</em> and <em>ν</em> are pseudo-finite, then the Morley product of <em>μ</em> and <em>ν</em> agrees with the pseudo-finite product of <em>μ</em> and <em>ν</em>. Using this observation, we construct generically stable idempotent measures on pseudo-finite NIP groups.</p></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"176 1","pages":"Article 103492"},"PeriodicalIF":0.6,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141717817","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Elimination of quantifiers for a theory of real closed rings 实闭环理论的量词消除
IF 0.6 2区 数学
Annals of Pure and Applied Logic Pub Date : 2024-07-06 DOI: 10.1016/j.apal.2024.103494
Jorge I. Guier
{"title":"Elimination of quantifiers for a theory of real closed rings","authors":"Jorge I. Guier","doi":"10.1016/j.apal.2024.103494","DOIUrl":"10.1016/j.apal.2024.103494","url":null,"abstract":"<div><p>Let <span><math><msup><mrow><mi>T</mi></mrow><mrow><mo>⁎</mo></mrow></msup></math></span> be the theory of lattice-ordered, convex subrings of von Neumann regular real closed rings that are divisible-projectable, sc-regular (<span><span>[12]</span></span>) and have no minimal (non zero) idempotents. In this paper, we introduce and study a local divisibility binary relation that, added to the language for lattice-ordered rings, together with the (usual) divisibility relation and the radical relation associated to the minimal prime spectrum (<span><span>[19]</span></span>) yields quantifier elimination for <span><math><msup><mrow><mi>T</mi></mrow><mrow><mo>⁎</mo></mrow></msup></math></span>.</p></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"176 1","pages":"Article 103494"},"PeriodicalIF":0.6,"publicationDate":"2024-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141712380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Model-completeness and decidability of the additive structure of integers expanded with a function for a Beatty sequence 用一个函数扩展的整数加法结构的模型完备性和可判定性的比蒂序列
IF 0.6 2区 数学
Annals of Pure and Applied Logic Pub Date : 2024-07-06 DOI: 10.1016/j.apal.2024.103493
Mohsen Khani , Ali N. Valizadeh , Afshin Zarei
{"title":"Model-completeness and decidability of the additive structure of integers expanded with a function for a Beatty sequence","authors":"Mohsen Khani ,&nbsp;Ali N. Valizadeh ,&nbsp;Afshin Zarei","doi":"10.1016/j.apal.2024.103493","DOIUrl":"10.1016/j.apal.2024.103493","url":null,"abstract":"<div><p>We introduce a model-complete theory which completely axiomatizes the structure <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>α</mi></mrow></msub><mo>=</mo><mo>〈</mo><mi>Z</mi><mo>,</mo><mo>+</mo><mo>,</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mi>f</mi><mo>〉</mo></math></span> where <span><math><mi>f</mi><mo>:</mo><mi>x</mi><mo>↦</mo><mo>⌊</mo><mi>α</mi><mi>x</mi><mo>⌋</mo></math></span> is a unary function with <em>α</em> a fixed transcendental number. Moreover, we show that decidability of <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>α</mi></mrow></msub></math></span> is equivalent to computability of <em>α</em>. This result fits into the more general theme of adding traces of multiplication to integers without losing decidability.</p></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"175 10","pages":"Article 103493"},"PeriodicalIF":0.6,"publicationDate":"2024-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141638914","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Club stationary reflection and other combinatorial principles at ℵω+2 ℵω+2处的俱乐部静止反射和其他组合原理
IF 0.6 2区 数学
Annals of Pure and Applied Logic Pub Date : 2024-07-01 DOI: 10.1016/j.apal.2024.103489
{"title":"Club stationary reflection and other combinatorial principles at ℵω+2","authors":"","doi":"10.1016/j.apal.2024.103489","DOIUrl":"10.1016/j.apal.2024.103489","url":null,"abstract":"<div><p>In this paper we continue the study in <span><span>[11]</span></span> of compactness and incompactness principles at double successors, focusing here on the case of double successors of singulars of countable cofinality. We obtain models which satisfy the tree property and club stationary reflection at these double successors. Moreover, we can additionally obtain either approachability or its failure. We also show how to obtain our results on <span><math><msub><mrow><mi>ℵ</mi></mrow><mrow><mi>ω</mi><mo>+</mo><mn>2</mn></mrow></msub></math></span> by incorporating collapses; particularly relevant for these circumstances is a new indestructibility theorem of ours showing that posets satisfying certain linked assumptions preserve club stationary reflection.</p></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"176 1","pages":"Article 103489"},"PeriodicalIF":0.6,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141577930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Bi-intermediate logics of trees and co-trees 树和共树的双中间逻辑
IF 0.6 2区 数学
Annals of Pure and Applied Logic Pub Date : 2024-07-01 DOI: 10.1016/j.apal.2024.103490
{"title":"Bi-intermediate logics of trees and co-trees","authors":"","doi":"10.1016/j.apal.2024.103490","DOIUrl":"10.1016/j.apal.2024.103490","url":null,"abstract":"<div><p>A bi-Heyting algebra validates the Gödel-Dummett axiom <span><math><mo>(</mo><mi>p</mi><mo>→</mo><mi>q</mi><mo>)</mo><mo>∨</mo><mo>(</mo><mi>q</mi><mo>→</mo><mi>p</mi><mo>)</mo></math></span> iff the poset of its prime filters is a disjoint union of co-trees (i.e., order duals of trees). Bi-Heyting algebras of this kind are called <em>bi-Gödel algebras</em> and form a variety that algebraizes the extension <span><math><mi>bi-GD</mi></math></span> of bi-intuitionistic logic axiomatized by the Gödel-Dummett axiom. In this paper we initiate the study of the lattice <span><math><mi>Λ</mi><mo>(</mo><mi>bi-GD</mi><mo>)</mo></math></span> of extensions of <span><math><mi>bi-GD</mi></math></span>.</p><p>We develop the methods of Jankov-style formulas for bi-Gödel algebras and use them to prove that there are exactly continuum many extensions of <span><math><mi>bi-GD</mi></math></span>. We also show that all these extensions can be uniformly axiomatized by canonical formulas. Our main result is a characterization of the locally tabular extensions of <span><math><mi>bi-GD</mi></math></span>. We introduce a sequence of co-trees, called the <em>finite combs</em>, and show that a logic in <span><math><mi>Λ</mi><mo>(</mo><mi>bi-GD</mi><mo>)</mo></math></span> is locally tabular iff it contains at least one of the Jankov formulas associated with the finite combs. It follows that there exists the greatest nonlocally tabular extension of <span><math><mi>bi-GD</mi></math></span> and consequently, a unique pre-locally tabular extension of <span><math><mi>bi-GD</mi></math></span>. These results contrast with the case of the intermediate logic axiomatized by the Gödel-Dummett axiom, which is known to have only countably many extensions, all of which are locally tabular.</p></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"175 10","pages":"Article 103490"},"PeriodicalIF":0.6,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0168007224000940/pdfft?md5=c7604d9cf135b7d72a099447fc38fed7&pid=1-s2.0-S0168007224000940-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141573355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Searching problems above arithmetical transfinite recursion 搜索算术无穷递归以上的问题
IF 0.6 2区 数学
Annals of Pure and Applied Logic Pub Date : 2024-06-19 DOI: 10.1016/j.apal.2024.103488
Yudai Suzuki , Keita Yokoyama
{"title":"Searching problems above arithmetical transfinite recursion","authors":"Yudai Suzuki ,&nbsp;Keita Yokoyama","doi":"10.1016/j.apal.2024.103488","DOIUrl":"https://doi.org/10.1016/j.apal.2024.103488","url":null,"abstract":"<div><p>We investigate some Weihrauch problems between <span><math><msub><mrow><mi>ATR</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> and <span><math><msub><mrow><mi>C</mi></mrow><mrow><msup><mrow><mi>ω</mi></mrow><mrow><mi>ω</mi></mrow></msup></mrow></msub></math></span>. We show that the fixed point theorem for monotone operators on the Cantor space (a weaker version of the Knaster-Tarski theorem) is not Weihrauch reducible to <span><math><msub><mrow><mi>ATR</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>. Furthermore, we introduce the <em>ω</em>-model reflection <span><math><msubsup><mrow><mi>ATR</mi></mrow><mrow><mn>2</mn></mrow><mrow><mi>rfn</mi></mrow></msubsup></math></span> of <span><math><msub><mrow><mi>ATR</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> and show that it is an upper bound for problems provable from the axiomatic system <span><math><msub><mrow><mi>ATR</mi></mrow><mrow><mn>0</mn></mrow></msub></math></span> which are of the form <span><math><mo>∀</mo><mi>X</mi><mo>(</mo><mi>θ</mi><mo>(</mo><mi>X</mi><mo>)</mo><mo>→</mo><mo>∃</mo><mi>Y</mi><mi>η</mi><mo>(</mo><mi>X</mi><mo>,</mo><mi>Y</mi><mo>)</mo><mo>)</mo></math></span> with arithmetical formulas <span><math><mi>θ</mi><mo>,</mo><mi>η</mi></math></span>. We also show that Weihrauch degrees of relativized least fixed point theorems for monotone operators on the Cantor space form a linear hierarchy between <span><math><msubsup><mrow><mi>ATR</mi></mrow><mrow><mn>2</mn></mrow><mrow><mi>rfn</mi></mrow></msubsup></math></span> and <span><math><msub><mrow><mi>C</mi></mrow><mrow><msup><mrow><mi>ω</mi></mrow><mrow><mi>ω</mi></mrow></msup></mrow></msub></math></span>.</p></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"175 10","pages":"Article 103488"},"PeriodicalIF":0.6,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141540300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Decidability bounds for Presburger arithmetic extended by sine 由正弦扩展的普雷斯伯格算术的可判定性边界
IF 0.6 2区 数学
Annals of Pure and Applied Logic Pub Date : 2024-06-12 DOI: 10.1016/j.apal.2024.103487
{"title":"Decidability bounds for Presburger arithmetic extended by sine","authors":"","doi":"10.1016/j.apal.2024.103487","DOIUrl":"10.1016/j.apal.2024.103487","url":null,"abstract":"<div><p>We consider Presburger arithmetic extended by the sine function, call this extension sine-Presburger arithmetic (<strong>sin-PA</strong>), and systematically study decision problems for sets of sentences in <strong>sin-PA</strong>. In particular, we detail a decision algorithm for existential sin-PA sentences under assumption of Schanuel's conjecture. This procedure reduces decisions to the theory of the ordered additive group of real numbers extended by sine, which is decidable under Schanuel's conjecture. On the other hand, we prove that four alternating quantifier blocks suffice for undecidability of sin-PA sentences. To do so, we explicitly interpret the weak monadic second-order theory of the grid, which is undecidable, in <strong>sin-PA</strong>.</p></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"175 10","pages":"Article 103487"},"PeriodicalIF":0.6,"publicationDate":"2024-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0168007224000915/pdfft?md5=8ec66c0193137f3b2153f14d4d1e4bed&pid=1-s2.0-S0168007224000915-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141509201","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
From GTC to : Generating reset proof systems from cyclic proof systems 从 GTC 到 :从循环证明系统生成重置证明系统
IF 0.6 2区 数学
Annals of Pure and Applied Logic Pub Date : 2024-06-11 DOI: 10.1016/j.apal.2024.103485
Graham E. Leigh, Dominik Wehr
{"title":"From GTC to : Generating reset proof systems from cyclic proof systems","authors":"Graham E. Leigh,&nbsp;Dominik Wehr","doi":"10.1016/j.apal.2024.103485","DOIUrl":"10.1016/j.apal.2024.103485","url":null,"abstract":"<div><p>We consider cyclic proof systems in which derivations are graphs rather than trees. Such systems typically come with a condition that isolates which derivations are admitted as proofs, known as the <em>soundness condition</em>. This soundness condition frequently takes the form of either a <em>global trace</em> condition, a property dependent on all infinite paths in the proof-graph, or a <em>reset</em> condition, a ‘local’ condition depending on the simple cycles only which, as a result, is typically stable under more proof transformations.</p><p>In this article we present a general method for constructing cyclic proof systems with reset conditions from systems with global trace conditions. In contrast to previous approaches, this method of generation is entirely independent of logic's semantics, only relying on combinatorial aspects of the notion of ‘trace’ and ‘progress’. We apply this method to present reset proof systems for three cyclic proof systems from the literature: cyclic arithmetic, cyclic Gödel's T and cyclic tableaux for the modal <em>μ</em>-calculus.</p></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"175 10","pages":"Article 103485"},"PeriodicalIF":0.6,"publicationDate":"2024-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0168007224000897/pdfft?md5=3f6516f2a534f0fa710275ea2d71b171&pid=1-s2.0-S0168007224000897-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141402450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Posets of copies of countable ultrahomogeneous tournaments 可数超均质锦标赛副本的 Posets
IF 0.8 2区 数学
Annals of Pure and Applied Logic Pub Date : 2024-06-06 DOI: 10.1016/j.apal.2024.103486
Miloš S. Kurilić , Stevo Todorčević
{"title":"Posets of copies of countable ultrahomogeneous tournaments","authors":"Miloš S. Kurilić ,&nbsp;Stevo Todorčević","doi":"10.1016/j.apal.2024.103486","DOIUrl":"https://doi.org/10.1016/j.apal.2024.103486","url":null,"abstract":"&lt;div&gt;&lt;p&gt;The &lt;em&gt;poset of copies&lt;/em&gt; of a relational structure &lt;span&gt;&lt;math&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; is the partial order &lt;span&gt;&lt;math&gt;&lt;mi&gt;P&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;:&lt;/mo&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mo&gt;〈&lt;/mo&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;mi&gt;Y&lt;/mi&gt;&lt;mo&gt;⊂&lt;/mo&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;mo&gt;:&lt;/mo&gt;&lt;mi&gt;Y&lt;/mi&gt;&lt;mo&gt;≅&lt;/mo&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;mo&gt;}&lt;/mo&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mo&gt;⊂&lt;/mo&gt;&lt;mo&gt;〉&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; and each similarity of such posets (e.g. isomorphism, forcing equivalence = isomorphism of Boolean completions, &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;B&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;:&lt;/mo&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mrow&gt;&lt;mi&gt;ro&lt;/mi&gt;&lt;/mrow&gt;&lt;mspace&gt;&lt;/mspace&gt;&lt;mrow&gt;&lt;mi&gt;sq&lt;/mi&gt;&lt;/mrow&gt;&lt;mspace&gt;&lt;/mspace&gt;&lt;mi&gt;P&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;) determines a classification of structures. Here we consider the structures from Lachlan's list of countable ultrahomogeneous tournaments: &lt;span&gt;&lt;math&gt;&lt;mi&gt;Q&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; (the rational line), &lt;span&gt;&lt;math&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; (the circular tournament), and &lt;span&gt;&lt;math&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;∞&lt;/mo&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;/math&gt;&lt;/span&gt; (the countable homogeneous universal tournament); as well as the ultrahomogeneous digraphs &lt;span&gt;&lt;math&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;3&lt;/mn&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;, &lt;span&gt;&lt;math&gt;&lt;mi&gt;Q&lt;/mi&gt;&lt;mo&gt;[&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;I&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;]&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;, &lt;span&gt;&lt;math&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;[&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;I&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;]&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; and &lt;span&gt;&lt;math&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;∞&lt;/mo&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;[&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;I&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;]&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; from Cherlin's list.&lt;/p&gt;&lt;p&gt;If &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;Rado&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; (resp. &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;Q&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt;) denotes the countable homogeneous universal graph (resp. &lt;em&gt;n&lt;/em&gt;-labeled linear order), it turns out that &lt;span&gt;&lt;math&gt;&lt;mi&gt;P&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;T&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;∞&lt;/mo&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;≅&lt;/mo&gt;&lt;mi&gt;P&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;Rado&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; and that &lt;span&gt;&lt;math&gt;&lt;mi&gt;P&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;Q&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; densely embeds in &lt;span&gt;&lt;math&gt;&lt;mi&gt;P&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;, for &lt;span&gt;&lt;math&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;∈&lt;/mo&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;3&lt;/mn&gt;&lt;mo&gt;}&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;.&lt;/p&gt;&lt;p&gt;Consequently, &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;B&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;≅&lt;/mo&gt;&lt;mrow&gt;&lt;mi&gt;ro&lt;/mi&gt;&lt;/mrow&gt;&lt;mspace&gt;&lt;/mspace&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;⁎&lt;/mo&gt;&lt;mi&gt;π&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;, where &lt;span&gt;&lt;math&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; is the poset of perfect subsets of &lt;span&gt;&lt;math&gt;&lt;mi&gt;R&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; and &lt;em&gt;π&lt;/em&gt; an &lt;span&gt;&lt;math&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt;-name such that &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"175 10","pages":"Article 103486"},"PeriodicalIF":0.8,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141325306","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"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学术官方微信