Mathematical logic and its application to the foundations of computer science define the career of Johann A. Makowsky. Born in Hungary in 1948 and later gaining Swiss citizenship, he pursued rigorous academic training at ETH Zurich. His professional path navigated international research landscapes, influencing fields ranging from model theory and graph algorithms to database complexity and logic programming.
Academic Formation
Makowsky enrolled at ETH Zurich in 1967, completing his studies by 1971. Under the supervision of Ernst Specker and Hans Läuchli, he developed a foundation in mathematical logic. His education extended beyond Switzerland, as he spent 1972 in Warsaw working with Andrzej Mostowski and Witek Marek. He also engaged with the teachings of Beno Eckmann in topology and geometry, alongside Volker Strassen for algorithmics, eventually earning his Dr. math.sc. in 1974.
Research and Professional Tenure
His career encompasses numerous visiting positions across global institutions, including Stanford University, Simon Fraser University, the University of Florence, and Lausanne University. He held permanent academic roles at the Free University of Berlin and the Technion – Israel Institute of Technology in Haifa, where he served as a full professor. Since 2016, he has held the title of Professor Emeritus at the Technion, maintaining his engagement in research and graduate student supervision.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →Contributions to Logic and Computing
Makowsky produced significant results in model theory, specifically regarding categoricity theory and the properties of interpolation and compactness alongside Saharon Shelah and Jonathan Stavi. His work in database theory identified the first undecidability results for consequence problems related to dependencies, alongside Ashok Chandra and Harry Lewis. Additionally, he collaborated on unifying entity–relationship models with relational models, and studied the complexity of Horn formulas.
Graph Theory and Professional Service
In the realm of graph algorithms, he developed a model-theoretic approach to tree-width and clique-width. This research contributed to a general theory of graph polynomials and their definability within logical formalisms. Beyond technical research, he was a founding member of the European Association for Computer Science Logic in 1992. He served as the organization's vice-president from 2002 to 2004, and as president from 2004 to 2009, during which time he inaugurated the Ackermann Award.
Fast facts
- Born: 1948, Hungary
- Citizenship: Switzerland
- Education: ETH Zurich
- Primary Fields: Mathematics, Computer Science, Logic
- Academic Status: Professor Emeritus, Technion
- Professional Membership: European Association for Computer Science Logic
Questions readers ask
Where did Johann Makowsky earn his doctoral degree?
He earned his Dr. math.sc. from ETH Zurich in 1974.
What specific award did Makowsky establish during his time at the EACSL?
He established the EACSL Ackermann Award, which recognizes outstanding PhD theses in computer science logic.
Is Johann Makowsky still active in academia?
Yes, he remains active as a Professor Emeritus at the Technion, where he continues to teach and supervise graduate students.
