English

On the computability of cofinal Fra\"iss\'e limits

Logic 2026-02-02 v1 Logic in Computer Science

Abstract

For any collection of finite structures closed under isomorphism (i.e., an age) which has the Hereditary Property (HP), the Joint Embedding Property (JEP), and the Cofinal Amalgamation Property (CAP), there is a unique (up to isomorphism) countable structure which is cofinally ultrahomogeneous with the given age. Such a structure is called the cofinal Fra\"iss\'e limit of the age. In this paper, we consider the computational strength needed to construct the cofinal Fra\"iss\'e limit of a computable age. We show that this construction can always be done using the oracle 0''', and that there are ages that require 0''. In contrast, we show that if one assumes the strengthening of (CAP) known as the Amalgamation Property (AP), then the resulting limit, called the Fra\"iss\'e limit, can be constructed from the age using 0'. Our results therefore show that the more general case of cofinal Fra\"iss\'e limits requires greater computational strength than Fra\"iss\'e limits.

Cite

@article{arxiv.2601.22435,
  title  = {On the computability of cofinal Fra\"iss\'e limits},
  author = {Nathanael Ackerman and Cameron Freer and Mostafa Mirabi},
  journal= {arXiv preprint arXiv:2601.22435},
  year   = {2026}
}

Comments

29 pages

R2 v1 2026-07-01T09:26:55.387Z