| Publication | Date of Publication | Type |
|---|
Synergistic knowledge Theoretical Computer Science | 2024-12-12 | Paper |
Consistency and permission in deontic justification logic Journal Of Logic And Computation | 2024-11-12 | Paper |
Conditional obligations in justification logic Logic, Language, Information, and Computation | 2024-02-28 | Paper |
Modal and justification logics for multi-agent systems (invited talk) Lecture Notes in Computer Science | 2024-01-16 | Paper |
Providing personalized explanations: a conversational approach Lecture Notes in Computer Science | 2024-01-16 | Paper |
Exploring subset models for justification logic | 2023-03-29 | Paper |
A logic of knowing why Synthese | 2023-03-17 | Paper |
Impossible and conflicting obligations in justification logic | 2023-02-21 | Paper |
A Conflict Tolerant Logic of Explicit Evidence Logical Investigations | 2023-01-16 | Paper |
A logic of interactive proofs Journal Of Logic And Computation | 2023-01-04 | Paper |
The impossibility of keeping secrets | 2022-11-11 | Paper |
Relevant justification logic | 2022-09-28 | Paper |
Semirings of Evidence Lecture Notes in Computer Science | 2022-08-30 | Paper |
Incomplete Information and Justifications | 2022-08-11 | Paper |
A logic of interactive proofs | 2022-07-01 | Paper |
Explicit non-normal modal logic | 2022-06-24 | Paper |
Justification Logics with Probability Operators Probabilistic Extensions of Various Logical Systems | 2022-01-27 | Paper |
Semirings of Evidence Journal Of Logic And Computation | 2022-01-03 | Paper |
Logic and applications -- LAP meeting | 2021-07-08 | Paper |
scientific article; zbMATH DE number 7324390 (Why is no real title available?) | 2021-03-17 | Paper |
A logic of blockchain updates Journal Of Logic And Computation | 2020-12-15 | Paper |
The proof theory of common knowledge | 2020-07-24 | Paper |
Belief expansion in subset models | 2020-05-06 | Paper |
Probabilistic justification logic Journal Of Logic And Computation | 2020-04-29 | Paper |
Cyclic Proofs for Linear Temporal Logic Concepts of Proof in Mathematics, Philosophy, and Computer Science | 2020-04-03 | Paper |
Relational databases. From theoretical basics to applications with PostgreSQL | 2020-04-03 | Paper |
Subset models for justification logic | 2020-03-04 | Paper |
Bayesian confirmation and justifications | 2020-02-20 | Paper |
Probabilistic consensus of the blockchain protocol | 2020-02-20 | Paper |
A temporal epistemic logic with a non-rigid set of agents for analyzing the blockchain protocol Journal Of Logic And Computation | 2020-02-03 | Paper |
Public announcements for epistemic models and hypertheories | 2020-01-14 | Paper |
Logics of proofs and justifications | 2019-09-04 | Paper |
The internalized disjunction property for intuitionistic justification logic | 2019-07-24 | Paper |
Subset models for justification logic | 2019-02-07 | Paper |
Self-referentiality in Justification Logic | 2019-02-04 | Paper |
Weak arithmetical interpretations for the logic of proofs Logic Journal of the IGPL | 2019-01-08 | Paper |
First steps towards probabilistic justification logic Logic Journal of the IGPL | 2019-01-08 | Paper |
Justifying induction on modal \(\mu\)-formulae Logic Journal of the IGPL | 2019-01-08 | Paper |
A logic of blockchain updates | 2018-04-06 | Paper |
Justification logic with approximate conditional probabilities | 2017-11-22 | Paper |
Probabilistic justification logic Logical Foundations of Computer Science | 2017-07-21 | Paper |
Two ways to common knowledge Electronic Notes in Theoretical Computer Science | 2016-08-05 | Paper |
Modular Models for Intuitionistic Justification Logic | 2016-04-25 | Paper |
Update as evidence: belief expansion Logical Foundations of Computer Science | 2015-12-11 | Paper |
Justified terminological reasoning Perspectives of Systems Informatics | 2015-12-07 | Paper |
Justification logic enjoys the strong finite model property | 2015-06-23 | Paper |
Syntactic cut-elimination for common knowledge Electronic Notes in Theoretical Computer Science | 2015-03-23 | Paper |
scientific article; zbMATH DE number 6302917 (Why is no real title available?) | 2014-06-11 | Paper |
Realizing public announcements by justifications Journal of Computer and System Sciences | 2014-06-10 | Paper |
A universal approach to guarantee data privacy Logica Universalis | 2013-08-06 | Paper |
Decidability for some justification logics with negative introspection Journal of Symbolic Logic | 2013-06-24 | Paper |
Decidability for justification logics revisited Logic, Language, and Computation | 2013-04-12 | Paper |
A Buchholz rule for modal fixed point logics Logica Universalis | 2013-03-19 | Paper |
Justification logic, inference tracking, and data privacy | 2013-01-28 | Paper |
Syntactic cut-elimination for a fragment of the modal mu-calculus Annals of Pure and Applied Logic | 2012-10-11 | Paper |
Justifications for common knowledge Journal of Applied Non-Classical Logics | 2012-07-17 | Paper |
Partial realization in dynamic justification logic Logic, Language, Information and Computation | 2011-05-27 | Paper |
Common knowledge does not have the Beth property Information Processing Letters | 2010-08-16 | Paper |
A formal model of data privacy Perspectives of Systems Informatics | 2010-02-02 | Paper |
Privacy preserving modules for ontologies Perspectives of Systems Informatics | 2010-02-02 | Paper |
Syntactic cut-elimination for common knowledge Annals of Pure and Applied Logic | 2009-06-17 | Paper |
On the proof theory of the modal mu-calculus Studia Logica | 2009-03-17 | Paper |
Data Privacy for $\mathcal{ALC}$ Knowledge Bases Logical Foundations of Computer Science | 2009-02-24 | Paper |
Canonical completeness of infinitary \(\mu \) The Journal of Logic and Algebraic Programming | 2008-09-01 | Paper |
On contraction and the modal fragment MLQ | 2008-08-15 | Paper |
Cut-free common knowledge Journal of Applied Logic | 2008-03-11 | Paper |
Total Public Announcements Logical Foundations of Computer Science | 2008-01-04 | Paper |
Deduction chains for common knowledge Journal of Applied Logic | 2006-10-10 | Paper |
Explicit mathematics: power types and overloading Annals of Pure and Applied Logic | 2005-06-23 | Paper |
scientific article; zbMATH DE number 2006639 (Why is no real title available?) | 2003-11-23 | Paper |
A semantics for \(\lambda_{str}^{\{\,\}}\): A calculus with overloading and late-binding Journal of Logic and Computation | 2003-05-22 | Paper |
Extending the system T\(_0\) of explicit mathematics: The limit and Mahlo axioms Annals of Pure and Applied Logic | 2003-01-07 | Paper |
Formalizing non-termination of recursive programs The Journal of Logic and Algebraic Programming | 2002-05-21 | Paper |
Universes in explicit mathematics Annals of Pure and Applied Logic | 2002-03-12 | Paper |
scientific article; zbMATH DE number 1670489 (Why is no real title available?) | 2001-11-11 | Paper |
How to normalize the Jay Theoretical Computer Science | 2001-08-20 | Paper |