Find Academic Supervisors

• Mathematical Logic
• Philosophical Logic
• Philosophy of Mathematics
• +3 more

Prof. Dr. Reinhard Kahle is a faculty member at the University of Tübingen in the Faculty of Philosophy . He holds the academic rank of Professor and his research focuses on Mathematical Logic , Philosophical Logic , Philosophy of Mathematics , and History of Logic . He also investigates the Societal Relevance of Science and Philosophy of Language . Education : Studium der Mathematik, Philosophie und Informatik in Göttingen, Zürich und München (1987-1993) Diplom in Mathematik, LMU München (1993) Promotion in Informatik, Universität Bern (1997) Habilitation in Informatik, Universität Tübingen (2007) Habilitation in Mathematik, Universidade de Coimbra (2008) Awards : Carl Friedrich von Weizsäcker-Stiftungsprofessor für Theorie und Geschichte der Wissenschaften, University of Tübingen (2019) Publications : Advances in Proof Theory (2016, co-editor) Gentzen's Centenary: The quest for consistency (2015, co-editor) Over 40 peer-reviewed journal articles and book chapters focusing on proof theory, mathematical logic, and philosophical implications of formal systems

Gabriele PulciniView profile

Assistant Professor

• Proof Theory
• Philosophy of Mathematics
• Hilbert's 24th Problem
• +6 more

Gabriele Pulcini is an Assistant Professor in Logic and Philosophy of Science at the Philosophy Department, University of Rome 'Tor Vergata'. He holds dual PhDs in Philosophy and Theory of Human Sciences from the University of Rome 3 and in Discrete Mathematics from the University of Aix-Marseille II. Since 2020, he has served as a council member of the Italian Society for Logic and Philosophy of Science (SILFS). Previously, he was a postdoctoral researcher at the Institute for Logic, Language and Computation (ILLC) in Amsterdam, and has taught master courses in proof theory and set theory at institutions including the Sorbonne, University of Campinas, and the University of Lisbon. His research focuses on proof theory, Hilbert's 24th problem, and the philosophy of mathematics, with contributions to linear/nonmonotonic logics, refutation calculi, and Gödel's incompleteness theorems. His work bridges formal logic with interdisciplinary applications, such as integrating logical frameworks into molecular biology. Key themes include deductive saturation, context-sensitiveness in logical systems, and foundational questions in mathematical logic. Pulcini's publications explore advanced topics like cut-elimination, complementary proof nets, and fractional semantics, often addressing the interplay between classical and non-classical logics. His recent work emphasizes innovations in refutation systems and their philosophical implications.

Willem HeijltjesView profile

Senior Lecturer

• Logic
• Proof Theory
• Lambda-Calculus
• +3 more

Willem Heijltjes is a Senior Lecturer in the Department of Computer Science at the University of Bath. His research focuses on logic and proof theory, particularly on canonical graphical representations of proofs (proof nets) and their applications in lambda-calculus and type systems. He is actively involved in theoretical computer science, exploring foundational aspects of programming languages and computational logic. He leads the project 'Typed Lambda-Calculi with Sharing and Unsharing', funded by the Engineering and Physical Sciences Research Council (EPSRC) from 2019 to 2022. This project investigates advanced type systems and computational models, contributing to the understanding of call-by-value and call-by-name evaluation strategies in the context of linear logic and sequent calculus. His research interests span lambda-calculus, linear logic, proof nets, type systems, and programming language semantics. He has published extensively in top-tier conferences such as CSL, FSCD, and LICS, addressing topics like probabilistic termination, functional machine calculus, and normalization without syntax. He is currently accepting doctoral students in these areas. Heijltjes collaborates internationally on foundational computer science topics, including the development of combinatorial proofs and the exploration of confluence in higher-order rewriting systems.