Publications

Export 280 results:
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).
Matter, S.: Soundness and completeness of a first order probabilistic logic with approximate conditional probabilities. (2015).
Sommaruga, G., Strahm, T.: Turing's Revolution: The Impact of His Ideas about Computability. Birkhäuser (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).
Artemov, S., Kuznets, R.: Logical Omniscience As Infeasibility. Annals of Pure and Applied Logic. 165, 6-25 (2014).
Savateev, Y.: Proof Internalization for Generalized Frege Systems for Classical Logic. Annals of Pure and Applied Logic. 165, 340-356 (2014).
Bucheli, S., Kuznets, R., Studer, T.: Realizing Public Announcements by Justifications. Journal of Computer and System Sciences. 80, 1046-1066 (2014).
Sato, K.: Relative predicativity and dependent recursion in second-order set theory and higher-order theories. The Journal of Symbolic Logic. 79, 712-732 (2014).
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).

Pages