- 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 Gödel incompleteness and finite combinatorics
Annals of Pure and Applied Logic 33 (C):23-41 (1987)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
Kenneth McAloon. On the sequence of models HODn. Fundamenta mathematicae, vol. 82 , pp. 85–93. - Thomas J. Jech. Forcing with trees and ordinal definability. Annals of mathematical logic, vol. 7 no. 4 , pp. 387–409. - Włodzimierz Zadrożny. Iterating ordinal definability. Annals of pure and applied logic, vol. 24 , pp. 263–310. [REVIEW]Rene David - 1987 - Journal of Symbolic Logic 52 (2):570-571.
Infinite combinatorics and definability.Arnold W. Miller - 1989 - Annals of Pure and Applied Logic 41 (2):179-203.
Algebraic combinatorics in bounded induction.Joaquín Borrego-Díaz - 2021 - Annals of Pure and Applied Logic 172 (2):102885.
Foundations of iterated star maps and their use in combinatorics.Mauro Di Nasso & Renling Jin - 2025 - Annals of Pure and Applied Logic 176 (1):103511.
Robert M. Solovay, William N. Reinhardt, and Akihiro Kanamori. Strong axioms of infinity and elementary embeddings. Annals of mathematical logic, vol. 13 , pp. 73–116. - Menachem Magidor. HOW large is the first strongly compact cardinal? or A study on identity crises. Annals of mathematical logic, vol. 10 , pp. 33–57. [REVIEW]Carlos Augusto Di Prisco - 1986 - Journal of Symbolic Logic 51 (4):1066-1068.
Andreas Blass. Selective ultrafilters and homogeneity. Annals of pure and applied logic, vol. 38 , pp. 215–255. - Claude Laflamme. Forcing with filters and complete combinatorics. Annals of pure and applied logic, vol. 42 , pp. 125–163. [REVIEW]Peter J. Nyikos - 1991 - Journal of Symbolic Logic 56 (4):1490-1492.
The Löwenheim-Skolem theorem for Gödel logic.J. P. Aguilera - 2023 - Annals of Pure and Applied Logic 174 (4):103235.
On the classification of first order Gödel logics.Matthias Baaz & Norbert Preining - 2019 - Annals of Pure and Applied Logic 170 (1):36-57.
Gödel algebras free over finite distributive lattices.Stefano Aguzzoli, Brunella Gerla & Vincenzo Marra - 2008 - Annals of Pure and Applied Logic 155 (3):183-193.
A note on applicability of the incompleteness theorem to human mind.Pavel Pudlák - 1999 - Annals of Pure and Applied Logic 96 (1-3):335-342.
Analytics
Added to PP
2014-01-16
Downloads
34 (#665,199)
6 months
9 (#485,111)
2014-01-16
Downloads
34 (#665,199)
6 months
9 (#485,111)
Historical graph of downloads
Author's Profile
Citations of this work
A universal approach to self-referential paradoxes, incompleteness and fixed points.Noson S. Yanofsky - 2003 - Bulletin of Symbolic Logic 9 (3):362-386.
Current Research on Gödel’s Incompleteness Theorems.Yong Cheng - 2021 - Bulletin of Symbolic Logic 27 (2):113-167.
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.
Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results.Andreas Weiermann - 2005 - Annals of Pure and Applied Logic 136 (1):189-218.
Partition theorems and computability theory.Joseph R. Mileti - 2005 - Bulletin of Symbolic Logic 11 (3):411-427.
References found in this work
A mathematical incompleteness in Peano arithmetic.Jeff Paris & Leo Harrington - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 90--1133.
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I.K. Gödel - 1931 - Monatshefte für Mathematik 38 (1):173--198.
Initial Segments of Models of Peano's Axioms.L. A. S. Kirby, J. B. Paris, A. Lachlan, M. Srebrny & A. Zarach - 1983 - Journal of Symbolic Logic 48 (2):482-483.
On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
Some independence results for peano arithmetic.J. B. Paris - 1978 - Journal of Symbolic Logic 43 (4):725-731.
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-559df78dcc-45kst uwo