#3,135

Most Influential Person

Philosopher and mathematical logician

According to Wikipedia, George Stephen Boolos was an American philosopher and a mathematical logician who taught at the Massachusetts Institute of Technology.Life Boolos is of Greek-Jewish descent. He graduated with an A.B. in mathematics from Princeton University after completing a senior thesis, titled "A simple proof of Gödel's first incompleteness theorem", under the supervision of Raymond Smullyan. Oxford University awarded him the B.Phil. in 1963. In 1966, he obtained the first PhD in philosophy ever awarded by the Massachusetts Institute of Technology, under the direction of Hilary Putnam. After teaching three years at Columbia University, he returned to MIT in 1969, where he spent the rest of his career.

- Computability and logic
- To Be Is to Be a Value of a Variable (or to Be Some Values of Some Variables)
- Self-Reference and Modal Logic
- The logic of provability
- Logic, Logic, and Logic
- The Iterative Conception of Set
- On ‘syllogistic inference’
- Computability and logic: 3rd ed.
- The Unprovability of Consistency: An Essay in Modal Logic
- What is the name of this book? : the riddle of Dracula and other logical puzzles
- Meaning and Method: Essays in Honor of Hilary Putnam
- On second-order logic
- Don't eliminate cut
- A curious inference
- Degrees of Unsolvability of Constructible Sets of Integers
- IX—Saving Frege from Contradiction
- Reading the Begriffsschrift
- Provability: the emergence of a mathematical modality
- Is Hume’s Principle Analytic?
- Between Logic and Intuition: Must We Believe in Set Theory?
- An incomplete system of modal logic
- Extremely Undecidable Sentences
- On “seeing” the truth of the Gödel sentence
- Computability and Logic: The Unprovability of Consistency
- The Hardest Logic Puzzle Ever
- BASIC LAW (V)
- The Degree of the Set of Sentences of Predicate Provability Logic that are True Under Every Interpretation
- Philosophy of mathematics: The iterative concept of set
- Frege's theorem and the Peano postulates
- Provability, truth, and modal logic
- On systems of modal logic with provability interpretations
- On Deciding the Truth of Certain Statements Involving the Notion of Consistency
- Trees and finite satisfiability: proof of a conjecture of Burgess
- Review: Robert M. Solovay, Provability Interpretations of Modal Logic
- Constructing Cantorian counterexamples
- Reflection Principles and Iterated Consistency Assertions
- Provability in arithmetic and a schema of Grzegorczyk
- Computability and logic (2. ed.)
- On the Semantics of the Constructible Levels
- Zooming Down the Slippery Slope
- Gödel's Second Incompleteness Theorem Explained in Words of One Syllable
- The Analytical Completeness of Dzhaparidze's Polymodal Logics
- Computability and Logic: Uncomputability
- Computability and Logic by George S. Boolos
- Omega-consistency and the diamond
- Review: J. R. Lucas, Minds, Machines and Godel; Paul Benacerraf, God, the Devil, and Godel
- Review: Yu. I. Manin, A Course in Mathematical Logic
- 6. Whence the Contradiction
- The Justification of Mathematical Induction
- Computability and Logic: Preface to the Fifth Edition
- On Kalmar's consistency proof and a generalization of the notion of ω-consistency
- On the Nonexistence of Certain Normal Forms in the Logic of Provability
- Manin Yu. I.. A course in mathematical logic. Translated from the Russian by Koblitz Neal. Graduate texts in mathematics, vol. 53. Springer-Verlag, New York, Heidelberg, and Berlin, 1977, xiii + 286 pp.
- Alphabetical order
- A proof of the Löwenheim-Skolem theorem
- Robert M. Solovay. Provability interpretations of modal logic. Israel journal of mathematics , vol. 25 (1976), pp. 287–304.
- Preface: Special Issue of Papers from the Conference on Proof Theory, Provability Logic, and Computation, Berne, Switzerland, 20-24 March 1994
- On Deciding the Provability of Certain Fixed Point Statements
- J. R. Lucas. Minds, machines and Gödel. Philosophy , vol. 36 (1961), pp. 112–127. - Paul Benacerraf. God, the devil, and Gödel. The Monist , vol. 51 (1967), pp. 9–32.
- 1-consistency and the Diamond
- Recursive Sets and Relations
- STATEMENTS INVOLVING THE NOTION OF CONSISTENCY
- Notation and symbols
- Review: V. A. Uspensky, Neal Koblitz, Godel's Incompleteness Theorem
- Computability and Logic: COMPUTABILITY THEORY
- REVIEWS-Articles in Logic, logic, and logic
- Erratum: Frege's Theorem and the Peano Postulates
- Hints for Selected Problems
- Computability and Logic: Nonstandard Models
- Computability and Logic: Ramsey's Theorem
- The Logic of Provability: An incomplete system of modal logic
- Computability and Logic: Abacus Computability
- Meeting of the Association for Symbolic Logic: New York 1979
- Review: J. R. Shoenfield, The Problem of Predicativity
- Modal Logic and Provability
- Semantics for GL and other modal logics
- Computability and Logic: Representability of Recursive Functions
- Computability and Logic: Arithmetical Definability
- Computability and Logic: Monadic and Dyadic Logic
- The Logic of Provability: Modal logic within analysis
- The Dreben Panel
- Arithmetical Functions and Minimalization
- Computability and Logic: Decidability of Arithmetic without Multiplication
- Logicism and Second-Order Logic
- Contents of volume 17
- Review: C. Smorynski, Self-Reference and Modal Logic
- Computability and Logic: The Craig Interpolation Theorem
- Thanks to our guest reviewers
- Computability and Logic: Turing Computability
- C. Smoryński. Self-reference and modal logic. Universitext. Springer-Verlag, New York, Berlin, etc., 1985, xii + 333 pp.
- Computability and Logic: Indefinability, Undecidability, Incompleteness
- A Précis of First-Order Logic: Semantics
- GL and other systems of propositional modal logic
- Quantified provability logic with one one-place predicate letter
- Mostowski Andrzej. On various degrees of constructivism. Constructivity in mathematics, Proceedings of the colloquium held at Amsterdam, 1957, edited by Heyting A., Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1959, pp. 178–194.
- Barwise Jon and Etchemendy John. Turing's world. Kinko's Academic Courseware Exchange, Santa Barbara 1986, viii + 68 pp. + disk.Barwise Jon and Etchemendy John. Tarski's world. Kinko's Academic Courseware Exchange, Santa Barbara 1987, vii + 85 pp. + disk.
- The Logic of Provability: The arithmetical completeness theorems for GL and GLS
- An S4-preserving proof-theoretical treatment of modality
- Review: Andrzej Mostowski, On Various Degrees of Constructivism
- Computability and Logic: The Existence of Models
- The Logic of Provability: The box as Bew( x )
- Computability and Logic: Diagonalization
- The Boolos Panel
- The Logic of Provability: Bibliography
- Computability and Logic: Modal Logic and Provability
- Computability and Logic: A Précis of First-Order Logic: Syntax
- Thanks to our guest reviewers
- The Logic of Provability: Frontmatter
- Computability and Logic: Annotated Bibliography
- Computability and Logic: BASIC METALOGIC
- The Logic of Provability: Preface
- The Logic of Provability: Quantified provability logic
- The fixed point theorem
- The Logic of Provability: Peano arithmetic
- The Logic of Provability: Completeness and decidability of GL and K, K4, T, B, S4, and S5
- Equivalent Definitions of Computability
- The Logic of Provability: Canonical models
- The Logic of Provability: The joint provability logic of consistency and ω-consistency
- On GLB: The fixed point theorem, letterless sentences, and analysis
- Computability and Logic: Recursive Functions
- Modal logic within set theory
- Computability and Logic: The Undecidability of First-Order Logic
- The Logic of Provability: Trees for GL
- Annual Meeting of the Association for Symbolic Logic: Boston 1983
- Computability and Logic: Proofs and Completeness

This paper list is powered by the following services:

George Boolos is affiliated with the following schools:

This website uses cookies to enhance the user experience. Privacy Policy

Stay informed! Get the latest Academic Influence news, information, and rankings with our upcoming newsletter.