Tagged Questions

3
votes
5answers
380 views

infinite permutations

This question is related to this one: Continued fractions using all natural integers. Suppose we have the set of natural numbers $N$ with order and we perform permutation on it. So …
4
votes
1answer
142 views

Kuratowski closure-complement problem for other mathematical objects?

The original Kuratowski closure-complement problem asks: How many distinct sets can be obtained by repeatedly applying the set operations of closure and complement to a given s …
4
votes
3answers
357 views

Constructing a metric over a lattice

Consider a lattice $({\cal L}, \wedge, \vee)$ with an antimonotonic function $f: {\cal L} \rightarrow {\mathbb R}$ defined on it (i.e $x \preceq y \implies f(x) \ge f(y)$). $f$ i …
2
votes
4answers
147 views

Filter-closed vs. chain-closed

Let A is a complete lattice. I call a subset $S$ of A filter-closed when for every filter base $T$ in $S$ we have $\bigcap T\in S$. (A filter base is a nonempty, down directed set …
1
vote
2answers
100 views

Weak partitioning vs. strong partitioning

Let $U$ is a complete lattice with least element 0. Weak partitioning is a collection $S$ of nonempty subsets of $U$ such that $\forall x\in S: x\cap\bigcup(S\setminus\{x\})=0$. …
15
votes
2answers
249 views

How much choice is needed to show that formally real fields can be ordered?

Background: a field is formally real if -1 is not a sum of squares of elements in that field. An ordering on a field is a linear ordering which is (in exactly the sense that you w …
3
votes
2answers
122 views

closure of separative quotients

Does there exist a partial order, nontrivial for forcing, that is countably closed, but whose separative quotient is not countably closed? Supposing the answer is yes, then is ther …
3
votes
2answers
215 views

Reconstruction puzzles

[Added: This is a follow-up of an earlier post.] Consider the following "reconstruction puzzle", stated informally: Given a concrete poset, e.g. the poset of undirected unlabeled …
2
votes
3answers
117 views

Name for “lower/upper bounds” of arbitrary relations?

Given a partial order R≤ over a set D, the set of upper bounds under R of a subset S of D is commonly defined as { y ∈ D | ∀ x ∈ S, x R y }. (The set of lower bounds of S may be d …
5
votes
5answers
443 views

Generalizations of Boolean posets/lattices

A Boolean lattice has a number of rather nice properties which give it a central role in many parts of combinatorics. For instance, it's a lattice, it can be augmented with a ring …
2
votes
1answer
104 views

Semilattices in atomless boolean algebras

Let S be a bounded semilattice without maximal elements. Can we always construct an atomless boolean algebra B, containing S as a subsemilattice, such that S is cofinal in B-{1}? T …
5
votes
2answers
447 views

Ordinals that are not sets

The class of all ordinal numbers $\mathbf{Ord}$, aside being a proper class, can be thought of an ordinal number (of course it contains all ordinal numbers that are sets, not itsel …
3
votes
2answers
207 views

Is every lattice the fixed-point set of an order endomorphism of ⋄^n?

(Asked by Nathaniel Hellerstein on the Q&A board at JMM) Let ⋄ be the 4 element lattice τ / \ i j \ / f Is every lattice isomorphic to the fixed point la …
5
votes
0answers
196 views

Does ⋄ generate all De Morgan algebras?

(Asked by Nathaniel Hellerstein on the Q&A board at JMM) This question is about De Morgan algebras (see also Wikipedia), which are something like Boolean algebras, but with a …
7
votes
2answers
231 views

Which are the rigid suborders of the real line?

Which are the rigid suborders of the real line? If A is any set of reals, then it can be viewed as an order structure itself under the induced order (A,<). The question is, wh …

1 2 next
15 30 50 per page