- 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
Unprovability of consistency statements in fragments of bounded arithmetic
Annals of Pure and Applied Logic 74 (3):221-244 (1995)
Abstract
Samuel R. Buss and Aleksandar Ignjatović. Unprovability of Consistency Statements in Fragments of Bounded ArithmeticLinks
PhilArchive
External links
- From the Publisher via CrossRef (no proxy)
- linkinghub.elsevier.com (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)
- sciencedirect.com (no proxy)
- linkinghub.elsevier.com [2] (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
On the Herbrand Notion of Consistency for Finitely Axiomatizable Fragments of Bounded Arithmetic Theories.Leszek Aleksander Kołodziejczyk - 2006 - Journal of Symbolic Logic 71 (2):624 - 638.
Notes on polynomially bounded arithmetic.Domenico Zambella - 1996 - Journal of Symbolic Logic 61 (3):942-966.
Herbrand consistency of some finite fragments of bounded arithmetical theories.Saeed Salehi - 2013 - Archive for Mathematical Logic 52 (3-4):317-333.
Herbrand consistency of some arithmetical theories.Saeed Salehi - 2012 - Journal of Symbolic Logic 77 (3):807-827.
Review: Jan Krajicek, Pavel Pudlak, Gaisi Takeuti, Bounded Arithmetic and the Polynomial Hierarchy; Samuel R. Buss, Relating the Bounded Arithmetic and Polynomial Time Hierarchies; Domenico Zambella, Notes on Polynomially Bounded Arithmetic. [REVIEW]Stephen Cook - 1999 - Journal of Symbolic Logic 64 (4):1821-1823.
Preservation theorems and restricted consistency statements in bounded arithmetic.Arnold Beckmann - 2004 - Annals of Pure and Applied Logic 126 (1-3):255-280.
Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic.Arnold Beckmann & Samuel R. Buss - 2009 - Journal of Mathematical Logic 9 (1):103-138.
A note on the E1 collection scheme and fragments of bounded arithmetic.Zofia Adamowicz & Leszek Aleksander Kołodziejczyk - 2010 - Mathematical Logic Quarterly 56 (2):126-130.
NP Search Problems in Low Fragments of Bounded Arithmetic.Jan Krajíček, Alan Skelley & Neil Thapen - 2007 - Journal of Symbolic Logic 72 (2):649 - 672.
The Second Incompleteness Theorem and Bounded Interpretations.Albert Visser - 2012 - Studia Logica 100 (1-2):399-418.
Separations of first and second order theories in bounded arithmetic.Masahiro Yasumoto - 2005 - Archive for Mathematical Logic 44 (6):685-688.
Analytics
Added to PP
2014-01-16
Downloads
33 (#459,370)
6 months
7 (#350,235)
2014-01-16
Downloads
33 (#459,370)
6 months
7 (#350,235)
Historical graph of downloads
Citations of this work
A generalization of the Second Incompleteness Theorem and some exceptions to it.Dan E. Willard - 2006 - Annals of Pure and Applied Logic 141 (3):472-496.
An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency.Dan E. Willard - 2005 - Journal of Symbolic Logic 70 (4):1171-1209.
Passive induction and a solution to a Paris–Wilkie open question.Dan E. Willard - 2007 - Annals of Pure and Applied Logic 146 (2-3):124-149.
Consistency proof of a fragment of pv with substitution in bounded arithmetic.Yoriyuki Yamagata - 2018 - Journal of Symbolic Logic 83 (3):1063-1090.
On the Herbrand Notion of Consistency for Finitely Axiomatizable Fragments of Bounded Arithmetic Theories.Leszek Aleksander Kołodziejczyk - 2006 - Journal of Symbolic Logic 71 (2):624 - 638.
References found in this work
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-6d9b7f7c4c-v4fj8 uwo