- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The Theory of Computability Developed in Terms of Satisfaction
Notre Dame Journal of Formal Logic 40 (4):515-532 (1999)
Abstract
The notion of computability is developed through the study of the behavior of a set of languages interpreted over the natural numbers which contain their own fully defined satisfaction predicate and whose only other vocabulary is limited to "0", individual variables, the successor function, the identity relation and operators for disjunction, conjunction, and existential quantification.Author's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Formal Notes on the Substitutional Analysis of Logical Consequence.Volker Halbach - 2020 - Notre Dame Journal of Formal Logic 61 (2):317-339.
A Note on Identity and Higher Order Quantification.Rafal Urbaniak - 2009 - Australasian Journal of Logic 7:48--55.
On the expressive power of game sentences.Juha Oikkonen - 1982 - Bulletin of the Section of Logic 11 (1-2):40-45.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Book review: Melvin Fitting. Computability theory, semantics, and logic programming. [REVIEW]Martin Davis - 1990 - Notre Dame Journal of Formal Logic 31 (3):485-486.
A simple generalization of Turing computability.William J. Thomas - 1979 - Notre Dame Journal of Formal Logic 20 (1):95-102.
Analytics
Added to PP
2010-08-24
Downloads
268 (#10,538)
6 months
69 (#229,839)
2010-08-24
Downloads
268 (#10,538)
6 months
69 (#229,839)
Historical graph of downloads
Author's Profile
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-6mvtb uwo