A constructive proof of the topological Kruskal theorem

DOI10.1007/978-3-642-40313-2_3zbMATH Open1403.03126OpenAlexW8365111MaRDI QIDQ2849896FDOQ2849896

Authors: Jean Goubault-Larrecq 

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_3

Recommendations

• scientific article; zbMATH DE number 1795230
• scientific article; zbMATH DE number 1223728
• Constructive topology and combinatorics
• Certified Kruskal's tree theorem
• Certified Kruskal's tree theorem

Mathematics Subject Classification ID

Trees (05C05) Combinatorics of partially ordered sets (06A07) Other constructive mathematics (03F65) Intuitionistic mathematics (03F55)

Cited In (13)

• Constructive topology and combinatorics
• Higman's lemma and its computational content
• Title not available (Why is that?)
• Proof-theoretic investigations on Kruskal's theorem
• Certified Kruskal's tree theorem
• Title not available (Why is that?)
• An intuitionistic proof of Kruskal's theorem
• Forward analysis for WSTS. III: Karp-Miller trees
• A constructive proof of Kirszbraun's theorem
• Drags: a compositional algebraic framework for graph rewriting
• Title not available (Why is that?)
• Kruskal's tree theorem for acyclic term graphs
• Certified Kruskal's tree theorem

This page was built for publication: A constructive proof of the topological Kruskal theorem

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