891 citations
- O. Kouznetsov3 profiles21 · h 40
- V. Obraztsov2 profiles18 · h 43
- A. Ballestrero2 profiles17 · h 36
- A. Pullia4 profiles17 · h 37
- A. Tonazzo3 profiles17 · h 59
- A. Zalewska2 profiles17 · h 37
- M. Bonesini2 profiles17 · h 49
- M. Paganoni2 profiles17 · h 118
- A. Andreazza2 profiles16 · h 101
- A. Augustinus3 profiles16 · h 89
- A. Baroncelli2 profiles16 · h 108
- A. Behrmann2 profiles16 · h 23
- Istituto Nazionale di Fisica Nucleare, Sezione di TorinoIT65 papers
- European Organization for Nuclear ResearchCH28 papers
- Centre National de la Recherche ScientifiqueFR27 papers
- Joint Institute for Nuclear ResearchRU26 papers
- Charles UniversityCZ24 papers
- CEA Paris-SaclayFR23 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR23 papers
- Istituto Nazionale di Fisica Nucleare, Sezione di PadovaIT23 papers
- University of PaduaIT22 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR21 papers
- Karlsruhe Institute of TechnologyDE21 papers
- University of WarsawPL21 papers
4 papers · 1 filter
Taming Modal Impredicativity: Superlazy Reduction
Ugo Dal Lago, Luca Roversi, Luca Vercelli
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is considered as computation. We introduce modal impredicativity as a new form of impredicativi…
Weak Affine Light Typing is complete with respect to Safe Recursion on Notation
Luca Roversi
Weak affine light typing (WALT) assigns light affine linear formulae as types to a subset of lambda-terms of System F. WALT is poly-time sound: if a lambda-term M has type in WALT,…
Analytic Tableaux Calculi for KLM Logics of Nonmonotonic Reasoning
Laura Giordano, Valentina Gliozzi, Nicola Olivetti +1
We present tableau calculi for some logics of nonmonotonic reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for all KLM logics, namely prefere…
A Sequent Calculus and a Theorem Prover for Standard Conditional Logics
Nicola Olivetti, Gian Luca Pozzato, Camilla Schwind
In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional logics, namely CK, CK+ID, CK+MP and CK+MP+ID. The calculus uses labels and transiti…