4 found
Order:
Disambiguations
M. Fattorosi-Barnaba [5]Maurizio Fattorosi-Barnaba [2]
  1.  29
    Graded Modalities. I.M. Fattorosi-Barnaba & F. Caro - 1985 - Studia Logica 44 (2):197 - 221.
    We study a modal system ¯T, that extends the classical (prepositional) modal system T and whose language is provided with modal operators M inn (nN) to be interpreted, in the usual kripkean semantics, as there are more than n accessible worlds such that.... We find reasonable axioms for ¯T and we prove for it completeness, compactness and decidability theorems.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  2.  38
    Modal Operators with Probabilistic Interpretations, I.M. Fattorosi-Barnaba & G. Amati - 1987 - Studia Logica 46 (4):383-393.
    We present a class of normal modal calculi PFD, whose syntax is endowed with operators M r, one for each r [0,1] : if a is sentence, M r is to he read the probability that a is true is strictly greater than r and to he evaluated as true or false in every world of a F-restricted probabilistic kripkean model. Every such a model is a kripkean model, enriched by a family of regular probability evaluations with range in a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  3.  28
    An Infinitary Graded Modal Logic.Maurizio Fattorosi-Barnaba & Silvano Grassotti - 1995 - Mathematical Logic Quarterly 41 (4):547-563.
    We prove a completeness theorem for Kmath image, the infinitary extension of the graded version K0 of the minimal normal logic K, allowing conjunctions and disjunctions of countable sets of formulas. This goal is achieved using both the usual tools of the normal logics with graded modalities and the machinery of the predicate infinitary logics in a version adapted to modal logic.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  4.  25
    Graded Modalities. III (the Completeness and Compactness of S40).M. Fattorosi-Barnaba & C. Cerrato - 1988 - Studia Logica 47 (2):99 - 110.
    We go on along the trend of [2] and [1], giving an axiomatization of S4 0 and proving its completeness and compactness with respect to the usual reflexive and transitive Kripke models. To reach this results, we use techniques from [1], with suitable adaptations to our specific case.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations