Archive for Mathematical Logic最新文献_第8页

Ramsey degrees of ultrafilters, pseudointersection numbers, and the tools of topological Ramsey spaces 超滤子的Ramsey度，伪交数，以及拓扑Ramsey空间的工具

IF 0.3 4区数学

Archive for Mathematical Logic Pub Date : 2022-03-15 DOI: 10.1007/s00153-022-00823-9

Natasha Dobrinen, Sonia Navarro Flores

{"title":"Ramsey degrees of ultrafilters, pseudointersection numbers, and the tools of topological Ramsey spaces","authors":"Natasha Dobrinen, Sonia Navarro Flores","doi":"10.1007/s00153-022-00823-9","DOIUrl":"10.1007/s00153-022-00823-9","url":null,"abstract":"<div>This paper investigates properties of (sigma )-closed forcings which generate ultrafilters satisfying weak partition relations. The Ramsey degree of an ultrafilter ({mathcal {U}}) for n-tuples, denoted (t({mathcal {U}},n)), is the smallest number t such that given any (lge 2) and coloring (c:[omega ]^nrightarrow l), there is a member (Xin {mathcal {U}}) such that the restriction of c to ([X]^n) has no more than t colors. Many well-known (sigma )-closed forcings are known to generate ultrafilters with finite Ramsey degrees, but finding the precise degrees can sometimes prove elusive or quite involved, at best. In this paper, we utilize methods of topological Ramsey spaces to calculate Ramsey degrees of several classes of ultrafilters generated by (sigma )-closed forcings. These include a hierarchy of forcings due to Laflamme which generate weakly Ramsey and weaker rapid p-points, forcings of Baumgartner and Taylor and of Blass and generalizations, and the collection of non-p-points generated by the forcings ({mathcal {P}}(omega ^k)/mathrm {Fin}^{otimes k}). We provide a general approach to calculating the Ramsey degrees of these ultrafilters, obtaining new results as well as streamlined proofs of previously known results. In the second half of the paper, we calculate pseudointersection and tower numbers for these (sigma )-closed forcings and their relationships with the classical pseudointersection number ({mathfrak {p}}).</div>","PeriodicalId":48853,"journal":{"name":"Archive for Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2022-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00153-022-00823-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48789477","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Enhancing induction in a contraction free logic with unrestricted abstraction: from (mathbf {Z}) to (mathbf {Z}_2) 在不受限制的抽象的自由收缩逻辑中增强归纳:从(mathbf {Z})到 (mathbf {Z}_2)

IF 0.3 4区数学

Archive for Mathematical Logic Pub Date : 2022-03-14 DOI: 10.1007/s00153-022-00824-8

Uwe Petersen

引用次数: 0

On well-splitting posets 关于分裂井集

IF 0.3 4区数学

Archive for Mathematical Logic Pub Date : 2022-03-09 DOI: 10.1007/s00153-022-00818-6

Dušan Repovš, Lyubomyr Zdomskyy

引用次数: 1

Dividing lines in unstable theories and subclasses of Baire 1 functions 不稳定理论中的分界线与Baire-1函数的子类

IF 0.3 4区数学

Archive for Mathematical Logic Pub Date : 2022-03-09 DOI: 10.1007/s00153-022-00816-8

Karim Khanaki

引用次数: 8

Weak essentially undecidable theories of concatenation 弱本质上不可判定的串联理论

IF 0.3 4区数学

Archive for Mathematical Logic Pub Date : 2022-03-07 DOI: 10.1007/s00153-022-00820-y

Juvenal Murwanashyaka

引用次数: 3

Disjunctive logic programs, answer sets, and the cut rule 析取逻辑程序，答案集，和切割规则

IF 0.3 4区数学

Archive for Mathematical Logic Pub Date : 2022-03-04 DOI: 10.1007/s00153-022-00821-x

Éric Martin

{"title":"Disjunctive logic programs, answer sets, and the cut rule","authors":"Éric Martin","doi":"10.1007/s00153-022-00821-x","DOIUrl":"10.1007/s00153-022-00821-x","url":null,"abstract":"<div>In Minker and Rajasekar (J Log Program 9(1):45–74, 1990), Minker proposed a semantics for negation-free disjunctive logic programs that offers a natural generalisation of the fixed point semantics for definite logic programs. We show that this semantics can be further generalised for disjunctive logic programs with classical negation, in a constructive modal-theoretic framework where rules are built from claims and hypotheses, namely, formulas of the form (Box varphi ) and (Diamond Box varphi ) where (varphi ) is a literal, respectively, yielding a “base semantics” for general disjunctive logic programs. Model-theoretically, this base semantics is expressed in terms of a classical notion of logical consequence. It has a complete proof procedure based on a general form of the cut rule. Usually, alternative semantics of logic programs amount to a particular interpretation of nonclassical negation as “failure to derive.” The counterpart in our framework is to complement the original program with a set of hypotheses required to satisfy specific conditions, and apply the base semantics to the resulting set. We demonstrate the approach for the answer set semantics. The proposed framework is purely classical in mainly three ways. First, it uses classical negation as unique form of negation. Second, it advocates the computation of logical consequences rather than of particular models. Third, it makes no reference to a notion of preferred or minimal interpretation.</div>","PeriodicalId":48853,"journal":{"name":"Archive for Mathematical Logic","volume":null,"pages":null},"PeriodicalIF":0.3,"publicationDate":"2022-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00153-022-00821-x.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42260384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On decidability of amenability in computable groups 论可计算群适应性的可决性

IF 0.3 4区数学

Archive for Mathematical Logic Pub Date : 2022-03-03 DOI: 10.1007/s00153-022-00819-5

Karol Duda, Aleksander Ivanov

引用次数: 3

On extendability to (F_sigma ) ideals 关于(F_sigma )理想的可扩展性

IF 0.3 4区数学

Archive for Mathematical Logic Pub Date : 2022-02-28 DOI: 10.1007/s00153-022-00822-w

Adam Kwela

引用次数: 0

Antichains of copies of ultrahomogeneous structures 超均质结构副本的反链

IF 0.3 4区数学

Archive for Mathematical Logic Pub Date : 2022-02-25 DOI: 10.1007/s00153-022-00817-7

Miloš S. Kurilić, Boriša Kuzeljević

引用次数: 2

An alternative proof of the Hilbert-style axiomatization for the ({wedge ,vee })-fragment of classical propositional logic 经典命题逻辑$${wedge ,vee }$$∧{，∨-片段的hilbert式公性的另一种证明}

IF 0.3 4区数学

Archive for Mathematical Logic Pub Date : 2022-02-24 DOI: 10.1007/s00153-022-00815-9

Luciano J. González

引用次数: 0