# Publications

Export 60 results:
Filters: Author is Studer, Thomas  [Clear All Filters]
2018
: A Logic of Blockchain Updates. In: Logical Foundations of Computer Science. pp. 107-119. Springer International Publishing, Cham (2018).
: The Proof Theory of Common Knowledge. In: Jaakko Hintikka on knowledge and game theoretical semantics. Springer (2018).
2017
: Temporal Justification Logic. In: Proceedings of the Ninth Workshop on Methods for Modalities, Indian Institute of Technology, Kanpur, India, 8th to 10th January 2017. pp. 59-74. Open Publishing Association (2017).
2016
: Advances in Proof Theory. Birkhäuser (2016).
: Cyclic Proofs for Linear Temporal Logic. In: Concepts of Proof in Mathematics, Philosophy, and Computer Science. De Gruyter (2016).
: Intuitionistic modal logic made explicit. IfCoLog Journal of Logics and their Applications. 3, 877-901 (2016).
: Probabilistic Justification Logic. In: Symposium on Logical Foundations in Computer Science 2016. Springer (2016).
Studer, T.: Relationale Datenbanken: Von den theoretischen Grundlagen zu Anwendungen mit PostgreSQL. Springer Berlin Heidelberg (2016).
: Weak arithmetical interpretations for the Logic of Proofs. Logic Journal of IGPL. 24, 424-440 (2016).
2015
: First steps towards probabilistic justification logic. Logic Journal of IGPL. 23, 662-687 (2015).
2014
: Censors for Boolean Description Logic. Transactions on Data Privacy. 7, 223-252 (2014).
: Justifying induction on modal $μ$-formulae. Logic Journal of IGPL. 22, 805-817 (2014).
: Realizing Public Announcements by Justifications. Journal of Computer and System Sciences. 80, 1046-1066 (2014).
2013
Studer, T.: A Universal Approach to Guarantee Data Privacy. Logica Universalis. 7, 195-209 (2013).
: Decidability for Justification Logics Revisited. In: Logic, Language, and Computation, 9th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2011, Kutaisi, Georgia, September 26-30, 2011, Revised Selected Papers. pp. 166-181. Springer (2013).
Studer, T.: Decidability for some justification logics with negative introspection. The Journal of Symbolic Logic. 78, 388-402 (2013).
: Update as Evidence: Belief Expansion. In: Logical Foundations of Computer Science, International Symposium, LFCS 2013, San Diego, CA, USA, January 6–8, 2013, Proceedings. pp. 266-279. Springer (2013).
2012
: Cut-elimination for the mu-calculus with one variable. Fixed Points in Computer Science 2012. pp. 47-54. Open Publishing Association (2012).
: Justifications, Ontology, and Conservativity. In: Advances in Modal Logic, volume 9. pp. 437-458. College Publications (2012).
Studer, T.: Justified Terminological Reasoning. In: Proceedings of Perspectives of System Informatics PSI'11. pp. 349-361. Springer (2012).
: Syntactic cut-elimination for a fragment of the modal mu-calculus. Annals of Pure and Applied Logic. 163, 1838-1853 (2012).
2011
: A Buchholz rule for modal fixed point logics. Logica Universalis. 5, 1-19 (2011).
Studer, T.: An application of justification logic to protocol verification. Proceedings of Computational Intelligence and Security CIS 2011. pp. 779-783. IEEE (2011).
Studer, T.: Justification Logic, Inference Tracking, and Data Privacy. Logic and Logical Philosophy. 20, 297-306 (2011).