Publications

Export 275 results:
Filters: Pubitems is alb08  [Clear All Filters]
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).
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).
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 ComputerScience. De Gruyter (2016).
Kokkinis, I.: Uncertain Reasoning in Justification Logic. (2016).
Kuznets, R., Studer, T.: Weak arithmetical interpretations for the Logic of Proofs. Logic Journal of IGPL. 24, 424-440 (2016).
2015
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. 166, 121-186 (2015).
Sato, K.: A new model construction by making a detour via intuitionistic theories II: Interpretability lower bound of Feferman's explicit mathematics T0. Annals of pure and applied logic. 166, 800-835 (2015).
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 (2015).
Eberhard, S.: Applicative theories for logarithmic complexity classes. Theoretical Computer Science. 585, 115-135 (2015).
Werner, J.: Controlled Query Evaluation in General Semantics with Incomplete Information. (2015).
Kokkinis, I., Maksimović, P., Ognjanović, Z., Studer, T.: First steps towards probabilistic justification logic. Logic Journal of IGPL. 23, 662-687 (2015).
Ranzi, F.: From a Flexible Type System to Metapredicative Wellordering Proofs. (2015).
Sato, K.: Full and hat inductive definitions are equivalent in NBG. Archive for Mathematical Logic. 54, 75-112 (2015).

Pages