The logical strength of minimal bad arrays

DOI10.1090/PROC/17038MaRDI QIDQ6658147

Fedor N. Pakhomov, Anton Freund, Giovanni Soldà

Publication date: 8 January 2025

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

reverse mathematicsbetter-quasi-order\(\Pi^1_2\)-comprehensionminimal bad array

Mathematics Subject Classification ID

Partial orders, general (06A06) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Cites Work

• Graph minors. XX: Wagner's conjecture
• Theory of relations. Transl. from the French by P. Clote
• The Galvin-Prikry theorem and set existence axioms
• Better quasi-orders for uncountable cardinals
• On Fraissé's order type conjecture
• The theory of well-quasi-ordering: a frequently discovered concept
• Foundations of BQO Theory
• Reverse mathematics and the equivalence of definitions for well and better quasi-orders
• Reverse Mathematics and Π¹₂ Comprehension
• Partial well‐ordering of sets of vectors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: The logical strength of minimal bad arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658147)