An intuitionistic proof of Kruskal's theorem
From MaRDI portal
Publication:1879322
DOI10.1007/s00153-003-0207-xzbMath1063.03046OpenAlexW2039705582MaRDI QIDQ1879322
Publication date: 22 September 2004
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2066/18887
Related Items
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains, On the well-foundedness of adequate orders used for construction of complete unfolding prefixes, An effective proof of the well-foundedness of the multiset path ordering, THE FINE STRUCTURE OF THE INTUITIONISTIC BOREL HIERARCHY, Certified Kruskal’s Tree Theorem, Brouwer's fan theorem as an axiom and as a contrast to Kleene's alternative, A constructive picture of Noetherian conditions and well quasi-orders, The Borel Hierarchy Theorem from Brouwer's intuitionistic perspective, Higman’s Lemma and Its Computational Content, Two simple sets that are not positively Borel, Intuitionism: an inspiration?
