Springer (2009)
| Authors |
|
| 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 | (categorize this paper) |
| Buy this book | $23.70 new Amazon page |
| Call number | QA9.59.T87 2009 |
| ISBN(s) | 9781848820524 1848820518 9781848820517 1848820526 1849968187 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
PhilArchive copy
Upload a copy of this paper Check publisher's policy Papers currently archived: 69,226
External links
(no proxy) Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
No references found.
Citations of this work BETA
Computer Science as Immaterial Formal Logic.Selmer Bringsjord - 2020 - Philosophy and Technology 33 (2):339-347.
Programming Languages as Technical Artifacts.Raymond Turner - 2014 - Philosophy and Technology 27 (3):377-397.
View all 8 citations / Add more citations
Similar books and articles
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Formulas for Computable and Non-Computable Functions.Samuel Alexander - 2006 - Rose-Hulman Undergraduate Mathematics Journal 7 (2).
Bounding Prime Models.Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight & Robert I. Soare - 2004 - Journal of Symbolic Logic 69 (4):1117 - 1142.
New Computational Paradigms: Changing Conceptions of What is Computable.S. B. Cooper, Benedikt Löwe & Andrea Sorbi (eds.) - 2007 - Springer.
Construction of Models for Algebraically Generalized Recursive Function Theory.H. R. Strong - 1970 - Journal of Symbolic Logic 35 (3):401-409.
Tailoring Recursion for Complexity.Erich Grädel & Yuri Gurevich - 1995 - Journal of Symbolic Logic 60 (3):952-969.
On a Complexity-Based Way of Constructivizing the Recursive Functions.F. W. Kroon & W. A. Burkhard - 1990 - Studia Logica 49 (1):133 - 149.
Analytics
Added to PP index
2010-07-20
Total views
21 ( #532,156 of 2,499,689 )
Recent downloads (6 months)
2 ( #278,274 of 2,499,689 )
2010-07-20
Total views
21 ( #532,156 of 2,499,689 )
Recent downloads (6 months)
2 ( #278,274 of 2,499,689 )
How can I increase my downloads?
Downloads
