Countable homogeneous ordered bipartite graphs

IF 0.5 4区数学 Q1 Arts and Humanities

Archive for Mathematical Logic Pub Date : 2025-09-08 DOI:10.1007/s00153-025-00986-1

J. K. Truss

引用次数: 0

Abstract

A classification is given of all the countable homogeneous ordered bipartite graphs, including those in which just one of the two parts is ordered. In non-trivial cases where the whole structure is ordered, the two parts are ordered like the rationals, and may interact in three essentially different ways. If just one side is ordered, then the structure is the unique one arising as a Fraïssé limit.

查看原文本刊更多论文

可数齐次有序二部图

给出了所有可数齐次有序二部图的分类，包括其中只有一个部分是有序的二部图。在非平凡的情况下，整个结构是有序的，这两个部分就像有理一样有序，并且可能以三种本质上不同的方式相互作用。如果只有一面是有序的，那么结构是唯一的，作为Fraïssé限制。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Archive for Mathematical Logic MATHEMATICS-LOGIC

CiteScore

0.80

自引率

0.00%

发文量

审稿时长

6-12 weeks

期刊介绍： The journal publishes research papers and occasionally surveys or expositions on mathematical logic. Contributions are also welcomed from other related areas, such as theoretical computer science or philosophy, as long as the methods of mathematical logic play a significant role. The journal therefore addresses logicians and mathematicians, computer scientists, and philosophers who are interested in the applications of mathematical logic in their own field, as well as its interactions with other areas of research.