1
vote
1answer
346 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
95 views

Dedekind–MacNeille completion of ordered abelian monoids

It's known that the Dedekind–Macneille completion of an ordered Abelian group necessarily is not an ordered Abelian group (and it is an ordered Abelian monoid). I want to know that what happened ...
1
vote
0answers
173 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 ...
5
votes
1answer
357 views

Does “antichain” mean something different in set-forcing than in lattice theory?

On page 3 of Introduction to Lattices and Order, Davey and Priestley define an antichain in a poset $\langle P,\leq\rangle$ as a set of pairwise incomparable elements: The ordered set P is an ...
4
votes
1answer
572 views

Can the Knaster-Tarski theorem be proved using the Schroeder-Bernstein theorem?

The reverse can be done easily and the proof is well known I am wondering if the exact same argument can be used to prove reverse as well.
39
votes
4answers
2k views

How do the compact Hausdorff topologies sit in the lattice of all topologies on a set?

This question is about the space of all topologies on a fixed set X. We may order the topologies by refinement, so that τ ≤ σ just in case every τ open set is open in σ. ...