Per Lindström

Per Lindström is a Swedish mathematician and logician known for contributions to model theory, proof theory, and theoretical computer science. He is noted for Lindström's theorem characterizing first-order logic and for work on semantics, interpolation, and formal systems that influenced developments in automata theory and computational logic. His career spans positions in Swedish universities and international collaborations with logicians and computer scientists.

Early life and education

Lindström was born in Sweden and studied mathematics and logic at Uppsala University where he completed doctoral work under Dag Prawitz. During his formative years he interacted with scholars from Stockholm University, University of Gothenburg, and visitors from University of Oxford, University of Cambridge, and University of Oslo. His education connected him to traditions represented by figures such as Per Martin-Löf, Rolf Sundholm, Stanisław Leśniewski, and historical influences including Gottlob Frege, Bertrand Russell, and Alfred Tarski.

Academic career

Lindström held academic posts at institutions including the University of Gothenburg and collaborative positions involving the Royal Institute of Technology in Stockholm. He participated in conferences sponsored by organizations like the Nordic Association of Mathematicians, the European Mathematical Society, and the Association for Symbolic Logic. His visits and sabbaticals connected him with researchers at Princeton University, Harvard University, Massachusetts Institute of Technology, University of California, Berkeley, and Stanford University. He supervised students and collaborated with logicians linked to Gӧran Sundholm, Dag Prawitz, Per Martin-Löf, and computer scientists associated with ACM and IEEE research communities.

Contributions to logic and computer science

Lindström formulated what became known as Lindström's theorem, a characterization of first-order logic relative to extensions satisfying the compactness theorem and the Löwenheim–Skolem property; this theorem influenced work by Alfred Tarski, Ludwig Löwenheim, Thoralf Skolem, Kurt Gödel, and later logicians such as Jon Barwise and H. Jerome Keisler. He investigated interpolation theorems and preservation theorems linked to names like Craig interpolation, Beth definability, and researchers including Dana Scott and Robert Vaught. Lindström's work impacted model theory threads pursued at University of California, Berkeley, Princeton University, and University of Chicago.

In proof theory and theoretical computer science, his analyses of expressive power and definability informed aspects of automata theory and formal language research associated with Noam Chomsky, Michael O. Rabin, Dana Scott, and Alfred Aho. His perspectives on logic influenced studies in descriptive complexity connected to Neil Immerman and Moshe Vardi, and semantic frameworks used in programming language theory tied to Robin Milner, Gordon Plotkin, and Dana Scott. Lindström also engaged with modal logic and its applications, intersecting with works by Saul Kripke, Hilary Putnam, and researchers in model-theoretic modal semantics.

Awards and honors

Lindström received recognition from Swedish and international mathematical communities, including honors from bodies related to Uppsala University, the Royal Swedish Academy of Sciences, and invitations to lecture at institutions such as University of Oxford, University of Cambridge, and Institute for Advanced Study. He held keynote roles in meetings organized by the Association for Symbolic Logic, the European Association for Theoretical Computer Science, and national academies including the Royal Society and the Royal Swedish Academy of Sciences.

Selected publications

- "On Extensions of Elementary Logic" (paper establishing Lindström's theorem), appearing in proceedings and journals cited across model theory literature and referenced alongside works by Alfred Tarski and Kurt Gödel. - Articles on interpolation and definability connected with Beth definability and Craig interpolation results, published in venues read by scholars at Princeton University and Harvard University. - Papers linking logical expressivity to computational frameworks, discussed in contexts involving ACM and IEEE conferences and cited by authors in descriptive complexity and automata theory.

Category:Swedish mathematicians Category:Logicians Category:Uppsala University alumni