11 found
Sort by:
  1. V. Michele Abrusci (2014). On Hilbert's Axiomatics of Propositional Logic. Perspectives on Science 22 (1):115-132.
    Hilbert's conference lectures during the year 1922, Neuebegründung der Mathematik. Erste Mitteilung and Die logischen Grundlagen der Mathematik (both are published in (Hilbert [1935] 1965) pp. 157-195), contain his first public presentation of an axiom system for propositional logic, or at least for a fragment of propositional logic, which is largely influenced by the study on logical woks of Frege and Russell during the previous years.The year 1922 is at the beginning of Hilbert's foundational program in its definitive form. The (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  2. V. Michele Abrusci (2002). Classical Conservative Extensions of Lambek Calculus. Studia Logica 71 (3):277 - 314.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  3. V. Michele Abrusci & Paul Ruet (1999). Non-Commutative Logic I: The Multiplicative Fragment. Annals of Pure and Applied Logic 101 (1):29-64.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  4. V. Michele Abrusci & Elena Maringelli (1998). A New Correctness Criterion for Cyclic Proof Nets. Journal of Logic, Language and Information 7 (4):449-459.
    We define proof nets for cyclic multiplicative linear logic as edge bi-coloured graphs. Our characterization is purely graph theoretical and works without further complication for proof nets with cuts, which are usually harder to handle in the non-commutative case. This also provides a new characterization of the proof nets for the Lambek calculus (with the empty sequence) which simply are a restriction on the formulas to be considered (which are asked to be intuitionistic).
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  5. V. Michele Abrusci (1991). Phase Semantics and Sequent Calculus for Pure Noncommutative Classical Linear Propositional Logic. Journal of Symbolic Logic 56 (4):1403-1451.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  6. V. Michele Abrusci (1990). A Comparison Between Lambek Syntactic Calculus and Intuitionistic Linear Propositional Logic. Mathematical Logic Quarterly 36 (1):11-15.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  7. V. Michele Abrusci (1990). Non‐Commutative Intuitionistic Linear Logic. Mathematical Logic Quarterly 36 (4):297-318.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  8. V. Michele Abrusci, Jean-Yves Girard & Jacques Van De Wiele (1990). Some Uses of Dilators in Combinatorial Problems. II. Journal of Symbolic Logic 55 (1):32-40.
    We study increasing F-sequences, where F is a dilator: an increasing F-sequence is a sequence (indexed by ordinal numbers) of ordinal numbers, starting with 0 and terminating at the first step x where F(x) is reached (at every step x + 1 we use the same process as in decreasing F-sequences, cf. [2], but with "+ 1" instead of "- 1"). By induction on dilators, we shall prove that every increasing F-sequence terminates and moreover we can determine for every dilator (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  9. V. Michele Abrusci, Jean-Yves Girard & Jacques Van De Wiele (1990). Some Uses of Dilators in Combinatorial Problems. II. Journal of Symbolic Logic 55 (1):32 - 40.
    We study increasing F-sequences, where F is a dilator: an increasing F-sequence is a sequence (indexed by ordinal numbers) of ordinal numbers, starting with 0 and terminating at the first step x where F(x) is reached (at every step x + 1 we use the same process as in decreasing F-sequences, cf. [2], but with "+ 1" instead of "- 1"). By induction on dilators, we shall prove that every increasing F-sequence terminates and moreover we can determine for every dilator (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  10. V. Michele Abrusci (1989). Some Uses of Dilators in Combinatorial Problems. Archive for Mathematical Logic 29 (2):85-109.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation