EDBT 2026 Demo / reviewers in the wild / expert
Lorenzo Galeotti
dblp:181/3664
· DBLP profile ↗
7ranked-venue papers
4as first author
4since 2021 · last 2025
0000-0002-6570-8275ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 6 · 4 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | LogiCraft: A Game Modification Framework for Learning Propositional LogicabstractLogic and formal reasoning are essential skills for programming and computer science. Still, they are challenging to teach due to their abstract nature. This paper explores how Game-Based Learning (GBL) can simplify logic concepts, making them interactive and engaging for young learners. We introduce LogiCraft, an educational framework for co-designing board games that teach propositional logic. The framework includes three illustrative tile-based board games: ¬SCR∧BL, Tautoblocks, and Deducto. These games teach propositional logic by merging computational thinking with hands-on gameplay. By integrating syntax and semantics in new ways, ¬SCR∧BL focuses on logic formulas construction and truth tables visualization, Tautoblocks introduces more advanced concepts of negation, tautology, and contradiction, and Deducto highlights translation and model-based reasoning. Playtesting sessions with students and teachers suggest that our games can enhance logic skills and promote cooperative learning. Our initial classroom results show potential for broader applications in game-based learning. Tamara Dobler, Lorenzo Galeotti, Riemer van Rozen |
FDG | 2 |
| 2023 | Symmetry for Transfinite Computability
Lorenzo Galeotti, Ethan S. Lewis, Benedikt Löwe |
CiE | 1 |
| 2023 | Realisability for infinitary intuitionistic set theoryabstractWe introduce a realisability semantics for infinitary intuitionistic set theory that is based on Ordinal Turing Machines (OTMs). We show that our notion of OTM-realisability is sound with respect to certain systems of infinitary intuitionistic logic, and that all axioms of infinitary Kripke-Platek set theory are realised. Finally, we use a variant of our notion of realisability to show that the propositional admissible rules of (finitary) intuitionistic Kripke-Platek set theory are exactly the admissible rules of intuitionistic propositional logic. Merlin Carl, Lorenzo Galeotti, Robert Paßmann |
Ann. Pure Appl. Log. | 2 |
| 2021 | Randomising Realizability
Merlin Carl, Lorenzo Galeotti, Robert Paßmann |
CiE | 2 |
| 2019 | Surreal Blum-Shub-Smale Machines
Lorenzo Galeotti |
CiE | 1 |
| 2017 | Towards Computable Analysis on the Generalised Real Line
Lorenzo Galeotti, Hugo Nobrega |
CiE | 1 |
| 2016 | A Candidate for the Generalised Real Line
Lorenzo Galeotti |
CiE | 1 |