Computable Models
Springer (2009)
| Abstract | Raymond Turner first provides a logical framework for specification and the design of specification languages, then uses this framework to introduce and study ... | |||||||||
| Keywords | Computable functions Model theory | |||||||||
| Categories | ||||||||||
| Buy the book | $109.00 direct from Amazon Amazon page | |||||||||
| Call number | QA9.59.T87 2009 | |||||||||
| ISBN(s) | 9781848820524 1848820518 9781848820517 1848820526 | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,865 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesJoseph S. Miller (2004). Degrees of Unsolvability of Continuous Functions. Journal of Symbolic Logic 69 (2):555 - 584.
F. W. Kroon & W. A. Burkhard (1990). On a Complexity-Based Way of Constructivizing the Recursive Functions. Studia Logica 49 (1):133 - 149.
Erich Grädel & Yuri Gurevich (1995). Tailoring Recursion for Complexity. Journal of Symbolic Logic 60 (3):952-969.
H. R. Strong (1970). Construction of Models for Algebraically Generalized Recursive Function Theory. Journal of Symbolic Logic 35 (3):401-409.
Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight & Robert I. Soare (2004). Bounding Prime Models. Journal of Symbolic Logic 69 (4):1117 - 1142.
Samuel Alexander (2006). Formulas for Computable and Non-Computable Functions. Rose-Hulman Undergraduate Mathematics Journal 7 (2).
Analytics
Monthly downloads |
Added to index2010-07-20Total downloads2 ( #234,650 of 556,803 )Recent downloads (6 months)1 ( #64,847 of 556,803 )How can I increase my downloads? |
My notes
Discussion
