Publications

Export 157 results:

Filters: First Letter Of Last Name is S [Clear All Filters]

Submitted

K. Sato, “Full and Hat Inductive Definitions Are Equivalent in NBG”. Submitted.

K. Sato, “Relative Predicativity and Dependent Recursion in Second-order Set Theory and Higher-order Theories”. Submitted.

In Press

S. Bucheli, R. Kuznets, and T. Studer, “Decidability for Justification Logics Revisited”, in Selected papers of Ninth International Tbilisi Symposium on Language, Logic and Computation, In Press.

S. Bucheli, R. Kuznets, and T. Studer, “Realizing Public Announcements by Justifications”, Journal of Computer and System Sciences, In Press.

S. Eberhard and T. Strahm, “Unfolding feasible arithmetic and weak truth”, in Axiomatic Theories of Truth, In Press.

T. Studer, “A Universal Approach to Guarantee Data Privacy”, Logica Universalis, In Press.

2013

S. Bucheli, R. Kuznets, and T. Studer, “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, vol. 7758, G. Bezhanishvili, S. Löbner, V. Marra, and F. Richter Springer, 2013, pp. 166–181.

R. Kuznets and T. Studer, “Update as Evidence: Belief Expansion”, in Logical Foundations of Computer Science, International Symposium, LFCS 2013, San Diego, CA, USA, January 6–8, 2013, Proceedings, vol. 7734, S. Artemov and A. Nerode Springer, 2013, pp. 266–279.

2012

G. Jäger and R. Zumbrunnen, “About the Strength of Operational Regularity”, in Logic, Construction, Computation, 2012, pp. 305–324.

G. Jäger and R. Zumbrunnen, “About the Strength of Operational Regularity”, in Logic, Construction, Computation, 2012, pp. 305–324.

G. Mints and T. Studer, “Cut-elimination for the mu-calculus with one variable”, in Fixed Points in Computer Science 2012, 2012, vol. 77, pp. 47–54.

R. Kuznets and T. Studer, “Justifications, Ontology, and Conservativity”, in Advances in Modal Logic, volume 9, 2012, pp. 437–458.

T. Studer, “Justified Terminological Reasoning”, in Proceedings of Perspectives of System Informatics PSI'11, 2012, vol. 7162, pp. 349-361.

Y. Savateev, “Product-free Lambek calculus is NP-complete”, Annals of Pure and Applied Logic, vol. 163, pp. 775–788, 2012.

K. Brünnler and T. Studer, “Syntactic cut-elimination for a fragment of the modal mu-calculus”, Annals of Pure and Applied Logic, vol. 163, pp. 1838–1853, 2012.

S. Eberhard and T. Strahm, “Weak theories of truth and explicit mathematics”, in Logic, Construction, Computation, 2012, pp. 157–184.

S. Eberhard and T. Strahm, “Weak theories of truth and explicit mathematics”, in Logic, Construction, Computation, 2012, pp. 157–184.

S. Eberhard and T. Strahm, “Weak theories of truth and explicit mathematics”, in Logic, Construction, Computation, 2012, pp. 157–184.

2011

D. Probst and T. Strahm, “Admissible closures of polynomial time computable arithmetic”, Archive for Mathematical Logic, vol. 50, no. 5-6, pp. 643-660, 2011.

T. Studer, “An application of justification logic to protocol verification”, in Proceedings of Computational Intelligence and Security CIS 2011, 2011, p. 779{–}783.

G. Jäger and T. Studer, “A Buchholz rule for modal fixed point logics”, Logica Universalis, vol. 5, no. 1, pp. 1-19, 2011.

T. Studer, “Justification Logic, Inference Tracking, and Data Privacy”, Logic and Logical Philosophy, vol. 20, pp. 297-306, 2011.

S. Bucheli, R. Kuznets, and T. Studer, “Justifications for Common Knowledge”, Journal of Applied Non-classical Logics, vol. 21, no. 1, pp. 35-60, 2011.

S. Bucheli, R. Kuznets, and T. Studer, “Partial Realization in Dynamic Justification Logic”, in Logic, Language, Information and Computation, 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011, Proceedings, 2011, vol. 6642, pp. 35-51.

D. Spescha and T. Strahm, “Realizability in weak systems of explicit mathematics”, Mathematical Logic Quarterly, vol. 57, no. 6, pp. 551-565, 2011.

Pages