Affiliation:
1. Department of Mathematics, University of California, Berkeley, USA
Abstract
We prove Fraïssé’s conjecture within the system of [Formula: see text]-comprehension. Furthermore, we prove that Fraïssé’s conjecture follows from the [Formula: see text]-bqo-ness of 3 over the system of Arithmetic Transfinite Recursion, and that the [Formula: see text]-bqo-ness of 3 is a [Formula: see text]-statement strictly weaker than [Formula: see text]-comprehension.
Publisher
World Scientific Pub Co Pte Lt
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Well Partial Orders;Outstanding Contributions to Logic;2024
2. WEAK WELL ORDERS AND FRAÏSSÉ’S CONJECTURE;The Journal of Symbolic Logic;2023-09-27
3. On the logical strength of the better quasi order with three elements;Transactions of the American Mathematical Society;2023-06-21
4. Some independence results related to finite trees;Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences;2023-04-10
5. Embeddings between well-orderings: Computability-theoretic reductions;Annals of Pure and Applied Logic;2020-06