1
vote
1answer
271 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 ...
1
vote
0answers
54 views

First-order Peano Axioms and order-completeness of $\mathbb{N}$ [closed]

Definition: An ordered set is order-complete if any nonempty subset with an upper bound, has a lowest upper bound or supremo. Notation: We denote the system of first-order Peano Axioms (along with ...
16
votes
2answers
699 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: ...
10
votes
3answers
156 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 ...
11
votes
2answers
399 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 ...
4
votes
2answers
221 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 ...
3
votes
2answers
405 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 ...
12
votes
1answer
533 views

Does every feasible partial order relation on the natural numbers extend to a feasible linear order relation?

It is well known that every partial order on a set can be extended to a linear order on that set. That is, for every partial order $\lhd$ on a set $X$, there is a linear order $\prec$ on $X$ such that ...
1
vote
1answer
280 views

Complete De Morgan algebra

Recall that an algebra $(A,\sim)$ is a De Morgan algebra if $A$ is a bounded distributive lattice and $\sim$ is a unary operation which satisfies: ${\sim} (x\vee y)={\sim} x\wedge {\sim} y$ and ...
3
votes
0answers
205 views

When Aut(M) preserves a linear order?

I have a general-type question: Suppose $M$ is a countable structure that is ultrahomogeneous, i.e. every (partial) isomorphism between finitely generated substructures of $M$ extends to an ...
1
vote
2answers
350 views

Definition of $\beta$-limit ordinals

Hello, I am reading Rosenstein's "Linear Orderings" and I am not sure if I am missing something, or if there is an error. He gives the definition of a $\beta$-limit ordinal inductively, as follows ...
2
votes
1answer
252 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
658 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 ...
27
votes
2answers
610 views

What is the minimal size of a partial order that is universal for all partial orders of size n?

A partial order $\mathbb{B}$ is universal for a class $\cal{P}$ of partial orders if every order in $\cal{P}$ embeds order-preservingly into $\mathbb{B}$. For example, every partial order ...
8
votes
4answers
720 views

Order types of positive reals

Suppose one has a set $S$ of positive real numbers, such that the usual numerical ordering on $S$ is a well-ordering. Is it possible for $S$ to have any countable ordinal as its order type, or are the ...
6
votes
1answer
827 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 ...
22
votes
3answers
701 views

Does the exact pair phenomenon for partial orders occur in your area of mathematics?

Suppose that I have a partial order P and an increasing sequence $a_0< a_1<a_2<\cdots$ of elements of $P$. A pair of elements (b,c) from P is said to be an exact pair for this sequence, if ...
23
votes
9answers
2k views

How many groups of size at most n are there? What is the asymptotic growth rate? And what of rings, fields, graphs, partial orders, etc.?

Question. How many (isomorphism types of) finite groups of size at most n are there? What is the asymptotic growth rate? And the same question for rings, fields, graphs, partial orders, etc. ...
3
votes
3answers
217 views

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

Given a partial order $R_{\leq}$ over a set $D$, the set of upper bounds under $R$ of a subset $S$ of $D$ is commonly defined as $\{ y \in D | \ \forall x\in S, x R y \}$. (The set of lower bounds of ...
6
votes
2answers
361 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, ...
12
votes
2answers
498 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 ...
2
votes
3answers
462 views

Countable atomless boolean algebra covered by a larger boolean algebra

Suppose Q is an atomless countable boolean algebra, and B is an arbitrary atomless boolean algebra. Q is unique modulo isomorphisms. There is a subalgebra in B that is isomorphic to Q. There is ...
7
votes
2answers
932 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 ...
17
votes
2answers
575 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 ...
3
votes
2answers
305 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}? That is, for every ...