Erwin Engeler - Publications#

• Untersuchungen zur Modelltheorie. Diss. ETH (1958).
• Aequivalenzklassen von n -Tupeln. Z. Math. Logik Grundl. Math. 5 (1959) 340-345.
• Eine Konstruktion von Modellerweiterungen. Z. Math. Logik Grundl. Math. 5 (1959) 126-131.
• Unendliche Formeln in der Modelltheorie. Z. Math. Logik Grundl. Math. 7 (1961) 154-160.
• Zur Beweistheorie von Sprachen mit unendlich langen Formeln. Z. Math. Logik Grundl. Math. 7 (1961) 213-218.
• A reduction principle for infinite formulas. Mathem. Annalen 151 (1963) 296-303.

• Models with prescribed second-order properties. J. Symbolic Logic 37 (1962) 476.
• Combinatorial theorems for the construction of models. In: The Theory of Models. Proc. 1963 Int. Symp., eds J.W. Addison et al. (North-Holland: Amsterdam, l965) pp. 77-88.
• Categories of mapping filters. In: Conf. Categorical Algebra, eds S. Eilenberg et al. (Springer: New York, 1966) pp. 247-253.
• On structures defined by mapping filters. Math. Annalen 167 (1966) 105-112.
• On the structure of elementary maps. Z. Math. Logik u. Grundl. d. Math. 13 (1967) 323-328.
• (with H. Röhrl) On the problem of foundations of category theory. Dialectica 23 (1969) 58-66.

• Algorithmic properties of structures. Math. Systems Theory 1 (1967) 183-195.
• Formal Languages: Automata and Structures. (Markham: Chicago 1968) 81 pp.
• Remarks on the theory of geometrical constructions. In: Syntax & Semantics of Inf. Lang., ed. J. Barwise, Springer Lecture Notes in Mathematics 72, (Springer: New York, 1968) 64-76.
• Proof theory and the accuracy of computations. In: Symp. Automatic Demonstr., eds M. Laudet et al.), Springer Lecture Notes in Mathematics 125 (Springer: New York 1970) 62-72.
• Algorithmic approximations. J. Comp. Systems Sci. 5 (1971) 67-82
• Structure and meaning of elementary programs. (ed) Symposium on Semantics of Algor. Languages, Springer Lecture Notes in Mathematics 188 (Springer: New York, 1971) 89-101.
• Introduction to the theory of computation. (Academic Press: New York, 1973), 231 pp. (Transl. into Japanese 1975).
• The logic of "can do", Logic of Programming. In: Int. Symp. on Theoretical Computer Science eds A. Ershov et al., Springer Lecture Notes in Computer Science 5, (1974) 17-28.
• Algorithmic logic. Math. Center Tracts 63 (1975) 57-85.
• (ed) Logic of Programs. Springer Lecture Notes in Computer Science 125 (Springer: New York, 1981).
• Logic in Computer Science. In: Information Processing 86 ed. H.J. Kugler (North-Holland, Amsterdam, 1986), 393.

• On the structure of algorithmic problems. GI Fachtagung über Automatentheorie und formale Sprachen. Springer Lecture Notes in Computer Science 2 (Springer: New York, 1973) 2-15.
• Towards a Galois theory of algorithmic problems. Math. Found. of Comp. Sc. (eds J. Becvar et al.), Slovac Academy of Science: 1973) 51-55.
• On the solvability of algorithmic problems. Logic Colloquium 73 eds H.E. Rose et al. (North-Holland, Amsterdam, 1975) 231-251.
• Lower bounds by Galois theory. Asterisque 38 (1976) 45-52.
• Structural relations between programs and problems. Int. Congr. Logic Math. & Phil. Sci. London Ont 1975, Logic, Found. of Math. and Computability, eds Butts et al., (Reidel: Dordrecht, 1977) 267-280.
• Generalized Galois theory and its application to complexity. Theoret. Comput. Sci. 13 (1981) 271-293.

• Geometry and language. Dialectica 24 (1970) 77-85.
• Metamathematik der Elementarmathematik (Springer: New York, 1983) 132 pp.
• English Translation: Foundations of Mathematics (Springer, 1993) 100 pp.
• (Transl. into Russian 1987, Transl. into Chinese 1995).
• Zum logischen Werk von Paul Bernays. Dialectica 32 (1978) 191-200.
• An algorithmic model of strict finitism. Colloq. Math. J. Bolyai (1978) 345-357.
• Die Skepsis der Mathematiker gegenüber der Grundlagenrhetorik. In: Wozu Wissenschaftsphilosophie? eds P. Hoyningen-Huene et al. (de Gruyter, 1988) 310-313.
• Zur wissenschaftstheoretischen Bedeutung der kombinatorischen Algebra. In: Jahrbuch der Kurt Goedel Gesellschaft, (Wien 1990) pp. 45-53.
• The technical problem of "full abstractness" as a model for an issue in reductionism. In: The Problem of Symposium on Reductionism in Science ed. E. Agazzi (Kluwer, 1991) 91-99.
• Existenz und Negation. In: Jahrbuch der Kurt Goedel Gesellschaft, (Wien 1994), pp. 37-53. (PDF)

• A new type of models of computation. Math. Found. Comp. Sci. ed J. Gruska, Springer Lecture Notes in Computer Science 53 (Springer: New York, 1977) 52-58.
• Formal models of computation in which data are processes: theory and applications. Int. Conf. Math. Stud. Info. Proc. Kyoto (1978) 541-558.
• Algebras and combinators. Algebra Universals 13 (1981) 389-392.
• Equations in combinatory algebras. In: Logics of Programs eds E. Clarke et al., Springer Lecture Notes in Computer Science 164 (Springer: New York, 1984) 193-205.
• Modelling of cooperative processes. In: Comput. Theory and Logic ed. E. Böger. Springer Lecture Notes in Computer Science 270 (Springer: New York, 1987) 143-153.
• Cumulative type logic programs and modelling. J. of Symbolic Logic 52 (1987) 1059.
• Cumulative logic programs and modelling. In: Logic Colloquium 1986 eds F.R. Drake et al. (North-Holland, Amsterdam, 1988) 83-93.
• Modelling interacting intelligent systems in the legal context. Neue Methoden im Recht 5 (Attempto Verlag Tübingen 1989), pp. 73-79.
• Representation of varieties in combinatory algebras. Algebra Universalis 25 (1988) 85-95.
• Sketch of a new discipline of modelling. Computer Mathematics. Proc. 0f the Special Program at Nankai Institute of Mathematics (1991) 66-76.
• Combinatory differential fields. Theoretical Computer Science 72 (1990) 119-131.
• Algorithmic Properties of Structures Selected papers of E. Engeler. World Publ. Co., 1994
• The Combinatory Programme (with K. Aberer et al.) Birkhäuser Boston, 1995, 143 pp. (View the introduction in Postscript or PDF format.)
• Computing Aspects of Set Theory (Postscript, PDF). In: Logic and Software Engineering, eds. A. Pnueli and H. Lin (World Scientific, Singapore 1996) pp. 122-126.

• (With A.P. Speiser) Zur Analogie zwischen einer elektronischen Rechenmaschine und dem Gehirn. Vierteljahresschr. d. Natf. Gesellsch. in Zürich 109 (1958) 81-84.
• The Neural Net of the Tapeworm Turingia universalis Wolfram. (PDF)
• Neural Algebra and Consciousness: A Theory of Structural Functionality in Neural Nets. K. Horimoto et al. (Eds.): Algebraic Biology 2008, LNCS 5147, pp. 96-109, 2008. © Springer-Verlag Berlin Heidelberg 2008. (PDF)
• Algebras of the Brain. (Manuscript, March 2010) (PDF)

• Analogie-Rechengerät ARZ. Anleitung. (Guettinger: Niederteufen, 1956) 20 pp.
• Über die Monte-Carlo Methode. Mitt. Schweiz. Vers.-math. 58 (1958) 67-76.
• Lineares Programmieren. Mitteilungsblatt Nr. 4 (Guettinger: Niederteufen, 1958) 10 pp.
• Über elektr. Analogierechenanlagen für chem. & biol. Vorgänge. Jahrbuch Chem. Industrie 1958/59, 92-95.
• (With R. Maeder) Scientific Computation: The integration of symbolic, numeric and graphic computation. In: Eurocal '85 ed. B. Buchberger, Springer Lecture Notes in Computer Science 203 (Springer: New York, 1985) 185-200.
• Goals and design considerations for a mathematical laboratory. SIGSAM Bulletin 21 (1987) 7-8.
• Grenzen - des Computers? (Introduction to) Grenzen des Computers ed. C. Schnell (Sauer 1991).
• Wie die Mathematik zum Computer kam (PDF). Abschiedsvorlesung ETH Zürich, 10. Dez. 1996.
• Forschungspolitik und akademische Privatinitiative. Festschrift Urs Hochstrasser, 1996, pp. 56-60.