Discusses both codings of models of arithmetic into the recursively enumerable degrees, and non-distributive lattice embeddings into these degrees. This title shows that if an admissible ordinal $\alpha$ is effectively close to $\omega$ then such constructions may be performed in the $\alpha$-r.e. degrees, but otherwise they fail.
Read More
Discusses both codings of models of arithmetic into the recursively enumerable degrees, and non-distributive lattice embeddings into these degrees. This title shows that if an admissible ordinal $\alpha$ is effectively close to $\omega$ then such constructions may be performed in the $\alpha$-r.e. degrees, but otherwise they fail.
Read Less
Add this copy of The Role of True Finiteness in the Admissible to cart. $66.67, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 2006 by Amer Mathematical Society.
