Publications

Export 283 results:
2013
McKinley, R.: Canonical proof nets for classical logic. Annals of Pure and Applied Logic. 164, 702-732 (2013).
Zumbrunnen, R.: Contributions to Operational Set Theory. (2013).
Bucheli, S., Kuznets, R., Studer, T.: Decidability for Justification Logics Revisited. In: Bezhanishvili, G., Löbner, S., Marra, V., and Richter, F. 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).
Jäger, G.: Operational closure and stability. Annals of Pure and Applied Logic. 164, 813-821 (2013).
McKinley, R.: Proof Nets for Herbrand's Theorem. ACM Transactions on Computational Logic. 14, 5 (2013).
Brambilla, P.: Proof Search in Propositional Circumscription and Default Logic. (2013).
Kuznets, R., Studer, T.: Update as Evidence: Belief Expansion. In: Artemov, S. and Nerode, A. Logical Foundations of Computer Science, International Symposium, LFCS 2013, San Diego, CA, USA, January 6–8, 2013, Proceedings. pp. 266-279. Springer (2013).
Eberhard, S.: Weak applicative theories, truth, and computational complexity. (2013).
Flumini, D.: Weak well orders. (2013).
2012
Jäger, G., Zumbrunnen, R.: About the Strength of Operational Regularity. In: Berger, U., Diener, H., Schuster, P., and Seisenberger, M. Logic, Construction, Computation. pp. 305-324. Ontos Verlag (2012).
Mints, G., Studer, T.: Cut-elimination for the mu-calculus with one variable. Fixed Points in Computer Science 2012. pp. 47-54. Open Publishing Association (2012).
Kohler, R.P.: Java-Programm zur interaktiven Bearbeitung von JALC-Herleitungen. (2012).
Bucheli, S.: Justification Logics with Common Knowledge. (2012).
Kuznets, R., Studer, T.: Justifications, Ontology, and Conservativity. In: Bolander, T., Braüner, T., Ghilardi, S., and Moss, L. Advances in Modal Logic, volume 9. pp. 437-458. College Publications (2012).
Studer, T.: Justified Terminological Reasoning. In: Clarke, E.E., Virbitskaite, I., and Voronkov, A. Proceedings of Perspectives of System Informatics PSI'11. pp. 349-361. Springer (2012).
Buss, S.R., Kuznets, R.: Lower complexity bounds in justification logic. Annals of Pure and Applied Logic. 163, 888-905 (2012).
Goetschi, R.: On the Realization and Classification of Justification Logics. (2012).
Savateev, Y.: Product-free Lambek calculus is NP-complete. Annals of Pure and Applied Logic. 163, 775-788 (2012).
Goetschi, R., Kuznets, R.: Realization for Justification Logics via Nested Sequents: Modularity through Embedding. Annals of Pure and Applied Logic. 163, 1271-1298 (2012).
Brünnler, K., Studer, T.: Syntactic cut-elimination for a fragment of the modal mu-calculus. Annals of Pure and Applied Logic. 163, 1838-1853 (2012).
Eberhard, S., Strahm, T.: Weak theories of truth and explicit mathematics. In: Berger, U., Diener, H., Schuster, P., and Seisenberger, M. Logic, Construction, Computation. pp. 157-184. Ontos Verlag (2012).

Pages