An example Ginsburg said in 1984 he was "unable to find" and a forbidden subposet characterization of subsets of regular posets

In 1984, Ginsburg wrote, "We have been unable to find an example of an ordered set $P$ having the properties of [being complete, densely ordered, with no antichain other than $\{0\}$ and $\{1\}$ that is a cutset] and in which all antichains are countable." In this very brief note, such an example is shown. Posets that can be embedded in regular posets are characterized as posets that do not contain $\omega\times\{0,1\}$ or its dual as a subposet. Any such poset $P$ can be embedded in a regular poset that can be embedded in any other regular poset containing $P$.

Authors

Publication Details

Journal
Mathematica Bohemica
Published
2024-12-10
DOI
https://doi.org/10.21136/mb.2024.0039-23
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An example Ginsburg said in 1984 he was "unable to find" and a forbidden subposet characterization of subsets of regular posets

Jonathan David Farley
Mathematica Bohemica
Computability, Logic, AI Algorithms
article

An example Ginsburg said in 1984 he was "unable to find" and a forbidden subposet characterization of subsets of regular posets

Jonathan David Farley
article en

Abstract

In 1984, Ginsburg wrote, "We have been unable to find an example of an ordered set $P$ having the properties of [being complete, densely ordered, with no antichain other than $\{0\}$ and $\{1\}$ that is a cutset] and in which all antichains are countable." In this very brief note, such an example is shown. Posets that can be embedded in regular posets are characterized as posets that do not contain $\omega\times\{0,1\}$ or its dual as a subposet. Any such poset $P$ can be embedded in a regular poset that can be embedded in any other regular poset containing $P$.

Mathematica BohemicaVol. 150(4)
Reduced inequalities
Openalex Percentile: Top 73%
Computability, Logic, AI Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.