Computing maximal chains
- 24 May 2012
- journal article
- research article
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 51 (5-6) , 651-660
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- The maximal linear extension theorem in second order arithmeticArchive for Mathematical Logic, 2011
- Computable Linearizations of Well-partial-orderingsOrder, 2007
- On the strength of König's duality theorem for countable bipartite graphsThe Journal of Symbolic Logic, 1994
- On the strength of König's duality theorem for infinite bipartite graphsJournal of Combinatorial Theory, Series B, 1992
- Pairs of recursive structuresAnnals of Pure and Applied Logic, 1990
- Higher Recursion Theory1990
- The relation between the height of a well-founded partial ordering and the order types of its chains and antichainsJournal of Combinatorial Theory, Series B, 1981
- On Chains and Antichains in well Founded Partially Ordered SetsJournal of the London Mathematical Society, 1981
- Well-partial orderings and hierarchiesIndagationes Mathematicae, 1977
- Complexity of winning strategiesDiscrete Mathematics, 1972