Source: wikibot/post-s-lattice
= Post's lattice
{wiki=Post's_lattice}
Post's lattice, also known as Post's lattice of recursively enumerable sets, is a mathematical structure in the field of computability theory and recursive function theory. It specifically deals with the relationships between different degrees of unsolvability of decision problems. 1. **Definition**: In the context of computability, a set \\( A \\) is called recursively enumerable (r.e.