- 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
Sets of theorems with short proofs
Journal of Symbolic Logic 39 (2):235-242 (1974)
Abstract
This article has no associated abstract. (fix it)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
Uniform Short Proofs for Classical Theorems.Kees Doets - 2001 - Notre Dame Journal of Formal Logic 42 (2):121-127.
An informal exposition of proofs of gödel's theorems and church's theorem.Barkley Rosser - 1939 - Journal of Symbolic Logic 4 (2):53-60.
Basis theorems for -sets.Chi Tat Chong, Liuzhen Wu & Liang Yu - 2019 - Journal of Symbolic Logic 84 (1):376-387.
Review: Barkley Rosser, An Informal Exposition of Proofs of Godel's Theorems and Church's Theorem. [REVIEW]Evert Beth - 1939 - Journal of Symbolic Logic 4 (4):165-165.
On the Consistency of some Theorems of the Descriptive Theory of Sets.P. S. Novikov - 1954 - Journal of Symbolic Logic 19 (2):123-125.
Some theorems on r-maximal sets and major subsets of recursively enumerable sets.Manuel Lerman - 1971 - Journal of Symbolic Logic 36 (2):193-215.
Games of countable length. Sets and Proofs. [REVIEW]Paul B. Larson - 2005 - Bulletin of Symbolic Logic 11 (4):542-544.
On the incompleteness theorems.Henryk Kotlarski - 1994 - Journal of Symbolic Logic 59 (4):1414-1419.
Embedding theorems for Boolean algebras and consistency results on ordinal definable sets.Petr Štěpánek & Bohuslav Balcar - 1977 - Journal of Symbolic Logic 42 (1):64-76.
Ramsey’s coheirs.Eugenio Colla & Domenico Zambella - 2022 - Journal of Symbolic Logic 87 (1):377-391.
Analytics
Added to PP
2009-01-28
Downloads
3 (#1,729,579)
6 months
17 (#161,763)
2009-01-28
Downloads
3 (#1,729,579)
6 months
17 (#161,763)
Historical graph of downloads
Citations of this work
The undecidability of k-provability.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 53 (1):75-102.
A unification-theoretic method for investigating the k-provability problem.William M. Farmer - 1991 - Annals of Pure and Applied Logic 51 (3):173-214.
Generalizing theorems in real closed fields.Matthias Baaz & Richard Zach - 1995 - Annals of Pure and Applied Logic 75 (1-2):3-23.
Bounds for proof-search and speed-up in the predicate calculus.Richard Statman - 1978 - Annals of Mathematical Logic 15 (3):225.
The undecidability of k-provability.Samuel Buss - 1991 - Annals of Pure and Applied Logic 53 (1):75-102.
References found in this work
The Foundations of Mathematics.Charles Parsons & Evert W. Beth - 1961 - Philosophical Review 70 (4):553.
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-68866f4b87-6mvtb uwo