SEARCH · Searcharxiv

Results for “math.LO”

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 recordsLinked to original sources

arXiv2001

Sweet & Sour and other flavours of ccc forcing notions

The present paper has three themes. First, we continue the investigations started in Judah, Roslanowski and Shelah \math.LO/9310224 and Roslanowski and Shelah math.LO/9807172, math.LO/9703222, and we investigate the method of norms on possibilities in the context of ccc forcing notions, getting a number of constructions of nicely definable ccc forcings. The second theme of the paper is a part of the general program ``how special are random and Cohen forcing notions (or: the respective ideals)''. Shelah math.LO/9303208 shows that the two forcing notions may occupy special positions in the realm of nicely definable forcing notions. In this realm we may classify forcing notions using the methods of Shelah [Sh:630] (math.LO/9712283), [Sh:669] and, for example, declare that very Souslin (or generally omega-nw-nep) ccc forcing notions are really nice. Both the Cohen forcing notion and the random forcing notion and their FS iterations (and nice subforcings) are all ccc omega-nw-nep, and Problem 4.24 of math.LO/9906113 asked if we have more examples. It occurs that our method relatively easily results in very Souslin ccc forcing notions. The third theme is Sweet & Sour, and it is related to one of the most striking differences between the random and the Cohen forcing notions that appears when we consider the respective regularity properties of projective sets: the Lebesgue measurability of Sigma^1_3 sets implies aleph_1 is inaccessible in L, while one can construct (in ZFC) a forcing notion P which forces ``projective subsets of R have the Baire property'' (see Shelah [Sh:176]).

math.LO↗

arXiv2000

On our paper `Almost Free Splitter', a correction

Let R be a subring of Q and recall from math.LO/9910161 that an R-module G is a splitter if Ext_R(G,G)=0. We correct the statement of Main Theorem 1.5 in math.LO/9910161. Assuming CH any aleph_1$-free splitter of cardinality aleph_1 is free over its nucleus as shown in math.LO/9910161. Generally these modules are very close to being free as explained below. This change follows from math.LO/9910161 and is due to an incomplete proof (noticed thanks to Paul Eklof) in the first section of math.LO/9910161. Assuming the negation of CH, in Shelah [Sh:F417] (work in progress) it will be shown that under Martin's axiom these splitters are free indeed. However there are models of set theory having non-free aleph_1-free splitter of cardinality aleph_1.

math.LO↗

arXiv2012

More about lambda-support iterations of <lambda-complete forcing notions

This article continues Rosłanowski and Shelah math.LO/9906024, math.LO/0508272, math.LO/0210205, math.LO/0611131 and math.LO/0605067. We introduce here a new property of <lambda-strategically complete forcing notions which implies that their lambda-support iterations do not collapse lambda^+ (for a strongly inaccessible cardinal lambda).

math.LO↗

arXiv2010

Lords of the iteration

We introduce several properties of forcing notions which imply that their lambda-support iterations are lambda-proper. Our methods and techniques refine those studied in math.LO/9906024, math.LO/0210205, math.LO/0508272 and math.LO/0605067, covering some new forcing notions (though the exact relation of the new properties to the old ones remains undecided).

math.LO↗

arXiv2000

Weak reflection at the successor of singular

The notion of stationary reflection is one of the most important notions of combinatorial set theory. We investigate weak reflection, which is, as the name suggests, a weak version of stationary reflection. This sort of reflection was introduced in [DjSh:545] (math.LO/9601219), where it was shown that weak reflection has applications to various guessing principles, in the sense that if there is no weak reflection, than a guessing principle holds, and an application dealing with the saturation of normal filters. Further investigations of weak reflection were carried in [CDSh:571] (math.LO/9504221) and [CuSh:596] (math.LO/9703219). While various ZFC restrictions on the one hand, and independence results on the other, were discovered about the weak reflection, the question of the relative consistency of the existence of a regular cardinal kappa such that the first cardinal weakly reflecting at kappa is a successor of singular, remained open. This paper answers that question by proving that (modulo large cardinal assumptions close to 2-hugeness) that there indeed can be such a cardinal kappa.

math.LO↗

arXiv2003

Sheva-Sheva-Sheva: Large Creatures

We develop the theory of the forcing with trees and creatures for an inaccessible lambda continuing Rosłanowski and Shelah math.LO/9807172, math.LO/9909115. To make a real use of these forcing notions (that is to iterate them without collapsing cardinals) we need suitable iteration theorems, and those are proved as well. (In this aspect we continue Rosłanowski and Shelah math.LO/9906024.)

math.LO↗

arXiv1999

Almost free splitters

Let R be a subring of the rationals. We want to investigate self splitting R-modules G that is Ext_R(G,G)=0 holds. For simplicity we will call such modules splitters. Our investigation continues math.LO/9910159. In math.LO/9910159, we answered an open problem by constructing a large class of splitters. Classical splitters are free modules and torsion-free, algebraically compact ones. In math.LO/9910159 we concentrated on splitters which are larger then the continuum and such that countable submodules are not necessarily free. The `opposite' case of aleph_1-free splitters of cardinality less or equal to aleph_1 was singled out because of basically different techniques. This is the target of the present paper. If the splitter is countable, then it must be free over some subring of the rationals by a result of Hausen. We can show that all aleph_1-free splitters of cardinality aleph_1 are free indeed.

math.LO↗

arXiv2011

No limit model in inaccessible

Our aim is to improve the negative results i.e. non-existence of limit models, and the failure of the generic pair property from math.LO/0609636 to inaccessible lambda as promised there. The motivation is that in [Sh:F756] the positive results are for lambda measurable hence inaccessible, whereas in math.LO/0609636 in the negative results obtained only on non-strong limit cardinals.

math.LO↗

arXiv2010

Large continuum, oracles

Our main theorem is about iterated forcing for making the continuum larger than aleph_2. We present a generalization of math.LO/0303294 which is dealing with oracles for random, etc., replacing aleph_1, aleph_2 by lambda,lambda^+ (starting with lambda=lambda^{ aleph_1). Well, instead of properness we demand absolute c.c.c. So we get, e.g. the continuum is lambda^+ but we can get cov(meagre)=lambda. We give some applications. As in math.LO/0303294, it is a "partial" countable support iteration but it is c.c.c.

math.LO↗

arXiv2019

Chains of P-points

It is proved that the Continuum Hypothesis implies that any sequence of rapid P-points of length $<{\mathfrak c}^{+}$ which is increasing with respect to the Rudin-Keisler ordering is bounded above by a rapid P-point. This is an improvement of a result from [Kuzeljević, Raghavan: A long chain of P-points, arxiv:1607.07188 [math.LO]]. It is also proved that the notion of a $δ$-generic sequence is equivalent to an apparently much weaker notion. This allows the central definition used in the construction in [Kuzeljević, Raghavan: A long chain of P-points, arxiv:1607.07188 [math.LO]] to be considerably simplified.

math.LO↗

arXiv2000

Decompositions of Reflexive Modules

We continue [GbSh:568] (math.LO/0003164), proving a stronger result under the special continuum hypothesis (CH). The original question of Eklof and Mekler related to dual abelian groups. We want to find a particular example of a dual group, which will provide a negative answer to the question. In order to derive a stronger and also more general result we will concentrate on reflexive modules over countable principal ideal domains R. Following H.Bass, an R-module G is reflexive if the evaluation map s:G-->G^{**} is an isomorphism. Here G^*=Hom(G,R) denotes the dual group of G. Guided by classical results the question about the existence of a reflexive R-module G of infinite rank with G not cong G+R is natural. We will use a theory of bilinear forms on free R-modules which strengthens our algebraic results in [GbSh:568] (math.LO/0003164). Moreover we want to apply a model theoretic combinatorial theorem from [Sh:e] which allows us to avoid the weak diamond principle. This has the great advantage that the used prediction principle is still similar to the diamond, but holds under CH.

math.LO↗

arXiv2000

Reflexive subgroups of the Baer-Specker group and Martin's axiom

In two recent papers (math.LO/0003164 and math.LO/0003165) we answered a question raised in the book by Eklof and Mekler (p. 455, Problem 12) under the set theoretical hypothesis of diamondsuit_{aleph_1} which holds in many models of set theory, respectively of the special continuum hypothesis (CH). The objects are reflexive modules over countable principal ideal domains R, which are not fields. Following H.Bass, an R-module G is reflexive if the evaluation map s:G ---> G^{**} is an isomorphism. Here G^*=Hom(G,R) denotes the dual module of G. We proved the existence of reflexive R-modules G of infinite rank with G not cong G+R, which provide (even essentially indecomposable) counter examples to the question mentioned above. Is CH a necessary condition to find `nasty' reflexive modules? In the last part of this paper we will show (assuming the existence of supercompact cardinals) that large reflexive modules always have large summands. So at least being essentially indecomposable needs an additional set theoretic assumption. However the assumption need not be CH as shown in the first part of this paper. We will use Martin's axiom to find reflexive modules with the above decomposition which are submodules of the Baer-Specker module R^omega.

math.LO↗

arXiv2003

P is not equal to NP intersect coNP for Infinite Time Turing Machines

Extending results of Schindler [math.LO/0106087] and Hamkins and Welch [math.LO/0212046], we establish in the context of infinite time Turing machines that P is properly contained in NP intersect coNP. Furthermore, NP intersect coNP is exactly the class of hyperarithmetic sets. For the more general classes, we establish that P+ = (NP+ intersect coNP+) = (NP intersect coNP), though P++ is properly contained in NP++ intersect coNP++. Within any contiguous block of infinite clockable ordinals, we show that P_alpha is not equal to NP_alpha intersect coNP_alpha, but if beta begins a gap in the clockable ordinals, then P_beta = NP_beta intersect coNP_beta. Finally, we establish that P^f is not equal to NP^f intersect coNP^f for most functions f from the reals to the ordinals, although we provide examples where P^f = NP^f intersect coNP^f and P^f is not equal to NP^f.

math.LO↗

arXiv2004

More on SOP_1 and SOP_2

This paper continues math.LO/0009087. We present a rank function for NSOP_1 theories and give an example of a theory which is NSOP_1 but not simple. We also investigate the connection between maximality in the ordering <^* among complete first order theories and the (N)SOP_2 property. We complete the proof started in math.LO/0009087 of the fact that <^*-maximality implies SOP_2 and get weaker results in the other direction. The paper provides a step toward the classification of unstable theories without the strict order property.

math.LO↗

arXiv2007

Generating ultrafilters in a reasonable way

We continue investigations of reasonable ultrafilters on uncountable cardinals defined in Shelah math.LO/0407498 and studied also in math.LO/0605067. We introduce a general scheme of generating a filter on lambda from filters on smaller sets and we investigate the combinatorics of objects obtained this way.

math.LO↗

arXiv1999

On versions of clubsuit on cardinals larger than aleph_1

We give two results on guessing unbounded subsets of lambda^+. The first is a positive result and applies to the situation of lambda regular and at least equal to aleph_3, while the second is a negative consistency result which applies to the situation of lambda a singular strong limit with 2^lambda>lambda^+. The first result shows that in ZFC there is a guessing of unbounded subsets of S^{lambda^+}_lambda. The second result is a consistency result (assuming a supercompact cardinal exists) showing that a natural guessing fails. A result of Shelah in math.LO/9808140 shows that if 2^lambda=lambda^+ and lambda is a strong limit singular, then the corresponding guessing holds. Both results are also connected to an earlier result of Dzamonja and Shelah in which they showed that a certain version of clubsuit holds at a successor of singular just in ZFC. The first result here shows that a result of math.LO/9601219 can to a certain extent be extended to the successor of a regular. The negative result here gives limitations to the extent to which one can hope to extend this result.

math.LO↗

arXiv2009

On NIP and invariant measures

We study forking, Lascar strong types, Keisler measures and definable groups, under an assumption of $NIP$ (not the independence property), continuing aspects of math.LO/0607442. Among key results are: (i) if $p = tp(b/A)$ does not fork over $A$ then the Lascar strong type of $b$ over $A$ coincides with the compact strong type of $b$ over $A$ and any global nonforking extension of $p$ is Borel definable over $bdd(A)$ (ii) analogous statements for Keisler measures and definable groups, including the fact that $G^{000} = G^{00}$ for $G$ definably amenable, (iii) definitions, characterizations and properties of "generically stable" types and groups (iv) uniqueness of translation invariant Keisler measures on groups with finitely satisfiable generics (vi) A proof of the compact domination conjecture for definably compact commutative groups in $o$-minimal expansions of real closed fields.

math.LO↗

arXiv2008

Non-structure in lambda^{++} using instances of WGCH

We try to redo, improve and continue the non-structure parts in some works on a.e.c., which uses weak diamond, in lambda^+ and lambda^{++} getting better and more results and do what is necessary for the book on a.e.c. Comparing with math.LO/9805146 we make the context closer to the examples, hence hopefully improve transparency, though losing some generality. Toward this we work also on the positive theory, i.e. structure side of "low frameworks" like almost good lambda-frames.

math.LO↗