# Publications

Export 122 results:
Filters: Type is Journal Article  [Clear All Filters]
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).
Studer, T.: Decidability for some justification logics with negative introspection. The Journal of Symbolic Logic. 78, 388-402 (2013).
Jäger, G.: Operational closure and stability. Annals of Pure and Applied Logic. 164, 813-821 (2013).
McKinley, R.: Proof Nets for Herbrand's Theorem. ACM Transactions on Computational Logic. 14, 5 (2013).
2012
: Lower complexity bounds in justification logic. Annals of Pure and Applied Logic. 163, 888-905 (2012).
Savateev, Y.: Product-free Lambek calculus is NP-complete. Annals of Pure and Applied Logic. 163, 775-788 (2012).
: Realization for Justification Logics via Nested Sequents: Modularity through Embedding. Annals of Pure and Applied Logic. 163, 1271-1298 (2012).
: Syntactic cut-elimination for a fragment of the modal mu-calculus. Annals of Pure and Applied Logic. 163, 1838-1853 (2012).
2011
: A Buchholz rule for modal fixed point logics. Logica Universalis. 5, 1-19 (2011).
: Admissible closures of polynomial time computable arithmetic. Archive for Mathematical Logic. 50, 643-660 (2011).
Studer, T.: Justification Logic, Inference Tracking, and Data Privacy. Logic and Logical Philosophy. 20, 297-306 (2011).
: Justifications for Common Knowledge. Journal of Applied Non-classical Logics. 21, 35-60 (2011).
: Realizability in weak systems of explicit mathematics. Mathematical Logic Quarterly. 57, 551-565 (2011).
Probst, D.: The provably terminating operations of the subsystem PETJ of explicit mathematics. Annals of Pure and Applied Logic. 162, 934-947 (2011).
: The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories. Annals of Pure and Applied logic. 162, 647-660 (2011).
2010
Kuznets, R.: Self-Referential Justifications in Epistemic Logic. Theory of Computing Systems. 46, 636-661 (2010).
: Unfolding finitist arithmetic. Review of Symbolic Logic. 3, 665-689 (2010).