-
26
-
12Historical and Philosophical BackgroundIn The Combinatory Programme, Birkhäuser. pp. 1--12. 1995.
-
28Eine Konstruktion von ModellerweiterungenZeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (7-13): 126-131. 1959.
-
28Zur Beweistheorie Von Sprachen Mit Unendlich Langen FormelnZeitschrift fur mathematische Logik und Grundlagen der Mathematik 7 (11-14): 213-218. 1961.
-
4Zur Beweistheorie von Sprachen mit Unendlich Langen FormelaJournal of Symbolic Logic 36 (4): 685-685. 1971.
-
2Zur Beweistheorie Von Sprachen Mit Unendlich Langen FormelnMathematical Logic Quarterly 7 (11‐14): 213-218. 1961.
-
2
-
27Unendliche Formeln in Der ModelltheorieZeitschrift fur mathematische Logik und Grundlagen der Mathematik 7 (7-10): 154-160. 1961.
-
9The Combinatory Programme (edited book)Birkhäuser. 1994.Combinatory logic started as a programme in the foundation of mathematics and in an historical context at a time when such endeavours attracted the most gifted among the mathematicians. This small volume arose under quite differ ent circumstances, namely within the context of reworking the mathematical foundations of computer science. I have been very lucky in finding gifted students who agreed to work with me and chose, for their Ph. D. theses, subjects that arose from my own attempts 1 to crea…Read more
-
8Review: E. G. K. Lopez-Escobar, An Interpolation Theorem for Denumerably Long Formulas; E. G. K. Lopez-Escobar, Universal Formulas in the Infinitary Language $L_{alpha beta}$ (review)Journal of Symbolic Logic 34 (2): 301-302. 1969.
-
9Review: Hans Hermes, Einfuhrung in die Mathematische Logik. Klassische Pradikatenlogik (review)Journal of Symbolic Logic 38 (3): 518-519. 1973.
-
9Review: H. P. Barendregt, The Lambda Calculus. Its Syntax and Semantics (review)Journal of Symbolic Logic 49 (1): 301-303. 1984.
-
3Review: A. Salwicki, Formalized Algorithmic Languages; A. Salwicki, On the Equivalence of FS-Expressions and Programs; A. Salwicki, On the Predicate Calculi with Iteration Quantifiers (review)Journal of Symbolic Logic 39 (2): 349-350. 1974.
-
21Äquivalenzklassen vonn-TupelnZeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (14-24): 340-345. 1959.
-
11Review: A. Ehrenfeucht, An Application of Games to the Completeness Problem for Formalized Theories (review)Journal of Symbolic Logic 32 (2): 281-282. 1967.
-
17Maehara Shôji and Takeuti Gaisi. A formal system of first-order predicate calculus with infinitely long expressions. Journal of the Mathematical Society of Japan, vol. 13 , pp. 357–370 (review)Journal of Symbolic Logic 27 (4): 468-468. 1962.
-
11Mirkowska G. and Salwicki A.. Algorithmic logic. D. Reidel Publishing Company, Dordrecht etc., and PWN-Polish Scientific Publishers, Warsaw, 1987, xi+ 372 pp (review)Journal of Symbolic Logic 54 (3): 1105-1106. 1989.
-
13E. G. K. Lopez-Escobar. An interpolation theorem for denumerably long formulas. Fundamenta mathematicae, vol. 57 no. 3 , pp. 253–257. - E. G. K. Lopez-Escobar. Universal formulas in the infinitary language Lαβ. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 13 , pp. 383–388 (review)Journal of Symbolic Logic 34 (2): 301-302. 1969.
-
21Barendregt H. P.. The lambda calculus. Its syntax and semantics. Studies in logic and foundations of mathematics, vol. 103. North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1981, xiv + 615 pp (review)Journal of Symbolic Logic 49 (1): 301-303. 1984.
-
7An Algebraization of Hierarchical and Recursive Distributed ProcessesIn The Combinatory Programme, Birkhäuser. pp. 58--76. 1995.
Areas of Specialization
Science, Logic, and Mathematics |
Areas of Interest
Science, Logic, and Mathematics |