# Publications

Export 253 results:
Filters: Pubitems is alb08  [Clear All Filters]
Submitted
In Press
: A proof-theoretic analysis of theories for stratified inductive definitions. In: Gentzen's Centenary: The Quest for Consistency. Springer (In Press).
Eberhard, S.: Applicative theories for logarithmic complexity classes. Theoretical Computer Science. (In Press).
Savateev, Y.: Sequent Calculus for Justifications. Journal of Logic and Computation. (In Press).
: Unfolding feasible arithmetic and weak truth. In: Axiomatic Theories of Truth. Springer (In Press).
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).
: 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).
: From hierarchies to well-foundedness. Archive for Mathematical Logic. 53, (2014).
: Justifying induction on modal $μ$-formulae. Logic Journal of IGPL. 22, 805-817 (2014).
: 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).
: 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).
: Decidability for Justification Logics Revisited. In: 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).