co-RE-complete is the set of decision problems that are complete for co-RE. In a sense, these are the complements of the hardest recursively enumerable problems.
Examples of co-RE-complete problems:
- The Domino Problem for Wang tiles.
- The satisfiability problem for first-order logic
Read more about this topic: RE (complexity)