Hechler's Theorem for tall analytic P-ideals

2011 ◽  
Vol 76 (2) ◽  
pp. 729-736
Author(s):  
Barnabás Farkas
Keyword(s):  
Upper Bound ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Countable Subset ◽  
Generic Extension ◽  
Classical Theorem ◽  
Ground Model ◽  
Partially Ordered

AbstractWe prove the following version of Hechler's classical theorem: For each partially ordered set (Q, ≤) with the property that every countable subset of Q has a strict upper bound in Q, there is a ccc forcing notion such that in the generic extension for each tall analytic P-ideal (coded in the ground model) a cofinal subset of is order isomorphic to (Q, ≤).

The consistency of the axiom of universality for the ordering of cardinalities

1985 ◽  
Vol 50 (2) ◽  
pp. 502-509
Author(s):  
Marco Forti ◽  
Furio Honsell
Keyword(s):  
Set Theory ◽  
Partially Ordered Set ◽  
Regular Cardinal ◽  
Ordered Set ◽  
Partial Ordering ◽  
Generic Extension ◽  
Ground Model ◽  
Partially Ordered ◽  
Transfer Method ◽  
Image Position

T. Jech [4] and M. Takahashi [7] proved that given any partial ordering R in a model of ZFC there is a symmetric submodel of a generic extension of where R is isomorphic to the injective ordering on a set of cardinals.The authors raised the question whether the injective ordering of cardinals can be universal, i.e. whether the following axiom of “cardinal universality” is consistent:CU. For any partially ordered set (X, ≼) there is a bijection f:X → Y such that(i.e. x ≼ y iff ∃g: f(x) → f(y) injective). (See [1].)The consistency of CU relative to ZF0 (Zermelo-Fraenkel set theory without foundation) is proved in [2], but the transfer method of Jech-Sochor-Pincus cannot be applied to obtain consistency with full ZF (including foundation), since CU apparently is not boundable.In this paper the authors define a model of ZF + CU as a symmetric submodel of a generic extension obtained by forcing “à la Easton” with a class of conditions which add κ generic subsets to any regular cardinal κ of a ground model satisfying ZF + V = L.

scholarly journals Three counterexamples concerning ω-chain completeness and fixed point properties

1981 ◽  
Vol 24 (2) ◽  
pp. 141-146 ◽  
Author(s):  
J. D. Mashburn
Keyword(s):  
Fixed Point ◽  
Upper Bound ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Partially Ordered ◽  
Fixed Point Properties ◽  
Countable Chain ◽  
Chain Complete

A partially ordered set, is ω-chain complete if, for every countable chain, or ω-chain, in P, the least upper bound of C, denoted by sup C, exists. Notice that C could be empty, so an ω-chain complete partially ordered set has a least element, denoted by 0.

Injective Hulls of Semilattices

1970 ◽  
Vol 13 (1) ◽  
pp. 115-118 ◽  
Author(s):  
G. Bruns ◽  
H. Lakser
Keyword(s):  
Upper Bound ◽  
Partially Ordered Set ◽  
Binary Operation ◽  
Ordered Set ◽  
Upper Bounds ◽  
Partial Ordering ◽  
Partially Ordered ◽  
Image Position ◽  
Injective Hulls

A (meet-) semilattice is an algebra with one binary operation ∧, which is associative, commutative and idempotent. Throughout this paper we are working in the category of semilattices. All categorical or general algebraic notions are to be understood in this category. In every semilattice S the relationdefines a partial ordering of S. The symbol "∨" denotes least upper bounds under this partial ordering. If it is not clear from the context in which partially ordered set a least upper bound is taken, we add this set as an index to the symbol; for example, ∨AX denotes the least upper bound of X in the partially ordered set A.

Sheaves over infinite posets

2017 ◽  
Vol 16 (02) ◽  
pp. 1750026 ◽  
Author(s):  
J. Asadollahi ◽  
P. Bahiraei ◽  
R. Hafezi ◽  
R. Vahed
Keyword(s):  
Upper Bound ◽  
Partially Ordered Set ◽  
Topological Structure ◽  
Ordered Set ◽  
Global Dimension ◽  
Partially Ordered ◽  
Acyclic Complexes ◽  
Gorenstein Injective

In this paper, we study the category of sheaves over an infinite partially ordered set with its natural topological structure. Totally acyclic complexes in this category will be characterized in terms of their stalks. This leads us to describe Gorenstein projective, injective and flat sheaves. As an application, we get an analogue of a formula due to Mitchell, giving an upper bound on the Gorenstein global dimension of such categories. Based on these results, we present situations in which the class of Gorenstein projective sheaves is precovering as well as situations in which the class of Gorenstein injective sheaves is preenveloping.

Automorphism Groups of Homogeneous Semilinear Orders: Normal Subgroups and Commutators

1991 ◽  
Vol 43 (4) ◽  
pp. 721-737 ◽  
Author(s):  
M. Droste ◽  
W. C. Holland ◽  
H. D. Macpherson
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Partially Ordered Set ◽  
Automorphism Groups ◽  
Ordered Set ◽  
Infinite Chain ◽  
The Other ◽  
Normal Subgroups ◽  
Partially Ordered

A partially ordered set (T, ≤) is called a tree if it is semilinearly ordered, i.e. any two elements have a common lower bound but no two incomparable elements have a common upper bound, and contains an infinite chain and at least two incomparable elements. Let k ∈ ℕ. We say that a partially ordered set (T, ≤) is k-homogeneous, if each isomorphism between two k-element subsets of T extends to an automorphism of (T, ≤), and weakly k-transitive, if for any two k-element subchains of T there exists an automorphism of (T, ≤) taking one to the other.

Free Lattices Generated by Partially Ordered Sets and Preserving Bounds

1964 ◽  
Vol 16 ◽  
pp. 136-148 ◽  
Author(s):  
R. A. Dean
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Partially Ordered Sets ◽  
Free Lattice ◽  
Ordered Sets ◽  
Partially Ordered

A construction of the free lattice generated by a partially ordered set P and preserving every least upper bound (lub) and greatest lower bound (glb) of pairs of elements existing in P has been given by Dilworth (2, pp. 124-129) and, when P is finite, by Gluhov (5).The results presented here construct the free lattice FL generated by the partially ordered set P and preserving(1) the ordering of P(2) those lub's of a family of finite subsets of P which possess lub's in P

Information Retrieval Systems, an Algebraic Approach I1

1981 ◽  
Vol 4 (3) ◽  
pp. 551-603
Author(s):  
Zbigniew Raś
Keyword(s):  
Information Retrieval ◽  
Boolean Algebra ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Algebraic Approach ◽  
Partially Ordered ◽  
Retrieval Systems ◽  
Information Retrieval Systems ◽  
Present Part ◽  
L Systems

This paper is the first of the three parts of work on the information retrieval systems proposed by Salton (see [24]). The system is defined by the notions of a partially ordered set of requests (A, ⩽), the set of objects X and a monotonic retrieval function U : A → 2X. Different conditions imposed on the set A and a function U make it possible to obtain various classes of information retrieval systems. We will investigate systems in which (A, ⩽) is a partially ordered set, a lattice, a pseudo-Boolean algebra and Boolean algebra. In my paper these systems are called partially ordered information retrieval systems (po-systems) lattice information retrieval systems (l-systems); pseudo-Boolean information retrieval systems (pB-systems) and Boolean information retrieval systems (B-systems). The first part concerns po-systems and 1-systems. The second part deals with pB-systems and B-systems. In the third part, systems with a partial access are investigated. The present part discusses the method for construction of a set of attributes. Problems connected with the selectivity and minimalization of a set of attributes are investigated. The characterization and the properties of a set of attributes are given.

scholarly journals Each join-completion of a partially ordered set in the solution of a universal problem

1974 ◽  
Vol 17 (4) ◽  
pp. 406-413 ◽  
Author(s):  
Jürgen Schmidt
Keyword(s):  
Partially Ordered Set ◽  
Ordered Set ◽  
Unique Extension ◽  
Partially Ordered ◽  
Special Cases

The main result of this paper is the theorem in the title. Only special cases of it seem to be known so far. As an application, we obtain a result on the unique extension of Galois connexions. As a matter of fact, it is only by the use of Galois connexions that we obtain the main result, in its present generality.

Sign in / Sign up

Export Citation Format

Share Document