Publications

Export 234 results:

Filters: Pubitems is str10 [Clear All Filters]

Submitted

S. Eberhard, “Applicative theories for logarithmic complexity classes”. Submitted.

S. Eberhard, “A feasible theory of truth over combinatory logic”. 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

R. McKinley, “Canonical proof nets for classical logic”, Annals of Pure and Applied Logic (Special Issue: Classical Logic and Computation), 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.

G. Jäger, “Operational closure and stability”, Annals of Pure and Applied Logic, In Press.

R. McKinley, “Proof nets for Herbrand's Theorem”, ACM Transactions on Computational Logic, 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. 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. P. Kohler, “Java-Programm zur interaktiven Bearbeitung von JALC-Herleitungen”. Universität Bern, 2012.

S. Bucheli, “Justification Logics with Common Knowledge”. Universität Bern, 2012.

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.

S. R. Buss and R. Kuznets, “Lower complexity bounds in justification logic”, Annals of Pure and Applied Logic, vol. 163, pp. 888–905, 2012.

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

R. Goetschi, “On the Realization and Classification of Justification Logics”. Universität Bern, 2012.

R. Goetschi and R. Kuznets, “Realization for Justification Logics via Nested Sequents: Modularity through Embedding”, Annals of Pure and Applied Logic, vol. 163, pp. 1271–1298, 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.

Pages