•  23
    Alternative Axiomatization for Logics of Agency in a G3 Calculus
    Foundations of Science 28 (1): 205-224. 2021.
    In a recent paper, Negri and Pavlović (Studia Logica 1–35, 2020) have formulated a decidable sequent calculus for the logic of agency, specifically for a deliberative see-to-it-that modality, or dstit. In that paper the adequacy of the system is demonstrated by showing the derivability of the axiomatization of dstit from Belnap et al. (Facing the future: agents and choices in our indeterminist world. Oxford University Press, Oxford, 2001). And while the influence of the latter book on the study …Read more
  •  22
    University of Azores, Ponta Delgada, Azores, Portugal June 30–July 4, 2010
    with Eric Allender, José L. Balcázar, Shafi Goldwasser, Denis Hirschfeldt, Toniann Pitassi, and Ronald de Wolf
    Bulletin of Symbolic Logic 17 (3). 2011.
  •  19
    The theories of apartness, equality, and n-stable equality are presented through contraction- and cut-free sequent calculi. By methods of proof analysis, a purely proof-theoretic characterization of the equality fragment of apartness is obtained.
  •  18
    Glivenko sequent classes and constructive cut elimination in geometric logics
    with Giulio Fellin and Eugenio Orlandelli
    Archive for Mathematical Logic 62 (5): 657-688. 2023.
    A constructivisation of the cut-elimination proof for sequent calculi for classical, intuitionistic and minimal infinitary logics with geometric rules—given in earlier work by the second author—is presented. This is achieved through a procedure where the non-constructive transfinite induction on the commutative sum of ordinals is replaced by two instances of Brouwer’s Bar Induction. The proof of admissibility of the structural rules is made ordinal-free by introducing a new well-founded relation…Read more
  •  17
    Tychonoff's Theorem in the Framework of Formal Topologies
    with Silvio Valentini
    Journal of Symbolic Logic 62 (4): 1315-1332. 1997.
  •  17
    The theories of apartness, equality, and n-stable equality are presented through contraction- and cut-free sequent calculi. By methods of proof analysis, a purely proof-theoretic characterization of the equality fragment of apartness is obtained.
  •  16
    The Logic of Conditional Beliefs: Neighbourhood Semantics and Sequent Calculus
    with Marianna Girlando, Nicola Olivetti, and Vincent Risch
    In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11, Csli Publications. pp. 322-341. 2016.
  •  15
    Recent Advances in Proof Systems for Modal Logic
    In Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10, Csli Publications. pp. 421-422. 2014.
  •  15
    A sequent calculus methodology for systems of agency based on branching-time frames with agents and choices is proposed, starting with a complete and cut-free system for multi-agent deliberative STIT; the methodology allows a transparent justification of the rules, good structural properties, analyticity, direct completeness and decidability proofs.
  •  14
    Admissibility of Structural Rules for Contraction-Free Systems of Intuitionistic Logic
    with Roy Dyckhoff
    Journal of Symbolic Logic 65 (4): 1499-1518. 2000.
    We give a direct proof of admissibility of cut and contraction for the contraction-free sequent calculus G4ip for intuitionistic propositional logic and for a corresponding multi-succedent calculus: this proof extends easily in the presence of quantifiers, in contrast to other, indirect, proofs. i.e., those which use induction on sequent weight or appeal to admissibility of rules in other calculi.
  •  9
    A terminating intuitionistic calculus
    with Giulio Fellin
    Journal of Symbolic Logic 1-21. forthcoming.
  •  8
    Admissibility of structural rules for extensions of contraction-free sequent calculi
    with R. Dyckhoff
    Logic Journal of the IGPL 9 (4): 541-548. 2001.
    The contraction-free sequent calculus G4 for intuitionistic logic is extended by rules following a general rule-scheme for nonlogical axioms. Admissibility of structural rules for these extensions is proved in a direct way by induction on derivations. This method permits the representation of various applied logics as complete, contraction- and cut-free sequent calculus systems with some restrictions on the nature of the derivations. As specific examples, intuitionistic theories of apartness and…Read more
  •  7
    Sequent Calculus in Natural Deduction Style
    Journal of Symbolic Logic 66 (4): 1803-1816. 2001.
    A sequent calculus is given in which the management of weakening and contraction is organized as in natural deduction. The latter has no explicit weakening or contraction, but vacuous and multiple discharges in rules that discharge assumptions. A comparison to natural deduction is given through translation of derivations between the two systems. It is proved that if a cut formula is never principal in a derivation leading to the right premiss of cut, it is a subformula of the conclusion. Therefo…Read more
  •  7
    Geometric Rules in Infinitary Logic
    In Ofer Arieli & Anna Zamansky (eds.), Arnon Avron on Semantics and Proof Theory of Non-Classical Logics, Springer Verlag. pp. 265-293. 2021.
    Large portions of mathematics such as algebra and geometry can be formalized using first-order axiomatizations. In many cases it is even possible to use a very well-behaved class of first-order axioms, namely, what are called coherent or geometric implications. Such class of axioms can be translated to inference rules that can be added to a sequent calculus while preserving its structural properties. In this work, this fundamental result is extended to their infinitary generalizations as extensi…Read more