Graph colorings and recursively bounded ^ 0_ 1-classes
From MaRDI portal
DOI10.1016/0168-0072(86)90051-5zbMATH Open0625.03024OpenAlexW2091918101MaRDI QIDQ579241FDOQ579241
Authors: Jeffrey Remmel 
Publication date: 1986
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(86)90051-5
Recommendations
Coloring of graphs and hypergraphs (05C15) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Title not available (Why is that?)
- A theory of recursive dimension of ordered sets
- An Effective Version of Dilworth's Theorem
- Title not available (Why is that?)
- Effective coloration
- ∏ 0 1 Classes and Degrees of Theories
- A decomposition theorem for partially ordered sets
- Degrees of members of \(\Pi_ 1^ 0\) classes
- Recursive Colorings of Highly Recursive Graphs
- Recursive Euler and Hamilton Paths
- Recursive Colorings of Graphs
- Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
- Countable retracing functions and \(\Pi_2^0\) predicates
- On the Effectiveness of the Schroder-Bernstein Theorem
- Effective Matchmaking and k-Chromatic Graphs
Cited In (14)
- Index sets for \(\Pi^0_1\) classes
- Feasible Graphs and Colorings
- A theory of nonmonotonic rule systems. II
- Countable thin \(\Pi^0_1\) classes
- Primitive recursive reverse mathematics
- Π01-classes and Rado's selection principle
- A study of the boundary graph classes for colorability problems
- Graphs are not universal for online computability
- Online presentations of finitely generated structures
- Recursively presented games and strategies
- Title not available (Why is that?)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Degrees of orders on torsion-free abelian groups
- A structure of punctual dimension two
This page was built for publication: Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579241)
