- 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
Delineating classes of computational complexity via second order theories with weak set existence principles. I
Journal of Symbolic Logic 60 (1):103-121 (1995)
Abstract
Aleksandar Ignjatović. Delineating Classes of Computational Complexity via Second Order Theories with Weak Set Existence Principles (I)Links
PhilArchive
External links
- From the Publisher via CrossRef (no proxy)
- projecteuclid.org
(no proxy) - projecteuclid.org [2] (no proxy)
- repository.cmu.edu (no proxy)
- repository.cmu.edu [2] (no proxy)
- repository.cmu.edu [3] (no proxy)
- repository.cmu.edu [4] (no proxy)
- repository.cmu.edu [5] (no proxy)
- journals.cambridge.org (no proxy)
- jstor.org (no proxy)
- jstor.org [2] (no proxy)
- jstor.org [3] (no proxy)
- cambridge.org (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
Quantifiers in TIME and SPACE. Computational Complexity of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2009 - Dissertation, University of Amsterdam
The computational complexity of logical theories.Jeanne Ferrante - 1979 - New York: Springer Verlag. Edited by Charles W. Rackoff.
The axiom of choice and the law of excluded middle in weak set theories.John L. Bell - 2008 - Mathematical Logic Quarterly 54 (2):194-201.
Lévy hierarchy in weak set theories.Jiří Hanika - 2008 - Journal of Philosophical Logic 37 (2):121 - 140.
Analytics
Added to PP
2009-01-28
Downloads
43 (#368,455)
6 months
7 (#421,763)
2009-01-28
Downloads
43 (#368,455)
6 months
7 (#421,763)
Historical graph of downloads
Citations of this work
Unprovability of consistency statements in fragments of bounded arithmetic.Samuel R. Buss & Aleksandar Ignjatović - 1995 - Annals of Pure and Applied Logic 74 (3):221-244.
Delineating classes of computational complexity via second order theories with weak set existence principles. I.Aleksandar Ignjatović - 1995 - Journal of Symbolic Logic 60 (1):103-121.
References found in this work
Metamathematics of First-Order Arithmetic.Petr Hajék & Pavel Pudlák - 1994 - Studia Logica 53 (3):465-466.
Unprovability of consistency statements in fragments of bounded arithmetic.Samuel R. Buss & Aleksandar Ignjatović - 1995 - Annals of Pure and Applied Logic 74 (3):221-244.
Delineating classes of computational complexity via second order theories with weak set existence principles. I.Aleksandar Ignjatović - 1995 - Journal of Symbolic Logic 60 (1):103-121.
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-64dd777598-pjbg5 uwo