On unsolvability in subrecursive classes of predicates

Notre Dame Journal of Formal Logic 20 (1):55-67 (1979)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,610

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The decision problem: solvable classes of quantificational formulas.Burton Dreben - 1979 - Reading, Mass.: Addison-Wesley, Advanced Book Program. Edited by Warren D. Goldfarb.
Vague predicates and language games.Rohit Parikh - 1996 - Theoria 11 (3):97-107.
Degrees of unsolvability.Joseph Robert Shoenfield - 1972 - New York,: American Elsevier.
Quine's Platonism and Antiplatonism.Srećko Kovač - 1999 - Synthesis Philosophica 14 (1-2):45-52.
Must Synonymous Predicates be Coextensive?Charles Sayward - 1981 - Logique Et Analyse 95 (95):430-435.
Durative Achievements and Individual-Level Predicates on Events.Kate Kearns - 2003 - Linguistics and Philosophy 26 (5):595 - 635.
On the induction schema for decidable predicates.Lev D. Beklemishev - 2003 - Journal of Symbolic Logic 68 (1):17-34.
Quantum sortal predicates.Décio Krause & Steven French - 2007 - Synthese 154 (3):417 - 430.

Analytics

Added to PP
2010-08-24

Downloads
7 (#1,379,768)

6 months
6 (#509,139)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references