Computing maximal chains

DOI10.1007/s00153-012-0289-4zbMath1252.03105arXiv1201.4408OpenAlexW2112872662MaRDI QIDQ453200

Richard A. Shore, Alberto Marcone, Antonio Montalbán

Publication date: 18 September 2012

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.4408

zbMATH Keywords

maximal chaincomputable well partial orderhyperarithmetic hierarchyhyperarithmetically generic

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Applications of computability and recursion theory (03D80) Theory of numerations, effectively presented structures (03D45)

Related Items (2)

A computably enumerable partial ordering without computably enumerable maximal chains and antichains ⋮ The Reverse Mathematics of wqos and bqos

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximal linear extension theorem in second order arithmetic
• Pairs of recursive structures
• On the strength of König's duality theorem for infinite bipartite graphs
• Ordered sets
• Computable linearizations of well-partial-orderings
• Complexity of winning strategies
• On Chains and Antichains in well Founded Partially Ordered Sets
• On the strength of König's duality theorem for countable bipartite graphs
• Partially well ordered sets and partial ordinals

This page was built for publication: Computing maximal chains