Export 283 results:
Fabian, D.: Applicative theories on tree ordinal numbers. (2011).
Studer, T.: Justification Logic, Inference Tracking, and Data Privacy. Logic and Logical Philosophy. 20, 297-306 (2011).
Bucheli, S., Kuznets, R., Studer, T.: Justifications for Common Knowledge. Journal of Applied Non-classical Logics. 21, 35-60 (2011).
Krähenbühl, J.: On the Relationship between Choice Schemes and Iterated Class Comprehension in Set Theory. (2011).
Bucheli, S., Kuznets, R., Studer, T.: Partial Realization in Dynamic Justification Logic. In: Beklemishev, L. and de Queiroz, R. Logic, Language, Information and Computation, 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011, Proceedings. pp. 35-51 (2011).
Spescha, D., Strahm, T.: Realizability in weak systems of explicit mathematics. Mathematical Logic Quarterly. 57, 551-565 (2011).
Savateev, Y.: Sequent Calculus for Justifications. (2011).
Probst, D.: The provably terminating operations of the subsystem PETJ of explicit mathematics. Annals of Pure and Applied Logic. 162, 934-947 (2011).
Jäger, G., Probst, D.: The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories. Annals of Pure and Applied logic. 162, 647-660 (2011).
Brünnler, K., Goetschi, R., Kuznets, R.: A Syntactic Realization Theorem for Justification Logics. In: Beklemishev, L., Goranko, V., and Shehtman, V. Advances in Modal Logic, Volume 8. pp. 39-58. College Publications (2010).
Wehbe, R.: Annotated Systems for Common Knowledge. (2010).
McKinley, R.: Expansion nets: Proof nets for for propositional classical logic. In: Fermüller, C. and Voronkov, A. Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 17). pp. 535-549. Springer Berlin / Heidelberg (2010).
Bucheli, S., Kuznets, R., Studer, T.: Explicit Evidence Systems with Common Knowledge. (2010).
Bucheli, S., Kuznets, R., Renne, B., Sack, J., Studer, T.: Justified Belief Change. In: Arrazola, X. and Ponte, M.\'ıa Proceedings of the Second ILCLI International Workshop on Logic and Philosphy of Knowledge, Communication and Action (LogKCA-10). pp. 135-155. University of the Basque Country Press (2010).
Jäger, G.: Modal Fixed Point Logics. In: Esparza, J., Spanfelner, B., and Grumberg, O. Logics and Languages for Reliability and Security. IOS Press (2010).
Brünnler, K.: Nested Sequents. (2010).
Studer, T.: Privacy Preserving Modules for Ontologies. In: Pnueli, A., Virbitskaite, I., and Voronkov, A. Proceedings of Perspectives of System Informatics PSI'09. pp. 380-387 (2010).
Brugger, J.: Proof-theoretic aspects of weak König's Lemma. (2010).
Studer, T.: Proof-Theoretic Contributions to Modal Fixed Point Logics. (2010).
Kuznets, R.: Self-Referential Justifications in Epistemic Logic. Theory of Computing Systems. 46, 636-661 (2010).
Pulver, C.: Self-Referentiality in Contraction-free Fragments of Modal Logic S4. (2010).
Bucheli, S., Kuznets, R., Studer, T.: Two Ways to Common Knowledge. In: Bolander, T. and Braüner, T. Proceedings of the 6th Workshop on Methods for Modalities (M4M–6 2009), Copenhagen, Denmark, 12–14 November 2009. pp. 83-98. Elsevier (2010).
Feferman, S., Strahm, T.: Unfolding finitist arithmetic. Review of Symbolic Logic. 3, 665-689 (2010).
Stolz, M.C.: Verification of Workflow Control-Flow Patterns with the SPIN Model Checker. (2010).
Strahm, T.: Weak theories of operations and types. In: Schindler, R. Ways of Proof Theory. pp. 441-468. Ontos Verlag (2010).