23
votes
3answers
689 views

Is the fixed point property for posets preserved by products?

Recall that a partially ordered set (poset) $P$ has the fixed point property (FPP) if any order preserving function $f:P\longrightarrow P$ has a fixed point. Theorem. Suppose $P$ and $Q$ are posets ...
6
votes
0answers
100 views

Can $Ded(\kappa)$ be a supremum?

Definition If there is a dense linear order w/o endpoints of size $\lambda$ with a dense subset of size $\kappa$ then write $D(\kappa,\lambda)$. $Ded(\kappa)=\sup_\lambda \{D(\kappa,\lambda)\}$. It ...
7
votes
2answers
317 views

Which linearly ordered sets have the property that their completion is equipotent with their powerset?

As is well-known, ZFC proves the equipotency of $\mathbb{R}$ and $\mathcal{P}(\mathbb{Q}).$ Is there a nice characterization of those linearly ordered sets $L$ which, like $\mathbb{Q}$, have the ...
1
vote
1answer
372 views

Compactness and completeness in Gödel logic

The standard proof of the completeness theorem in first-order Gödel logic is based on a first-order countable language. I want to know that is there any proof of the completeness theorem in ...
16
votes
2answers
724 views

An order type $\tau$ equal to its power $\tau^n, n>2$

(This is a re-post of my old unanswered question from Math.SE) For purposes of this question, let's concern ourselves only with linear (but not necessarily well-founded) order types. Recall that: ...
5
votes
0answers
164 views

Proving equivalence of a tree-based version of Countable Choice for families of finite sets

In this paper by Good and Tree, the following result is mentioned without proof as part of Proposition 6.5: Each of the following statements imply those beneath it. The countable union of ...
2
votes
2answers
191 views

When is a filter generated by a (countable) chain?

In any partial order $(P,\leq)$ it is easy to see that every chain generates (i.e., by taking the upwards closure) a filter, and any filter built as a result of the Rasiowa-Sikorski lemma in forcing ...
10
votes
3answers
165 views

Maximal chains in a quasi-order of linear order types

Let $\mathcal{T}_\kappa$ be the set of all linear order types of cardinality $\kappa$. Let $\prec$ denote a binary relation on $\mathcal{T}_\kappa$ representing embeddability of order types (note that ...
10
votes
1answer
545 views

Can all aleph_2-dense subsets of R be isomorphic?

Let $\kappa$ be an infinite cardinal. For a subset $A \subseteq \mathbb{R}$, we say that $A$ is $\kappa$-dense if $|A \cap (a, b)| = \kappa$ for every interval $(a, b)$. By Cantor, any two ...
21
votes
3answers
485 views

Is it possible to construct an infinite subset of $\Bbb R$ that is not order isomorphic to any proper subset of itself?

Is it possible to construct an infinite subset of $\Bbb R$ that is not order isomorphic to any proper subset of itself?
11
votes
2answers
414 views

How many subsets of $\mathbb{R}$ are order isomorphic to $\mathbb{Q}$?

How many subsets of $\mathbb{R}$ are order isomorphic to $\mathbb{Q}$? How many subsets of the long line $\omega_1\times[0,1)$ are order isomorphic to $\mathbb{Q}$? I can see that results in ...
12
votes
2answers
315 views

What is the least ordinal than cannot be embedded in $\mathbb{R}^\mathbb{R}$?

Let $\mathbb{R}^\mathbb{R}$ be the set of functions $\mathbb{R}\to\mathbb{R}$ patially ordered by eventual domination. Obviously, every ordinal below $\omega_1$ can be embedded in ...
10
votes
2answers
316 views

Do operations generate well-ordered sets only?

I've read   @TauMu's question   about the set of functions   $\mathbb N\rightarrow\mathbb N$   generated from the identity map by repeatedly applying exponentiation of two already ...
23
votes
2answers
407 views

Order type of the smallest set containing the identity function and closed under exponentiation

Let $E$ be the smallest set of functions $\mathbb{N}^+\to\mathbb{N}^+$ containing the identity function $n \mapsto n$ and closed under exponentiation $(f,g) \mapsto \left(n \mapsto ...
16
votes
2answers
253 views

Is it possible to reconstruct an order type from its initial segments?

Suppose $T$ is a totally ordered set without a maximal element, $\tau$ is the order type of $T$, $S$ is the set of order types of all proper initial segments (downward closed subsets) of $T$. Is ...
4
votes
2answers
243 views

Cardinality of Equivalence Relation of Eventually Sublinear Functions

Let $\Bbb{R}^{+}\_{0}$ be the set of non-negative real numbers and $\Bbb{R}^{+}$be the set of positive reals. Let us say that a function $f \colon \Bbb{R}^{+}\_{0} \to \Bbb{R}^{+}\_{0}$ is eventually ...
1
vote
0answers
176 views

existence of order preserving map [closed]

suppose A is a linear order set with a copy of rationals in it that is $A=B\cup\{\bar{r}:r\in\mathbb{Q}\cap[0,1]\}$. is there an orde preserving map that preservs sup and inf betwwen A and $[0,1]$ in ...
2
votes
1answer
168 views

Is there research on the notion of co-accessibility?

I want to start off with a disclaimer that I am only a mathematical amateur. Please forgive me for ignorance or any non-standard nomenclature I use here :) Let's start off with some context. Let X ...
2
votes
1answer
218 views

Cardinality of group of order-preserving functions from R to R

The title pretty much says it all. What is the cardinality of $G$, the group of all functions $f: \mathbb{R} \to \mathbb{R}$ such that $\forall x,y\in \mathbb{R} \left( x>y\Rightarrow ...
4
votes
1answer
298 views

Uncountable orderings

Let $P$ be an uncountable linear ordering. Is it true that either $P$ contains an order-copy of $\omega_1$ or there is $x_0\in P$ such that there exist uncountably many distinct $y\in P$ with $y< ...
4
votes
1answer
291 views

Characterizing $\omega_1$-like dense linear orderings

I recently came upon the following theorem which was attributed to J. Conway: For each $A\subset \omega_1$, let $\Phi(A)$ be a linear ordering of type $\sum_{\alpha<\omega_1} \tau_\alpha$, where ...
6
votes
1answer
378 views

Strictly order preserving maps into the integers

If $P$ and $P'$ are partial orders, a strictly order preserving map from $P$ to $P'$ is an $f:P\to P'$ satisfying that $x\lt y$ implies $f(x)\lt f(y)$ for all $x,y\in P$. An interval in $P$ is a set ...
3
votes
2answers
418 views

Cantor theorem on orders

It is "a well-known theorem of Cantor", said Sierpinski (circa 1920), that every countable total order can be imbedded in the rationals, and he proceeds to demonstrate that, assuming the continuum ...
-2
votes
1answer
647 views

A question regarding the Continuum Hypothesis

Consider the following theorem of Cantor: If one has a simply-ordered set (M.<) which fulfills the three conditions: a) |M| = aleph-null; b) M has no greatest or least element; c) M is everywhere ...
7
votes
3answers
309 views

Extracting countable chains from linear orders

There is a well-known fact in infinite combinatorics asserting that for each infinite linear order $P$ there is a countable subset $R\subseteq P$ of order type either $\omega$ or $\omega^{*}$ (by ...
0
votes
3answers
728 views

Well-ordered cofinal subsets [closed]

Let $(P, \leq)$ be a total ordering (some of you prefer the name linear order). Can we find a subset $R\subseteq P$ which is well ordered (with respect to $\leq\upharpoonright R$) and cofinal in $P$, ...
4
votes
2answers
293 views

Heights of several interesting posets

Let the height of a poset $P$ be the supremum of ordinals that are order types of all well-ordered subsets of $P$ (with order inherited from $P$). Define several sets of total functions, in each ...
2
votes
1answer
256 views

is $ded^{*}(\kappa)< ded(\kappa)$ consistent?

Hello, I wonder if anyone knows this. Definition: $ded\left(\lambda\right)$ is the supremum of all sizes of linear orders with a dense subset of size $\lambda$. $ded^{*}\left(\lambda\right)$ is ...
8
votes
2answers
676 views

Is $Ded(\kappa)<Ded(\kappa)^\omega$ consistent?

Hello, I want to ask if anyone can tells us what is known (consistently) about $Ded(\kappa)$, $\kappa$ an infinite cardinal. Definition If there is a dense linear order w/o endpoints of size ...
0
votes
2answers
756 views

order-preserving question

A B are totally-ordered sets and there exist two maps f and g such that f is a order-preserving injection from A to B and g is a order-preserving injection from B to A. Q: Are A and B necessarily ...
8
votes
4answers
787 views

Universal order type

Every countable order type, such as the countable ordinals, $\mathbb Z$, etc. can be embedded in $\mathbb Q$, so it is universal for countable order types. Is there a universal space for all linear ...
3
votes
1answer
712 views

Well ordering of countably branching well founded trees

Hello everybody, I would like to say, before stating the question, that I'm not a mathematician, and therefore i apologize in advance if the question is trivial, or well-known. I'll try to state it ...
1
vote
0answers
220 views

Modern books about orders and algebras on trees

Please help to find books about orders and algebras on trees. If there is no modern books, please advice good old ones! I'm more interested in finite trees (my current problem), but infinite ones are ...
8
votes
1answer
323 views

Decomposing posets into countably many chains

A conjecture of Galvin's is that the following is possible (which I take to mean that the consistency of the following can be proven relative to the consistency of something like ZFC, or ZFC plus some ...
6
votes
2answers
578 views

Given a cardinal k, what's the biggest dense linear order with a dense subset of size k?

It's not hard to show that for any cardinal $\kappa$, there is no dense linear order without endpoints (DLO) of size greater than $2^{\kappa}$ that has a dense subset of size $\kappa$. But one can ...
3
votes
2answers
498 views

A problem about posets similar to Suslin's problem

Suslin's problem is: Given a complete dense linear order without endpoints, if it has the ccc must it be isomorphic to $\mathbb{R}$? The answer is that it's independent of ZFC. The related ...
0
votes
1answer
200 views

Is every countable well-order embeddable in \mathbb{R}? [duplicate]

Possible Duplicate: Order types of positive reals The title is self-explanatory.
3
votes
2answers
425 views

Arithmetic of ordered sets more general than ordinals

Motivation. Having read about infinite time Turing machines and ω-languages, I was thinking about more general notions of languages and “computation time”. Languages over strings of length ...
27
votes
4answers
2k views

A principle of mathematical induction for partially ordered sets with infima?

Recently I learned that there is a useful analogue of mathematical induction over $\mathbb{R}$ (more precisely, over intervals of the form $[a,\infty)$ or $[a,b]$). It turns out that this is an old ...
1
vote
1answer
539 views

The poset of k-small downward-closed subposets of a poset P is k-filtered when k is a regular cardinal?

Let $\kappa$ be a cardinal, and let $P$ be a poset. Let $\mathcal{P}_\kappa(P)$ denote the poset of $\kappa$-small subposets of $P$ and let ...
10
votes
5answers
1k views

Explicit ordering on set with larger cardinality than R

Is it possible to construct (without using Axoim of Choice) a totally ordered set S with cardinality larger than $\mathbb{R}$? Motivation: A total ordering is often called a “linear ordering”. I have ...
6
votes
1answer
841 views

Correspondence between functions on a set and “states” on its power set

Let $L$ be the poset (ordered by set inclusion) that is the power set of some set $X$. A state is a function $s:L \rightarrow [0,1]$ satisfying i) for {$p_1,p_2,...$}, $p_i \in L$ a pairwise ...
6
votes
2answers
369 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 there a partial order, ...
17
votes
2answers
654 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, when is this structure ...
6
votes
2answers
943 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 itself). Then one could ...
20
votes
2answers
623 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 would guess if you ...
0
votes
2answers
293 views

name for “solid” subset of a partially ordered set?

For P a partially ordered set, let S be a subset of P such that if: a,c\in S and b\in P and a<=b<=c then b\in S Is there a name for a subset with this property? The term "dense" subset is ...
0
votes
1answer
290 views

Determining set membership from ordering relationships among disjoint sets

Suppose we have a set $P$ (an infinite set), and we have a partition of $P$ into (finitely many) disjoint subsets $P_i$, so that $P = \cup_i P_i$, and $P_i \cap P_j = \emptyset$ for $i \neq j$. ...
2
votes
2answers
376 views

Automorphisms of the totally ordered group Z^n with lexicographical order

It is easy to see that the totally ordered group Z (the integers) with the natural order has no non-trivial automorphisms. Is this also true for Z^n with the lexicographical order?
8
votes
5answers
924 views

Questions about ordering of reals and irrationals

Three problems from G.Rosenstein "Linear orderings" (from the end of Chapter 2 and beginning of Chapter 4): 1) Is there a nondecreasing function from irrationals onto reals? 2) Is there a ...