- 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
Complexity for type-$2$ relations [Book Review]
Notre Dame Journal of Formal Logic 31 (2):241-262 (1990)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
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
Review: Mike Townsend, Complexity for Type-2 Relations. [REVIEW]Bruce Kapron - 1993 - Journal of Symbolic Logic 58 (1):360-360.
Mike Townsend. Complexity for type-2 relations. Notre Dame journal of formal logic, vol. 31 , pp. 241–262.Bruce Kapron - 1993 - Journal of Symbolic Logic 58 (1):360.
On Bounded Type-Definable Equivalence Relations.Ludomir Newelski & Krzysztof Krupi?Ski - 2002 - Notre Dame Journal of Formal Logic 43 (4):231-242.
Complexity of model-theoretic notions.Russell W. Myers - 1980 - Notre Dame Journal of Formal Logic 21 (4):656-658.
Expressibility in type theory.H. Julian Wadleigh - 1970 - Notre Dame Journal of Formal Logic 11 (3):257-288.
Second-order quantifiers and the complexity of theories.J. T. Baldwin & S. Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (3):229-303.
Relations irreducible to classes.F. G. Asenjo - 1963 - Notre Dame Journal of Formal Logic 4 (3):193-200.
Partial functions in type theory.François Lepage - 1992 - Notre Dame Journal of Formal Logic 33 (4):493-516.
Analytics
Added to PP
2010-08-24
Downloads
24 (#924,364)
6 months
8 (#633,132)
2010-08-24
Downloads
24 (#924,364)
6 months
8 (#633,132)
Historical graph of downloads
Citations of this work
Computational complexity on computable metric spaces.Klaus Weirauch - 2003 - Mathematical Logic Quarterly 49 (1):3-21.
Polynomial games and determinacy.Tomoyuki Yamakami - 1996 - Annals of Pure and Applied Logic 80 (1):1-16.
A schematic definition of quantum polynomial time computability.Tomoyuki Yamakami - 2020 - Journal of Symbolic Logic 85 (4):1546-1587.
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-667477cd97-lxkd2 dc2