Access the full text.
Sign up today, get DeepDyve free for 14 days.
G. Chaitin (1974)
Information-Theoretic Limitations of Formal SystemsJ. ACM, 21
S. Kleene (1967)
Mathematical Logic
H. Kotlarski (1994)
On the incompleteness theoremsJournal of Symbolic Logic, 59
(2002)
Barebones—notes on complexity and the P =?NP question. unpublished, IEA–USP
R. DeMillo, R. Lipton (1979)
Some connections between mathematical logic and complexity theoryProceedings of the eleventh annual ACM symposium on Theory of computing
J. Hartmanis, J. Hopcroft (1976)
Independence results in computer scienceSIGACT News, 8
G. Kreisel (1952)
On the interpretation of non-finitist proofs–Part IIJournal of Symbolic Logic, 17
S. Feferman (1962)
Transfinite recursive progressions of axiomatic theoriesJournal of Symbolic Logic, 27
S. Fortune, D. Leivant, Michael O'Donnell (1983)
The Expressiveness of Simple and Second-Order Type StructuresJ. ACM, 30
(1997)
Provability and reflection
N. Costa, F. Doria (2006)
Some thoughts on hypercomputationAppl. Math. Comput., 178
S.S. Wainer (1970)
A classification of the ordinal recursive functionArchiv Mathematik Logik, 18
T. Baker, John Gill, R. Solovay (1975)
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 4
(1991)
On the independence of P vs
H. Friedman, L. Harrington (1985)
Harvey Friedman's Research on the Foundations of Mathematics
(2004)
On set theory as a foundation for computer Science
K. Velupillai (2005)
Computability, complexity and constructivity in economic analysis
(1997)
Provability and reflection. Lecture Notes for esslli
Michael Machtey, Paul Young (1978)
An introduction to the general theory of algorithms
S. Feferman (1959)
Arithmetization of metamathematics in a general setting
Jr. Rogers (1969)
Theory of Recursive Functions and Effective Computability
(1991)
On the independence of P vs. NP
(2000)
Talk at the Brazilian logic symposium on his joint work with N
D. Joseph, P. Young (1981)
Fast programs for initial segments and polynomial time computation in weak models of arithmeticSTOC Milwaukee, 1981
S. Kleene (1936)
General recursive functions of natural numbersMathematische Annalen, 112
T. Baker, John Gill, R. Solovay (1975)
Relativizations of the P =? NP QuestionSIAM J. Comput., 4
J. Hartmains (1992)
Computing the futureCommunications of The ACM, 35
N. Costa, F. Doria (2003)
Consequences of an exotic definition for P=NPAppl. Math. Comput., 145
D. Joseph, Paul Young (1981)
Independence Results in Computer Science?J. Comput. Syst. Sci., 23
(2003)
Is P vs. NP formally independent
J. Wierzbicka (1973)
The Absolute Summability of Haar Series by Some Matrix MethodBull. Acad. Pol. des Sci. Ser. Sci. Math. Astron. Phys., 21
(1987)
Information, randomness & incompleteness
T. Franzén (2004)
Transfinite Progressions: A Second Look at CompletenessBulletin of Symbolic Logic, 10
C. Smorynski (1991)
Logical Number Theory IThe Mathematical Gazette, 76
K. Kunen (1995)
A Ramsey theorem in Boyer-Moore logicJournal of Automated Reasoning, 15
N. C. A. da Costa, F. A. Doria, N. C. A. Costa, F. A. Doria (2003)
Addendum to: ‘Consequences of an exotic definition for P = NP’Applied Mathematics and Computation, 145
C. Arrighi, V. Schiaffonati (2006)
Representation and Invariance of Scientific Structures
G. Kreisel (1951)
On the interpretation of non-finitist proofs—Part IJournal of Symbolic Logic, 16
(1969)
Informal rigor
(1982)
A sufficient condition for the consistency of P = NP with Peano Arithmetic
D. Gabbay, A. Irvine, Paul Thagard (2009)
Philosophy of Mathematics
(2004)
On set theory as a foundation for computer
S. Aaronson (2004)
The Computational Complexity Column
N. Costa, F. Doria, E. Bir (2007)
On the metamathematics of the P vs. NP questionAppl. Math. Comput., 189
(2007)
Hypercomputation – special issue
N. Costa, F. Doria (1991)
Undecidability and incompleteness in classical mechanicsInternational Journal of Theoretical Physics, 30
J. Paris (1977)
A Mathematical Incompleteness in Peano ArithmeticStudies in logic and the foundations of mathematics, 90
R. DeMillo, R. Lipton (1980)
The consistency of "P = NP" and related problems with fragments of number theory
(2000)
Talk at the Brazilian logic symposium on his joint work with N . C . A . da Costa on computational complexity
R. Goodstein, H. Rogers (1969)
Theory of Recursive Functions and Effective ComputabilityThe Mathematical Gazette, 53
C. Smoryfiski (1980)
Some rapidly growing functionsThe Mathematical Intelligencer
A. Pillay (1981)
Models of Peano Arithmetic
D. Joseph, Paul Young (1981)
Fast programs for initial segments and polynomial time computation in weak models of arithmetic (Preliminary Abstract)
S. Wainer (1970)
A classification of the ordinal recursive functionsArchiv für mathematische Logik und Grundlagenforschung, 13
C. Smorynski (1977)
The Incompleteness TheoremsStudies in logic and the foundations of mathematics, 90
(1959)
On a restricted ωrule
G. Longo (2000)
On the Proofs of Some Formally Unprovable Propositions and Prototype Proofs in Type Theory
J. Barwise, H. Keisler (1977)
Handbook of mathematical logicThe British Journal for the Philosophy of Science, 30
We discuss Kunen’s algorithmic implementation of a proof for the Paris–Harrington theorem, and the author’s and da Costa’s proposed “exotic” formulation for the P = NP hypothesis. Out of those two examples we ponder the relation between mathematics within an axiomatic framework, and intuitive or informal mathematics.
Synthese – Springer Journals
Published: Jan 25, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.