Export 284 results:
In Press
Oliva, P., Steila, S.: A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem. Journal of Symbolic Logic. (In Press).
Marti, M., Metcalfe, G.: Expressivity in Chain-Based Modal Logics. Archive for Mathematical Logic. (In Press).
Audrito, G., Steila, S.: Generic Large Cardinals and Systems of Filters. Journal of Symbolic Logic. (In Press).
Marti, M., Studer, T.: The Proof Theory of Common Knowledge. In: van Ditmarsch, H. and Sandu, G. Jaakko Hintikka on knowledge and game theoretical semantics. Springer (In Press).
Strahm, T.: Unfolding schematic systems. In: Jäger, G. and Sieg, W. Feferman on Foundations - Logic, Mathematics, Philosophy. Springer (In Press).
Marti, M.: Contributions to Intuitionistic Epistemic Logic. (2017).
Berardi, S., Steila, S.: Ramsey's Theorem for Pairs and k Colors as a Sub-Classical Principle of Arithmetic. Journal of Symbolic Logic. 82, 737-753 (2017).
Frittaion, E., Steila, S., Yokoyama, K.: The Strength of the SCT Criterion. In: Gopal, T.V., Jäger, G., and Steila, S. Theory and Applications of Models of Computation - 14th Annual Conference, {TAMC} 2017, Bern, Switzerland, April 20-22, 2017, Proceedings. pp. 260–273 (2017).
Jäger, G., Marti, M.: A canonical model construction for intuitionistic distributed knowledge. In: Beklemishev, L., Demri, S., and Máté, A. Advances in Modal Logic 2016. College Publications (2016).
Kahle, R., Strahm, T., Studer, T.: Advances in Proof Theory. Birkhäuser (2016).
Probst, D., Schuster, P.: Concepts of Proof in Mathematics, Philosophy, and Computer Science. Walter De Gruyter Incorporated (2016).
Kokkinis, I., Studer, T.: Cyclic Proofs for Linear Temporal Logic. In: Probst, D. and Schuster, P. Concepts of Proof in Mathematics, Philosophy, and Computer Science. De Gruyter (2016).
Jäger, G., Marti, M.: Intuitionistic common knowledge or belief. Journal of Applied Logic. 18, (2016).
Marti, M., Studer, T.: Intuitionistic modal logic made explicit. IfCoLog Journal of Logics and their Applications. 3, 877-901 (2016).
Kashev, A.: Justification with Nominals. (2016).
Kokkinis, I., Ognjanović, Z., Studer, T.: Probabilistic Justification Logic. In: Artemov, S. and Nerode, A. Symposium on Logical Foundations in Computer Science 2016. Springer (2016).
Studer, T.: Relationale Datenbanken: Von den theoretischen Grundlagen zu Anwendungen mit PostgreSQL. Springer Berlin Heidelberg (2016).
Jäger, G.: Relativizing operational set theory. The Bulletin of Symbolic Logic. 22, 332-352 (2016).
Steila, S., Yokoyama, K.: Reverse mathematical bounds for the Termination Theorem. Annals of Pure and Applied Logic. (2016).
Kokkinis, I.: The Complexity of Non-Iterated Probabilistic Justification Logic. In: Simari, G. and Gyssens, M. Foundations of Information and Knowledge Systems -- FoIKS 2016. Springer (2016).
Buchholtz, U.Torben, Jäger, G., Strahm, T.: Theories of proof-theoretic strength $\psi$($\Gamma_{\Omega+1}$). In: Probst, D. and Schuster, P. Concepts of Proof in Mathematics, Philosophy, and Computer Science. De Gruyter (2016).
Kokkinis, I.: Uncertain Reasoning in Justification Logic. (2016).