• Monadic Elementary Formal Systems
    Mathematical Logic Quarterly 7 (6): 81-83. 2006.
  • Theories with Effectively Inseparable Nuclei
    Mathematical Logic Quarterly 6 (15‐22): 219-224. 2006.
  • Undecidability and recursive inseparability†
    Mathematical Logic Quarterly 4 (7‐11): 143-147. 2006.
  •  33
    Bibliography of Raymond Smullyan
    In Brian Rayman & Melvin Fitting (eds.), Raymond Smullyan on Self Reference, Springer Verlag. pp. 191-195. 2017.
    Raymond Smullyan’s Books and Papers.
  •  39
    To Mock a Mockingbird: and Other Logic Puzzles
    Oxford University Press. 2000.
    In this entertaining and challenging collection of logic puzzles, Raymond Smullyan-author of Forever Undecided-continues to delight and astonish us with his gift for making available, in the thoroughly pleasurable form of puzzles, some of the most important mathematical thinking of our time.
  •  59
    A beginner's guide to mathematical logic
    Dover Publications. 2014.
    Written by a creative master of mathematical logic, this introductory text combines stories of great philosophers, quotations, and riddles with the fundamentals of mathematical logic. Author Raymond Smullyan offers clear, incremental presentations of difficult logic concepts. He highlights each subject with inventive explanations and unique problems. Smullyan's accessible narrative provides memorable examples of concepts related to proofs, propositional logic and first-order logic, incompletenes…Read more
  •  64
    At the turn of the century, there appeared two comprehensive mathematical systems, which were indeed so vast that it was taken for granted that all mathematics could be decided on the basis of them. However, in 1931, Kurt Gödel surprised the entire mathematical world with his epoch‐making paper which begins with the following startling words: The development of mathematics in the direction of greater precision has led to large areas of it being formalized, so that proofs can be carried out accor…Read more
  •  24
    More on propositional and first-order logic -- More on propositional logic -- More on first-order logic -- Recursion theory and metamathematics -- Some special topics -- Elementary formal systems and recursive enumerability -- Some recursion theory -- Doubling up -- Metamathematical applications -- Elements of combinatory logic -- Beginning combinatory logic -- Combinatorics galore -- Sages, oracles, and doublets -- Complete and partial systems -- Combinators, recursion, and the undecidable -- W…Read more
  •  52
    Theory of Formal Systems
    Princeton University Press. 1961.
    This book serves both as a completely self-contained introduction and as an exposition of new results in the field of recursive function theory and its application to formal systems.
  •  58
    Languages in Which Self Reference is Possible
    Journal of Symbolic Logic 24 (3): 228-228. 1959.
  •  25
    On Post's Canonical Systems
    Journal of Symbolic Logic 33 (4): 623-623. 1968.
  •  18
    Um dualista desafortunado
    Critica -. 2006.
  •  410
    Meeting of the association for symbolic logic
    with James K. Feibleman and R. L. Vaught
    Journal of Symbolic Logic 35 (2): 352-363. 1970.
  •  69
    Theory of Formal Systems
    Journal of Symbolic Logic 30 (1): 88-90. 1965.
  •  156
    Analytic cut
    Journal of Symbolic Logic 33 (4): 560-564. 1968.
  •  113
    Some new double analogues of induction and transfinite recursion are given which yields a relatively simple proof of a result of Robert Cowen, [2] which in turn is a strengthening of an earlier result of Smullyan [1], which in turn gives a unified approach to Zorn's Lemma, the transfinite recursion theorem and certain results about ordinal numbers.
  •  77
    Monadic Elementary Formal Systems
    Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 7 (6): 81-83. 1961.
  •  50
    Elementary Formal Systems
    Journal of Symbolic Logic 34 (1): 117-117. 1969.
  •  150
    Uniform Gentzen systems
    Journal of Symbolic Logic 33 (4): 549-559. 1968.
    Generally speaking, it appears correct to say that in a formulation of first order logic in which a large number of connectives are taken as primitive which allows us to have our cake and eat it too.
  •  165
    Analytic natural deduction
    Journal of Symbolic Logic 30 (2): 123-139. 1965.
  •  37
    Eighty paradoxes, logical lobyrinths, and intriguing enigmas progress from light fables and fancies to challenging Zen exercises and a novella and probe the timeless questions of philosophy and life.
  •  259
    Gödel's incompleteness theorems
    Oxford University Press. 1992.
    Kurt Godel, the greatest logician of our time, startled the world of mathematics in 1931 with his Theorem of Undecidability, which showed that some statements in mathematics are inherently "undecidable." His work on the completeness of logic, the incompleteness of number theory, and the consistency of the axiom of choice and the continuum theory brought him further worldwide fame. In this introductory volume, Raymond Smullyan, himself a well-known logician, guides the reader through the fascinat…Read more
  •  150
    Chameleonic languages
    Synthese 60 (2). 1984.
  •  86
    The tao is silent
    HarperSanFrancisco. 1992.
    The Tao Is Silent Is Raymond Smullyan's beguiling and whimsical guide to the meaning and value of eastern philosophy to westerners. "To me," Writes Smullyan, "Taoism means a state of inner serenity combined with an intense aesthetic awareness. Neither alone is adequate; a purely passive serenity is kind of dull, and an anxiety-ridden awareness is not very appealing." This is more than a book on Chinese philosophy. It is a series of ideas inspired by Taoism that treats a wide variety of subjects …Read more