Graph colorings and recursively bounded ^ 0_ 1-classes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3769624 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A decomposition theorem for partially ordered sets
- A theory of recursive dimension of ordered sets
- An Effective Version of Dilworth's Theorem
- Countable retracing functions and \(\Pi_2^0\) predicates
- Degrees of members of \(\Pi_ 1^ 0\) classes
- Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
- Effective Matchmaking and k-Chromatic Graphs
- Effective coloration
- On the Effectiveness of the Schroder-Bernstein Theorem
- Recursive Colorings of Graphs
- Recursive Colorings of Highly Recursive Graphs
- Recursive Euler and Hamilton Paths
- ∏ 0 1 Classes and Degrees of Theories
Cited in
(14)- Countable thin \(\Pi^0_1\) classes
- Π01-classes and Rado's selection principle
- Recursively presented games and strategies
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Degrees of orders on torsion-free abelian groups
- A structure of punctual dimension two
- A study of the boundary graph classes for colorability problems
- Graphs are not universal for online computability
- Index sets for \(\Pi^0_1\) classes
- Online presentations of finitely generated structures
- scientific article; zbMATH DE number 7407778 (Why is no real title available?)
- A theory of nonmonotonic rule systems. II
- Primitive recursive reverse mathematics
- Feasible Graphs and Colorings
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)