Home

Publications

Export 214 results:
Sort by: Author Title Type [ Year (Desc)]
Submitted
Jäger, G, Zumbrunnen R.  Submitted.  About the strength of operational regularity.
Probst, D.  Submitted.  The provably terminating operations of the subsystem PETJ of explicit mathematic.
McKinley, R.  Submitted.  A sequent calculus demonstration of Herbrand's Theorem.
Alberucci, L.  Submitted.  A syntactical treatment of simultaneous fixpoints in the modal $μ$-calculus.
Eberhard, S, Strahm T.  Submitted.  Weak theories of truth and explicit mathematics.
To appear
McKinley, R.  To appear.  Canonical proof nets for classical logic. Annals of Pure and Applied Logic (Special Issue: Classical Logic and Computation).
McKinley, R.  To appear.  Proof nets for Herbrand's Theorem. ACM Transactions on Computational Logic.
Goetschi, R, Kuznets R.  To appear.  Realization for Justification Logics via Nested Sequents: Modularity through Embedding. Annals of Pure and Applied Logic.
2012
Kohler, RP.  2012.  Java-Programm zur interaktiven Bearbeitung von JALC-Herleitungen.
2011
Jäger, G, Probst D.  2011.  The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories. Annals of Pure and Applied logic. 162(8):647-660.
Probst, D, Strahm T.  2011.  Admissible closures of polynomial time computable arithmetic. Archive for Mathematical Logic. 50(5-6):643-660.
Bucheli, S, Kuznets R, Studer T.  2011.  Justifications for Common Knowledge. Journal of Applied Non-classical Logics. 21(1):35-60.
Bucheli, S, Kuznets R, Studer T.  2011.  Partial Realization in Dynamic Justification Logic. Logic, Language, Information and Computation, 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011, Proceedings. 6642:35-51.
Spescha, D, Strahm T.  2011.  Realizability in weak systems of explicit mathematics. Mathematical Logic Quarterly. 57(6):551-565.
Jäger, G, Studer T.  2011.  A Buchholz rule for modal fixed point logics. Logica Universalis. 5(1):1-19.
Fabian, D.  2011.  Applicative theories on tree ordinal numbers.
Krähenbühl, J.  2011.  On the Relationship between Choice Schemes and Iterated Class Comprehension in Set Theory.
2010
Bucheli, S, Kuznets R, Studer T.  2010.  Explicit Evidence Systems with Common Knowledge. Abstract
Kuznets, R.  2010.  Self-Referential Justifications in Epistemic Logic. Theory of Computing Systems. 46:636–661. Abstract
Jäger, G, Krähenbühl J.  2010.  $Σ^1_1$ choice in a theory of sets and classes. Ways of {P}roof {T}heory. :283–314.
Wehbe, R.  2010.  Annotated Systems for Common Knowledge.
McKinley, R.  2010.  Expansion nets: Proof nets for for propositional classical logic. Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 17). 6397:535-549.
Jäger, G.  2010.  Modal Fixed Point Logics. Logics and {L}anguages for {R}eliability and {S}ecurity. 25
Brünnler, K.  2010.  Nested Sequents.
Studer, T.  2010.  Privacy Preserving Modules for Ontologies. Proceedings of {P}erspectives of {S}ystem {I}nformatics {PSI}'09. 5947:380{–}387.