Results for 'Erwin Engeler'

(not author) ( search as author name )
1000+ found
Order:
  1.  8
    Metamathematik der Elementarmathematik.Erwin Engeler - 1983 - New York: Springer Verlag.
  2.  22
    Preface.Sergei Artemov, George Boolos, Erwin Engeler, Solomon Feferman, Gerhard Jäger & Albert Visser - 1995 - Annals of Pure and Applied Logic 75 (1-2):1.
  3.  32
    Aquivalenzklassen von n-Tupeln.G. Fuhrken & Erwin Engeler - 1966 - Journal of Symbolic Logic 31 (3):504.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  4.  7
    [Omnibus Review].Erwin Engeler - 1967 - Journal of Symbolic Logic 32 (2):280-281.
  5.  13
    Eine Konstruktion von Modellerweiterungen.Erwin Engeler - 1959 - Mathematical Logic Quarterly 5 (7‐13):126-131.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  6.  31
    Eine Konstruktion von Modellerweiterungen.Erwin Engeler - 1959 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (7-13):126-131.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  7.  18
    On the problem of foundations of category theory.Erwin Engeler & Helmut Röhrl - 1969 - Dialectica 23 (1):58-66.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  8.  13
    The combinatory programme.Erwin Engeler (ed.) - 1995 - Boston: Birkhäuser.
    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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  9.  22
    Äquivalenzklassen von n‐Tupeln.Erwin Engeler - 1959 - Mathematical Logic Quarterly 5 (14-24):340-345.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  10.  12
    Äquivalenzklassen von n‐Tupeln.Erwin Engeler - 1959 - Mathematical Logic Quarterly 5 (14‐24):340-345.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  11.  10
    An Algebraization of Hierarchical and Recursive Distributed Processes.Erwin Engeler & Gerhard Schwärzler - 1995 - In The Combinatory Programme. Birkhäuser. pp. 58--76.
    Direct download  
     
    Export citation  
     
    Bookmark  
  12.  34
    A. H. Lightstone and A. Robinson. On the representation of Herbrand functions in algebraically closed fields. The journal of symbolic logic, vol. 22 , pp. 187–204.Erwin Engeler - 1970 - Journal of Symbolic Logic 35 (1):148-149.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  13.  36
    Another Proof of Takeuti's Theorems on Skolem's Paradox.Erwin Engeler & Shoji Maehara - 1966 - Journal of Symbolic Logic 31 (4):659.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  14.  1
    Die Skepsis der Mathematiker gegenüber der Grundlagenrhetorik – Kommentar zum Beitrag von Hans Poser.Erwin Engeler - 1988 - In Paul Hoyningen-Huene & Gertrude Hirsch (eds.), Wozu Wissenschaftsphilosophie?: Positionen und Fragen zur gegenwärtigen Wissenschaftsphilosophie. New York: Walter de Gruyter. pp. 310-314.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  15.  8
    Formal Languages: Automata and Structures.Erwin Engeler - 1970 - Journal of Symbolic Logic 35 (4):594-595.
  16.  15
    Geometry and language.Erwin Engeler - 1970 - Dialectica 24 (1‐3):77-85.
    Direct download  
     
    Export citation  
     
    Bookmark  
  17.  14
    Historical and Philosophical Background.Erwin Engeler - 1995 - In The Combinatory Programme. Birkhäuser. pp. 1--12.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  18.  2
    Logic of Programs: Proceedings from a Workshop, ETH Zürich, May-July 1979.Erwin Engeler & Eidgenössische Technische Hochschule Zürich - 1981
    Direct download  
     
    Export citation  
     
    Bookmark  
  19.  43
    Shôji Maehara. Remark on Skolem's theorem concerning the impossibility of characterization of the natural number sequence. Proceedings of the Japan Academy, vol. 33 , pp. 588–590.Erwin Engeler - 1966 - Journal of Symbolic Logic 31 (4):659.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  20.  15
    Unendliche Formeln in Der Modelltheorie.Erwin Engeler - 1961 - Mathematical Logic Quarterly 7 (7‐10):154-160.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  21.  33
    Unendliche Formeln in Der Modelltheorie.Erwin Engeler - 1961 - Mathematical Logic Quarterly 7 (7-10):154-160.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22.  3
    Zur Beweistheorie Von Sprachen Mit Unendlich Langen Formeln.Erwin Engeler - 1961 - Mathematical Logic Quarterly 7 (11‐14):213-218.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  23.  30
    Zur Beweistheorie Von Sprachen Mit Unendlich Langen Formeln.Erwin Engeler - 1961 - Mathematical Logic Quarterly 7 (11-14):213-218.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24.  5
    Zur Beweistheorie von Sprachen mit Unendlich Langen Formela.Erwin Engeler - 1971 - Journal of Symbolic Logic 36 (4):685-685.
    Direct download  
     
    Export citation  
     
    Bookmark  
  25.  26
    Zum logischen Werk von Paul Bernays.Erwin Engeler - 1978 - Dialectica 32 (3‐4):191-200.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  26.  35
    Denumerable Models of Complete Theories.R. L. Vaught, Lars Svenonius, Erwin Engeler & Gebhard Fukrken - 1970 - Journal of Symbolic Logic 35 (2):342-344.
  27.  33
    Roland Fraïssé. Sur l'extension aux relations de quelques propriétés des ordres. Annales scientifiques de l'École Normale Supérieure, ser. 3 vol. 71 no. 4 , pp. 363–388. - René de Possel and Roland Fraïssé. Sur certaines suites d'équivalences dans une classe ordonnée, et sur leur application à la définition des parentés entre relations. Comptes rendus hebdomadaires des séances de l'Académie des Sciences, vol. 239 , pp. 940–942. - Roland Fraïssé. Sur certains opérateurs dans les classes de relations. Comptes rendus hebdomadaires des séances de l'Académie des Sciences, vol. 240 , pp. 2109–2110. - Roland Fraïssé. La construction des γ-opérateurs et leur application au calcul logique du premier ordre. Comptes rendus hebdomadaires des séances de l'Académie des Sciences, vol. 240 , pp. 2191–2193. - Roland Fraïssé. Sur quelques classifications des relations, basées sur des isomorphismes restreints. I. Étude générale. Publications scientifiques de l'Université d'Alger, série A, Mathématiques,. [REVIEW]Erwin Engeler - 1967 - Journal of Symbolic Logic 32 (2):280-281.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  28.  15
    Ehrenfeucht A.. An application of gaṁes to the completeness problem for formalized theories. Fundamenta mathematicae, vol. 49 , pp. 129–141. [REVIEW]Erwin Engeler - 1967 - Journal of Symbolic Logic 32 (2):281-282.
  29.  19
    E. G. K. Lopez-Escobar. An interpolation theorem for denumerably long formulas. Fundamenta mathematicae, vol. 57 no. 3 (1965), 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 (1965), pp. 383–388. [REVIEW]Erwin Engeler - 1969 - Journal of Symbolic Logic 34 (2):301-302.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  30.  21
    Feferman Solomon. Some recent work of Ehrenfeucht and Fraïssé. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 201–209. [REVIEW]Erwin Engeler - 1967 - Journal of Symbolic Logic 32 (2):282-282.
  31.  25
    Maehara 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]Erwin Engeler - 1962 - Journal of Symbolic Logic 27 (4):468-468.
  32.  14
    Review: A. Ehrenfeucht, An Application of Games to the Completeness Problem for Formalized Theories. [REVIEW]Erwin Engeler - 1967 - Journal of Symbolic Logic 32 (2):281-282.
  33.  14
    Review: 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]Erwin Engeler - 1969 - Journal of Symbolic Logic 34 (2):301-302.
  34.  17
    Review: Hans Hermes, Einfuhrung in die Mathematische Logik. Klassische Pradikatenlogik. [REVIEW]Erwin Engeler - 1973 - Journal of Symbolic Logic 38 (3):518-519.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  35.  17
    Review: Solomon Feferman, Some Recent Work of Ehrenfeucht and Fraisse. [REVIEW]Erwin Engeler - 1967 - Journal of Symbolic Logic 32 (2):282-282.
  36.  15
    Review: Shoji Maehara, Gaisi Takeuti, A Formal System of First-Order Predicate Calculus with Infinitely Long Expressions. [REVIEW]Erwin Engeler - 1962 - Journal of Symbolic Logic 27 (4):468-468.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37.  35
    Shôji Maehara. Another proof of Takeuti's theorems on Skolem's paradox. Journal of the Faculty of Science, University of Tokyo, section I, vol. 7 part 5 , pp. 541–556. [REVIEW]Erwin Engeler - 1966 - Journal of Symbolic Logic 31 (4):659-659.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  38.  12
    Erwin Engeler. Algorithmic approximations. Journal of computer and system sciences, vol. 5 , pp. 67–82.R. M. Burstall - 1974 - Journal of Symbolic Logic 39 (2):348.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  39.  10
    Erwin Engeler. Algorithmic properties of structures. Mathematical systems theory, vol. 1 , pp. 183–195.Ann S. Ferebee - 1972 - Journal of Symbolic Logic 37 (1):197.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  40.  13
    Erwin Engeler. A reduction-principle for infinite formulas. Mathematische Annalen, vol. 151 , pp. 296–301.Carol Karp - 1968 - Journal of Symbolic Logic 33 (1):123.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  41.  8
    Review: Erwin Engeler, Algorithmic Approximations. [REVIEW]R. M. Burstall - 1974 - Journal of Symbolic Logic 39 (2):348-348.
  42.  9
    Review: Erwin Engeler, Algorithmic Properties of Structures. [REVIEW]Ann S. Ferebee - 1972 - Journal of Symbolic Logic 37 (1):197-197.
  43.  8
    Review: Erwin Engeler, A Reduction-Principle for Infinite Formulas. [REVIEW]Carol Karp - 1968 - Journal of Symbolic Logic 33 (1):123-123.
  44.  15
    Erwin Engeler. Äquivalenzklassen von n-Tupeln. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 , pp. 340–345. [REVIEW]G. Fuhrken - 1966 - Journal of Symbolic Logic 31 (3):504-504.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45.  30
    Erwin Engeler. The combinatory programme. In collaboration with K. Aberer, B. Amrhein, O. Gloor, M. von Mohrenschildt, D. Otth, G. Schwärzler, and T. Weibel. Progress in theoretical computer science, no. 15. Birkhäuser, Boston, Basel, and Berlin, 1995, vii + 143 pp. [REVIEW]James Davenport - 1996 - Journal of Symbolic Logic 61 (2):696-697.
  46.  29
    Review: Erwin Engeler, K. Aberer, B. Amrhein, O. Gloor, M. von Mohrenschildt, D. Otth, G. Schwarzler, T. Weibel, The Combinatory Programme. [REVIEW]James Davenport - 1996 - Journal of Symbolic Logic 61 (2):696-697.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  47.  25
    Erwin Engeler and Peter Läuchli. Berechnungstheorie für Informatiker. With assistance from Ronald Peikert. Leitfäden und Monographien der Informatik. B. G. Teubner, Stuttgart1988, 120 pp. - Arnold Oberschelp. Rekursionstheorie. B. I. Wissenschaftsverlag, Mannheim, Leipzig, Vienna, and Zürich, 1993, 339 pp. - Walter Felscher. Berechenbarkeit. Rekursive und programmierbare Funktionen. Springer-Lehrbuch. Springer-Verlag, Berlin, Heidelberg, New York, etc., 1993, xi + 478 pp. [REVIEW]Petr Hájek - 1996 - Journal of Symbolic Logic 61 (2):699-701.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  48.  18
    Engeler Erwin. Zur Beweistheorie von Sprachen mit unendlich langen Formeln. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 213–218. [REVIEW]E. G. K. Lopez-Escobar - 1971 - Journal of Symbolic Logic 36 (4):685-685.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  49.  30
    Engeler Erwin. Formal languages: Automata and structures. Markham Publishing Company, Chicago 1968, vii + 81 pp. [REVIEW]Andrzej Blikle - 1970 - Journal of Symbolic Logic 35 (4):594-595.
  50.  12
    Vaught R. L.. Denumerable models of complete theories. Infinitistic methods, Proceedings of the Symposium on Foundations of Mathematics, Warsaw, 2–9 September, 1959, Państwowe Wydawnictwo Naukowe, Warsaw, and Pergamon Press, Oxford, London, New York, and Paris, 1961, pp. 303–321.Svenonius Lars. On minimal models of first-order systems. Theoria , vol. 26 , pp. 44–52.Engeler Erwin. Unendliche Formeln in der Modell-theorie. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 154–160.Fuhrken Gebhard. Bemerkung zu einer Arbeit E. Engelers. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 8 , pp. 277–279. [REVIEW]H. Jerome Keisler - 1970 - Journal of Symbolic Logic 35 (2):342-344.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000