Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
2
votes
Left shift of transfinite sequences
New answer. For any sequence $a=\langle a_\alpha\mid\alpha<\ell(a)\rangle$, define $\Box a$ to the sequence $\langle b_\alpha\mid\alpha<\ell(a)\rangle$, where $b_\alpha=\min\{a_\beta\mid\alpha<\beta\} …
17
votes
Accepted
Are the Boolean algebras ${\cal P}(\omega)/(\text{fin})$ and ${\cal P}(\omega)/(\text{thin})...
The answer is no.
In the Boolean algebra $P(\omega)/\text{Fin}$ every strictly descending sequence $A_0>A_1>A_2>\cdots$ has a nonzero lower bound, by the famous construction of Hausdorff. Namely, one …
8
votes
Accepted
Universal poset for cardinals $\kappa \geq \aleph_0$
The easy case occurs when $\kappa^{<\kappa}=\kappa$. Under GCH, this includes every regular cardinal. As Emil mentions in the comments, the result for this case follows from general model-theoretic co …
6
votes
Accepted
Is every finite poset a subset of a finite complemented distributive lattice?
As Sam mentioned in the comments, the answer to question 1 is yes. One can map every condition $p$ in the partial order to the lower cone, the set $S_p=\{q\in P\mid q\leq p\}$ of conditions below $p$. …
7
votes
Accepted
Is ${\cal P}(\omega)/\text{(fin)}$ a fractal poset?
Yes, $P(\omega)/\text{fin}$ is fractal. If $A\subseteq^* B$ but not equivalent, then the interval $[A,B]$ in $P(\omega)/\text{fin}$ consists of the sets that almost contain $A$ and are almost containe …
37
votes
Accepted
What is the cofinality of the co-infinite subsets of ${\bf N}$?
Every such cofinal family $\mathcal{A}'$ must have size continuum. The reason is that there is an almost disjoint family $\mathcal{D}$ of size continuum, a family of infinite co-infinite sets $A\subse …
4
votes
Ordinal-universal linear order on $\kappa$ elements
Let me mention one easy observation, which is that the order $2^{<\kappa}$ is universal for all linear orders of size $\kappa$. View the order as $\{-1,1\}^{<\kappa}$, where strings are ordered lexica …
10
votes
0
answers
376
views
Can one define in ZFC a directed system of embeddings on the class of all linear orders real...
Consider the surreal line $\langle\newcommand\No{\text{No}}\No,\leq\rangle$, in its order structure only. This is a proper class linear order, which is universal for all set-sized linear orders, as we …
8
votes
Counterexample for Chvatal's conjecture in an infinite set
The usual definition of ideal also includes the requirement that $F$ is closed under unions.
But in this case, I claim that Chvatal's property holds for all infinite ideals.
First, if $a\in Y\in F$, t …
19
votes
2
answers
1k
views
Is the theory of a partial order bi-interpretable with the theory of a pre-order?
A partial order relation $\leq$ on a set $A$ is a binary relation that is reflexive, transitive, and antisymmetric.
A preorder relation $\unlhd$ (also sometimes known as a quasi order or pseudo order) …
1
vote
Density and compactness of Boolean embeddings
Regarding the dense embedding, perhaps this is helpful. Statement 1 can be taken as a definition of density, which makes the connection with topology by means of the lower-cone topology.
Theorem. Supp …
2
votes
Infima and suprema in the "transfer" function ordering
Here is a counterexample showing that the quotient of $\text{Fct}(X,Y)$ is not necessarily a lattice.
Let $X=\{0,1,2\}$ and let $Y=\{0,1\}$. Let $g(0)=g(1)=0$ and $g(2)=1$, while $f(0)=0$ and $f(1)=f …
4
votes
Accepted
getting one tower from two
This is a fantastic question! I spent the whole morning thinking
about it, and I finally have a solution.
The answer is no, not necessarily.
To build a counterexample, I claim first that there is a …
3
votes
Terminology: product on strict preorders corresponding to direct product of preorders?
If one takes the reflexive order relation as fundamental, then this is just the strict product order.
It is good practice to take the reflexive order relation as the primary relation, since in the c …
2
votes
Strict and non-strict orderings
Here is an example, which I think is similar to what you are asking
for.
A graded digraph is a structure $\langle
A,\rightharpoonup,\leq\rangle$, where $\langle
A,\rightharpoonup\rangle$ is a digraph …