Algebraische Berechenbarkeits- und Aufzählungsmodelle: Rekursionstheorie und
155,88 €
Further applications to computing with ultrafilters on sets and Turing degree computability are examined. Functorial models computability is presented with algebraic trees realizing intuitionistic types of models.
Jetzt bei Ebay:
![Produktbild - Abstract Recursion and Intrinsic Complexity (Lecture Notes in Logic) [Hardback]](https://i.ebayimg.com/thumbs/images/g/5vEAAOSwM0pm-J3r/s-l140.jpg)
![Produktbild - Complexity, Logic, and Recursion Theory by Sorbi, Andrea [Hardback]](https://i.ebayimg.com/thumbs/images/g/RroAAeSwbTxnxFWL/s-l140.jpg)
