Publications

Export 261 results:
Filters: Pubitems is alb08  [Clear All Filters]
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).
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).
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).
Fitting, M., Kuznets, R.: Modal interpolation via nested sequents. Annals of pure and applied logic. 166, 274-305 (2015).
Eberhard, S., Strahm, T.: Unfolding Feasible Arithmetic and Weak Truth. In: Achourioti, T., Galinon, H., Fernández, J.Martínez, and Fujimoto, K. 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).
Marti, M., Metcalfe, G.: A Hennessy-Milner Property for Many-Valued Modal Logics. In: Goré, R., Kooi, B., and Kurucz, A. Advances in Modal Logic. pp. 407-420. College Publications (2014).
Ranzi, F., Strahm, T.: A note on the theory $\mathsf{SID}_{{<}\omega}$ of stratified induction. Mathematical Logic Quarterly. 60, 487-497 (2014).
Studer, T., Werner, J.: Censors for Boolean Description Logic. Transactions on Data Privacy. 7, 223-252 (2014).
Jäger, G., Zumbrunnen, R.: Explicit mathematics and operational set theory: some ontological comparisons. The Bulletin of Symbolic Logic. 20, 275-292 (2014).
Sato, K.: Forcing for Hat Inductive Definitions in Arithmetic – One of the Simplest Applications of Forcing –. Mathematical Logic Quarterly. 60, 314-318 (2014).
Flumini, D., Sato, K.: From hierarchies to well-foundedness. Archive for Mathematical Logic. 53, (2014).
Alberucci, L., Krähenbühl, J., Studer, T.: Justifying induction on modal $μ$-formulae. Logic Journal of IGPL. 22, 805-817 (2014).

Pages