Johann A. Makowsky (makowsky-j)

Contributi a Philosophie.ch

Bibliography

Kaminski, Michael, Makowsky, Johann A. and Tiomkin, Michael L. 1996. “Extensions for Open Default Theories via the Domain Closure Assumption.” in JELIA’96. Logics in Artificial Intelligence European Workshop, Evora, Portugal, September 30 – October 3, 1996, edited by José Júlio Alferes, J. A. Leite, Luı́s Moniz Pereira, Halina Przymusinska, and Teodor C. Przymusinski, pp. 373–387. Berlin: Springer.
Makowsky, Johann A. 1979. “The Reals Cannot Be Characterized Topologically with Strictly Local Properties and Countability Axioms.” in, pp. 251–258.
Makowsky, Johann A. 1982. “Model Theoretic Issues in Theoretical Computer Science, Part I: Relational Data Bases and Abstract Data Types.” in Logic Colloquium ’82 – Proceedings of the Colloquium Held in Florence 23–28 August, 1982, edited by Gabriele Lolli, Giuseppe Longo, and Annalisa Marcja, pp. 303–343. Studies in Logic and the Foundations of Mathematics n. 112. Amsterdam: North-Holland Publishing Co.
Makowsky, Johann A. 1985a. “Compactness, Embeddings and Definability.” in Model-Theoretic Logics, edited by Jon K. Barwise and Solomon Feferman, pp. 645–716. Perspectives in Mathematical Logic. Berlin: Springer.
Makowsky, Johann A. 1985b. “Abstract Embedding Relations.” in Model-Theoretic Logics, edited by Jon K. Barwise and Solomon Feferman, pp. 747–792. Perspectives in Mathematical Logic. Berlin: Springer.
Makowsky, Johann A. 1988. “Mental Images and the Architecture of Concepts.” in The Universal Turing Machine: A Half-Century Survey, edited by Rolf Herken, 1st ed., pp. 453–465. Oxford: Oxford University Press. Second edition: Herken (1995).
Makowsky, Johann A. 1992. “Model Theory and Computer Science: An Appetizer.” in Handbook of Logic in Computer Science. Volume 1. Background: Mathematical Structures, edited by Samson Abramsky, Dov M. Gabbay, and Thomas S. E. Maibaum, pp. 763–814. Oxford: Oxford University Press.
Makowsky, Johann A. 2008. “Encounters with A. Mostowski.” in Andrzej Mostowski and Foundational Studies, edited by Andrzej Ehrenfeucht, Wictor W. Marek, and Marian Srebrny, pp. 261–277. Amsterdam: IOS Press.
Makowsky, Johann A. 2011. “Generalizing Parikh’s Theorem.” in Games, Norms and Reasons. Logic at the Crossroads, edited by Johan van Benthem, Amitabha Gupta, and Eric Pacuit, pp. 163–178. Synthese Library n. 353. Dordrecht: Springer.
Makowsky, Johann A. and Mundici, Daniele. 1985. “Abstract Equivalence Relations.” in Model-Theoretic Logics, edited by Jon K. Barwise and Solomon Feferman, pp. 717–746. Perspectives in Mathematical Logic. Berlin: Springer.
Makowsky, Johann A. and Pnuelli, Yachan B. 1995. “Computable Quantifiers and Logics over Finite Structures.” in Quantifiers: Logic, Models, and Computation. Volume One: Surveys, edited by Michał Krynicki, Marcin Mostowski, and Lesław W. Szczerba, pp. 313–357. Synthese Library n. 248. Dordrecht: Kluwer Academic Publishers.
Makowsky, Johann A. and Ravve, Elena V., eds. 2017. Logic Colloquium ’95: Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, held in Haifa, Israel, August 9–18, 1995. Lecture Notes in Logic. Cambridge: Cambridge University Press, doi:10.1017/9781316716830.