George Boolos
Affiliations: | 1995 | Massachusetts Institute of Technology, Cambridge, MA, United States |
Google:
"George Boolos"Parents
Sign in to add mentor| Hilary Whitehall Putnam | grad student | 1966 | MIT | |
| (The Hierarchy of Constructible Sets of Integers) | ||||
Children
Sign in to add trainee| Richard G. Heck | grad student | MIT | |
| Zoltan G. Szabo | grad student | 1995 | MIT |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Scowcroft P, Boolos G. (1999) The Logic of Provability. The Journal of Philosophy. 96: 50-53 |
| Boolos G. (1997) Constructing cantorian counterexamples Journal of Philosophical Logic. 26: 237-239 |
| Boolos G. (1996) The Hardest Logic Puzzle Ever The Harvard Review of Philosophy. 6: 62-65 |
| Boolos G. (1995) Frege's Theorem and the Peano Postulates The Bulletin of Symbolic Logic. 1: 317-326 |
| Boolos G. (1994) Gödel's second incompleteness theorem explained in words of one syllable Mind. 103: 1-3 |
| Boolos G, Clark P. (1993) Basic Law (V) Aristotelian Society Supplementary Volume. 67: 213-249 |
| Boolos G. (1993) The analytical completeness of Dzhaparidze's polymodal logics Annals of Pure and Applied Logic. 61: 95-111 |
| Boolos G, Sambin G. (1985) An incomplete system of modal logic Journal of Philosophical Logic. 14: 351-358 |
| Boolos G. (1982) Extremely Undecidable Sentences Journal of Symbolic Logic. 47: 191-196 |
| Boolos G. (1980) Provability in arithmetic and a schema of Grzegorczyk Fundamenta Mathematicae. 106: 41-45 |