Subrecursive Complexity of Identifying the Ramsey Structure of Posets

DOI10.1007/978-3-540-69407-6_23zbMath1142.03350OpenAlexW42200938MaRDI QIDQ3507434

Willem L. Fouché

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_23

zbMATH Keywords

structural Ramsey theorysubrecursive hierarchypartially ordered sets (posets)

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Ramsey theory (05D10) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial partitions of finite posets and lattices - Ramsey lattices
• Ramsey classes of set systems
• The partite construction and Ramsey set systems
• Partitions of finite relational and set systems
• Symmetry and the Ramsey degrees of finite relational structures
• Symmetry and the Ramsey degree of posets
• Ramsey degrees of bipartite graphs: a primitive recursive proof
• Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
• Primitive Recursive Bounds for Van Der Waerden Numbers
• Regularity and Positional Games
• Models Without Indiscernibles
• Ramsey's Theorem for n-Parameter Sets
• Chain partitions of ordered sets

This page was built for publication: Subrecursive Complexity of Identifying the Ramsey Structure of Posets