- 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
On computational complexity in weakly admissible structures
Journal of Symbolic Logic 45 (2):353-358 (1980)
Abstract
This article has no associated abstract. (fix it)Author's Profile
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
Weakly atomic-compact relational structures.G. Fuhrken & W. Taylor - 1971 - Journal of Symbolic Logic 36 (1):129-140.
Subsets of Superstable Structures Are Weakly Benign.Bektur Baizhanov, John T. Baldwin & Saharon Shelah - 2005 - Journal of Symbolic Logic 70 (1):142 - 150.
On the Capture of Complexity Classes Using Logic.I. A. Stewart - 1991 - University of Newcastle Upon Tyne, Computing Laboratory.
On the Computational Complexity of Algorithms.J. Hartmanis & R. E. Stearns - 1967 - Journal of Symbolic Logic 32 (1):120-121.
On definable Skolem functions in weakly o-minimal nonvaluational structures.Pantelis E. Eleftheriou, Assaf Hasson & Gil Keren - 2017 - Journal of Symbolic Logic 82 (4):1482-1495.
Computational Complexity of Recursive Sequences.J. Hartmanis & R. E. Stearns - 1967 - Journal of Symbolic Logic 32 (1):121-122.
Analytics
Added to PP
2009-01-28
Downloads
41 (#573,490)
6 months
12 (#218,371)
2009-01-28
Downloads
41 (#573,490)
6 months
12 (#218,371)
Historical graph of downloads
Author's Profile
References found in this work
Finite injury arguments in infinite computation theories.Viggo Stoltenberg-Hansen - 1979 - Annals of Mathematical Logic 16 (1):57-80.
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-99fc7d78b-58pt2 uwo