Publications

Export 250 results:
Filters: Pubitems is alb08  [Clear All Filters]
In Press
Marti, M., Metcalfe, G.: A Hennessy-Milner Property for Many-Valued Modal Logics. Advances in Modal Logic. College Publications (In Press).
Sato, K., Zumbrunnen, R.: A New Model Construction by Making a Detour via Intuitionistic Theories I: Operational Set Theory without Choice is $\Pi_1$-equivalent to KP. Annals of Pure and Applied Logic. (In Press).
Ranzi, F., Strahm, T.: A note on the theory $\mathsf{SID}_{{<}\omega}$ of stratified induction. Mathematical Logic Quarterly. (In Press).
Jäger, G., Probst, D.: A proof-theoretic analysis of theories for stratified inductive definitions. In: Kahle, R. and Rathjen, M. Gentzen's Centenary: The Quest for Consistency. Springer (In Press).
Eberhard, S.: Applicative theories for logarithmic complexity classes. Theoretical Computer Science. (In Press).
Jäger, G., Zumbrunnen, R.: Explicit mathematics and operational set theory: some ontological comparisons. The Bulletin of Symbolic Logic. (In Press).
Sato, K.: Forcing for Hat Inductive Definitions in Arithmetic – One of the Simplest Applications of Forcing –. Mathematical Logic Quarterly. (In Press).
Flumini, D., Sato, K.: From hierarchies to well-foundedness. Archive for Mathematical Logic. (In Press).
Sato, K.: Full and Hat Inductive Definitions Are Equivalent in NBG. Archive for Mathematical Logic. (In Press).
Bucheli, S., Kuznets, R., Studer, T.: Realizing Public Announcements by Justifications. Journal of Computer and System Sciences. 80, 1046-1066 (In Press).
Savateev, Y.: Sequent Calculus for Justifications. Journal of Logic and Computation. (In Press).
Eberhard, S., Strahm, T.: Unfolding feasible arithmetic and weak truth. In: Achourioti, T., Galinon, H., Fujimoto, K., and Martínez-Fernández, J. Axiomatic Theories of Truth. Springer (In Press).
2013
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).

Pages