Publications
Export 19 results:
Filters: First Letter Of Last Name is M [Clear All Filters]
, “Canonical proof nets for classical logic”, Annals of Pure and Applied Logic (Special Issue: Classical Logic and Computation), In Press.
, “Proof nets for Herbrand's Theorem”, ACM Transactions on Computational Logic, In Press.
, “Unfolding feasible arithmetic and weak truth”, in Axiomatic Theories of Truth, In Press.
, “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, vol. 7758, Springer, 2013, pp. 166–181.
, “Cut-elimination for the mu-calculus with one variable”, in Fixed Points in Computer Science 2012, 2012, vol. 77, pp. 47–54.
, “Justifications, Ontology, and Conservativity”, in Advances in Modal Logic, volume 9, 2012, pp. 437–458.
, “Expansion nets: Proof nets for for propositional classical logic”, in Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 17), 2010, vol. 6397, pp. 535-549.
, “An Algorithmic Interpretation of a Deep Inference System”, in LPAR 2008, 2008, vol. 5330, p. 482–-496.
, “Soft linear set theory”, Journal of Logic and Algebraic Programming, vol. 76, pp. 226-245, 2008.
, “On applicative theories”, in Logic and Foundations of Mathematics, 1999, p. 83{–}92.
, “Epsilon-substitution method for the ramified language and $Δ^1_1$-comprehension rule”, in Logic and Foundation of Mathematics, 1999, p. 107{–}130.
, “Epsilon-substitution method for the ramified language and $Δ^1_1$-comprehension rule”, in Logic and Foundation of Mathematics, 1999, p. 107{–}130.
, “The $μ$ quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals”, Archive for Mathematical Logic, vol. 37, p. 391{–}413, 1998.
, “Efficient loop-check for backward proof search in some non-classical propositional logics”, in Proceedings of Tableaux '96, 1996, vol. 1071, p. 210{–}225.
, “Efficient loop-check for backward proof search in some non-classical propositional logics”, in Proceedings of Tableaux '96, 1996, vol. 1071, p. 210{–}225.
, “Efficient loop-check for backward proof search in some non-classical propositional logics”, in Proceedings of Tableaux '96, 1996, vol. 1071, p. 210{–}225.
, “Executable models for analysis and implementation of complex systems”, in Proceedings of Information Conference of Swiss Priority Programme Informatics Research 1992{–}1996, Module 1: Secure Distributed Systems, 1994.
, “The Basic Logic of Proofs”, in {C}omputer {S}cience {L}ogic, 6th Workshop, {CSL}'92, {S}an {M}iniato, {I}taly, {S}eptember 28–{O}ctober 2, 1992, Selected Papers, 1993, vol. 702, pp. 14–28.
, “The Logic of the {Gödel Proof Predicate”, in Computational Logic and Proof Theory, Third {K}urt {Gödel {C}olloquium, {KGC}'93, {B}rno, {C}zech {R}epublic, {A}ugust 24–27, 1993, Proceedings, 1993, vol. 713, pp. 71–82.