# Publications

Export 292 results:
2016
: Probabilistic Justification Logic. In: 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).
: 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: Foundations of Information and Knowledge Systems -- FoIKS 2016. Springer (2016).
: Theories of proof-theoretic strength $\psi$($\Gamma_{\Omega+1}$). In: Concepts of Proof in Mathematics, Philosophy, and Computer Science. De Gruyter (2016).
: Weak arithmetical interpretations for the Logic of Proofs. Logic Journal of IGPL. 24, 424-440 (2016).
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).
: 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).
: A proof-theoretic analysis of theories for stratified inductive definitions. In: Gentzen's Centenary: The Quest for Consistency. Springer (2015).
Eberhard, S.: Applicative theories for logarithmic complexity classes. Theoretical Computer Science. 585, 115-135 (2015).
: First steps towards probabilistic justification logic. Logic Journal of IGPL. 23, 662-687 (2015).
Sato, K.: Full and hat inductive definitions are equivalent in NBG. Archive for Mathematical Logic. 54, 75-112 (2015).
: Modal interpolation via nested sequents. Annals of pure and applied logic. 166, 274-305 (2015).
: Unfolding Feasible Arithmetic and Weak Truth. In: Unifying the Philosophy of Truth. pp. 153-167. Springer Netherlands, Dordrecht (2015).
2014
Eberhard, S.: A feasible theory of truth over combinatory algebra. Annals of Pure and Applied Logic. 165, 1009-1033 (2014).
: A Hennessy-Milner Property for Many-Valued Modal Logics. In: Advances in Modal Logic. pp. 407-420. College Publications (2014).
: A note on the theory $\mathsf{SID}_{{<}\omega}$ of stratified induction. Mathematical Logic Quarterly. 60, 487-497 (2014).
: Censors for Boolean Description Logic. Transactions on Data Privacy. 7, 223-252 (2014).