Export 291 results:
Studer, T.: A Universal Approach to Guarantee Data Privacy. Logica Universalis. 7, 195-209 (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).