Erwin Engeler

According to our database1, Erwin Engeler authored at least 21 papers between 1967 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Awards

ACM Fellow

ACM Fellow 1995, "Erwin Engeler is honored for his pioneering work on the interrelations between logic, computer science and scientific computation.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Neural algebra on "how does the brain think?".
Theor. Comput. Sci., 2019

A Forgotten Theory of Proofs ?
Log. Methods Comput. Sci., 2019

2015
Formal Universes.
Proceedings of the Logic, Rewriting, and Concurrency, 2015

2008
Neural Algebra and Consciousness: A Theory of Structural Functionality in Neural Nets.
Proceedings of the Algebraic Biology, Third International Conference, 2008

1995
Preface: Special Issue of Papers from the Conference on Proof Theory, Provability Logic, and Computation, Berne, Switzerland, 20-24 March 1994.
Ann. Pure Appl. Log., 1995

1993
Algorithmic properties of structures - selected papers of Erwin Engeler.
World Scientific, ISBN: 978-981-02-0872-1, 1993

1990
Combinatory Differential Fields.
Theor. Comput. Sci., 1990

1988
Berechnungstheorie für Informatiker.
Leitfäden und Monographien der Informatik, Teubner, ISBN: 978-3-519-02258-9, 1988

1987
Goals and design considerations for a mathematical laboratory.
SIGSAM Bull., 1987

Modelling of Cooperative Processes.
Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1986
Logic and Computation (Panel).
Proceedings of the Information Processing 86, 1986

1985
Scientific Computation: The Integration of Symbolic, Numeric and Graphic Computation.
Proceedings of the EUROCAL '85, 1985

1983
Equation in Combinatory Algebras.
Proceedings of the Logics of Programs, 1983

1981
Generalized Galois Theory and its Application to Complexity.
Theor. Comput. Sci., 1981

1977
A New Type of Models of Computation.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

1973
Towards a Galois Theory of Algorithmic Problems.
Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

On the structure of algorithmic problems.
Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973

1972
The logic of "can do".
Proceedings of the International Sympoisum on Theoretical Programming, 1972

1971
Structure and meaning of elementary programs.
Proceedings of the Symposium on Semantics of Algorithmic Languages, 1971

Algorithmic Approximations.
J. Comput. Syst. Sci., 1971

1967
Algorithmic Properties of Structures.
Math. Syst. Theory, 1967


  Loading...