A Theory of Explicit Mathematics Equivalent to ID1. - Reinhard Kahle; Thomas Studer (CSL, 2000)

Constructive Foundations for Featherweight Java. - Thomas Studer (Proof Theory in Computer Science, 2001)

Universes in explicit mathematics. - Gerhard Jäger; Reinhard Kahle; Thomas Studer (Ann. Pure Appl. Log., 2001)

Formalizing non-termination of recursive programs. - Reinhard Kahle; Thomas Studer (J. Log. Algebraic Methods Program., 2001)

A Semantics for [lambda]: a Calculus with Overloading and Late-binding. - Thomas Studer (J. Log. Comput., 2001)

How to normalize the Jay. - Dieter Probst; Thomas Studer (Theor. Comput. Sci., 2001)

Extending the system T0 of explicit mathematics: the limit and Mahlo axioms. - Gerhard Jäger; Thomas Studer (Ann. Pure Appl. Log., 2002)

Provable Data Privacy. - Kilian Stoffel; Thomas Studer (DEXA, 2005)

Probabilistic ABox Reasoning: Preliminary Results. - Michael Dürig; Thomas Studer (Description Logics, 2005)

Explicit mathematics: power types and overloading. - Thomas Studer (Ann. Pure Appl. Log., 2005)

A Formal Model of Data Privacy. - Phiniki Stouppa; Thomas Studer (Ershov Memorial Conference, 2006)

Deduction chains for common knowledge. - Mathis Kretz; Thomas Studer (J. Appl. Log., 2006)

Improving Semantic Query Answering. - Norbert Kottmann; Thomas Studer (DEXA, 2007)

Total Public Announcements. - David Steiner 001; Thomas Studer (LFCS, 2007)

Syntactic Cut-elimination for Common Knowledge. - Kai Brünnler; Thomas Studer (M4M, 2007)

Cut-free common knowledge. - Gerhard Jäger; Mathis Kretz; Thomas Studer (J. Appl. Log., 2007)

Canonical completeness of infinitary mu. - Gerhard Jäger; Mathis Kretz; Thomas Studer (J. Log. Algebraic Methods Program., 2008)

On contraction and the modal fragment. - Kai Brünnler; Dieter Probst; Thomas Studer (Math. Log. Q., 2008)

On the Proof Theory of the Modal mu-Calculus. - Thomas Studer (Stud Logica, 2008)

Privacy Preserving Modules for Ontologies. - Thomas Studer (Ershov Memorial Conference, 2009)

Data Privacy for Knowledge Bases. - Phiniki Stouppa; Thomas Studer (LFCS, 2009)

Two Ways to Common Knowledge. - Samuel Bucheli; Roman Kuznets; Thomas Studer (M4M, 2009)

Common knowledge does not have the Beth property. - Thomas Studer (Inf. Process. Lett., 2009)

Explicit Evidence Systems with Common Knowledge - Samuel Bucheli; Roman Kuznets; Thomas Studer (CoRR, 2010)

An Application of Justification Logic to Protocol Verification. - Thomas Studer (CIS, 2011)

Justified Terminological Reasoning. - Thomas Studer (Ershov Memorial Conference, 2011)

Decidability for Justification Logics Revisited. - Samuel Bucheli; Roman Kuznets; Thomas Studer (TbiLLC, 2011)

Partial Realization in Dynamic Justification Logic. - Samuel Bucheli; Roman Kuznets; Thomas Studer (WoLLIC, 2011)

Justifications for common knowledge. - Samuel Bucheli; Roman Kuznets; Thomas Studer (J. Appl. Non Class. Logics, 2011)

A Buchholz Rule for Modal Fixed Point Logics. - Gerhard Jäger; Thomas Studer (Logica Universalis, 2011)

Justifications, Ontology, and Conservativity. - Roman Kuznets; Thomas Studer (Advances in Modal Logic, 2012)

Syntactic cut-elimination for a fragment of the modal mu-calculus. - Kai Brünnler; Thomas Studer (Ann. Pure Appl. Log., 2012)

Cut-elimination for the mu-calculus with one variable - Grigori Mints; Thomas Studer (FICS, 2012)

Update as Evidence: Belief Expansion. - Roman Kuznets; Thomas Studer (LFCS, 2013)

Decidability for some justification logics with negative introspection. - Thomas Studer (J. Symb. Log., 2013)

A Universal Approach to Guarantee Data Privacy. - Thomas Studer (Logica Universalis, 2013)

Justifying induction on modal μ-formulae. - Luca Alberucci; Jürg Krähenbühl; Thomas Studer (Log. J. IGPL, 2014)

Realizing public announcements by justifications. - Samuel Bucheli; Roman Kuznets; Thomas Studer (J. Comput. Syst. Sci., 2014)

Censors for Boolean Description Logic. - Thomas Studer; Johannes Werner (Trans. Data Priv., 2014)

Justification logic enjoys the strong finite model property. - Thomas Studer (CoRR, 2015)

First steps towards probabilistic justification logic. - Ioannis Kokkinis; Petar Maksimovic 001; Zoran Ognjanovic; Thomas Studer (Log. J. IGPL, 2015)

Modular Models for Intuitionistic Justification Logic. - Michel Marti; Thomas Studer (CoRR, 2016)

Intuitionistic Modal Logic made Explicit. - Michel Marti; Thomas Studer (FLAP, 2016)

Weak arithmetical interpretations for the Logic of Proofs. - Roman Kuznets; Thomas Studer (Log. J. IGPL, 2016)

Justification Logic with Approximate Conditional Probabilities. - Zoran Ognjanovic; Nenad Savic; Thomas Studer (LORI, 2017)

Temporal Justification Logic. - Samuel Bucheli; Meghdad Ghari; Thomas Studer (M4M@ICLA, 2017)

The Internalized Disjunction Property for Intuitionistic Justification Logic. - Michel Marti; Thomas Studer (Advances in Modal Logic, 2018)

Probabilistic Consensus of the Blockchain Protocol. - Bojan Marinkovic; Paola Glavan; Zoran Ognjanovic; Dragan Doder; Thomas Studer (ECSQARU, 2019)

Bayesian Confirmation and Justifications. - Hamzeh Mohammadi; Thomas Studer (ECSQARU, 2019)

Public Announcements for Epistemic Models and Hypertheories. - Nenad Savic; Thomas Studer (ICLA, 2019)

The Logic of Temporal Domination. - Thomas Studer (RIVF, 2019)

Incomplete Information and Justifications. - Dragan Doder; Zoran Ognjanovic; Nenad Savic; Thomas Studer (TbiLLC, 2019)

Subset Models for Justification Logic. - Eveline Lehmann; Thomas Studer (WoLLIC, 2019)

Relevant Justification Logic. - Nenad Savic; Thomas Studer (FLAP, 2019)

A temporal epistemic logic with a non-rigid set of agents for analyzing the blockchain protocol. - Bojan Marinkovic; Paola Glavan; Zoran Ognjanovic; Thomas Studer (J. Log. Comput., 2019)

Logic and Applications - LAP Meeting. - Zvonimir Sikic; Silvia Ghilezan; Zoran Ognjanovic; Thomas Studer (Logic, Language, and Security, 2020)

Belief Expansion in Subset Models. - Eveline Lehmann; Thomas Studer (LFCS, 2020)

No-Go Theorems for Data Privacy. - Thomas Studer (CoRR, 2020)

A logic of blockchain updates. - Kai Brünnler; Dandolo Flumini; Thomas Studer (J. Log. Comput., 2020)

Probabilistic justification logic. - Ioannis Kokkinis; Zoran Ognjanovic; Thomas Studer (J. Log. Comput., 2020)

Semirings of Evidence. - Michael Baur; Thomas Studer (J. Log. Comput., 2021)

A logic of knowing why. - Chao Xu; Yanjing Wang 001; Thomas Studer (Synth., 2021)

Development of an AI-based bioacoustic wolf monitoring system. - Olivier Stähli; Thomas Ost; Thomas Studer (FLAIRS, 2022)

A logic of interactive proofs. - David Lehnherr; Zoran Ognjanovic; Thomas Studer (J. Log. Comput., 2022)

What Do You Care About: Inferring Values from Emotions. - Jieting Luo; Mehdi Dastani; Thomas Studer; Beishui Liao (AAMAS, 2023)

Modal and Justification Logics for Multi-agent Systems (Invited Talk). - Christian Cachin; David Lehnherr; Thomas Studer (CLAR, 2023)

Providing Personalized Explanations: A Conversational Approach. - Jieting Luo; Thomas Studer; Mehdi Dastani (CLAR, 2023)

Conditional Obligations in Justification Logic. - Federico L. G. Faroldi; Atefeh Rohani; Thomas Studer (WoLLIC, 2023)

Impossible and Conflicting Obligations in Justification Logic. - Federico L. G. Faroldi; Meghdad Ghari; Eveline Lehmann; Thomas Studer (CoRR, 2023)

Coalgebraic Proof Translations for Non-Wellfounded Proofs. - Borja Sierra-Miranda; Thomas Studer; Lukas Zenger (AiML, 2024)

Consistency and permission in deontic justification logic. - Federico L. G. Faroldi; Meghdad Ghari; Eveline Lehmann; Thomas Studer (J. Log. Comput., 2024)

Temporal Logics Meet Real-World Software Requirements: A Reality Check. - Roman Bögli; Atefeh Rohani; Thomas Studer; Christos Tsigkanos; Timo Kehrer (FormaliSE, 2025)

Simplicial Belief. - Christian Cachin; David Lehnherr; Thomas Studer (SIROCCO, 2025)

Explicit non-normal modal logic. - Atefeh Rohani; Thomas Studer (J. Log. Comput., 2025)

Synergistic knowledge. - Christian Cachin; David Lehnherr; Thomas Studer (Theor. Comput. Sci., 2025)