18 found
Sort by:
  1. Fabio Bellissima (1999). Epimoric Ratios and Greek Musical Theory. In. In Maria Luisa Dalla Chiara (ed.), Language, Quantum, Music. 303--326.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  2. Fabio Bellissima & Saverio Cittadini (1999). Finite Trees in Tense Logic. Studia Logica 62 (2):121-140.
    In this paper we show the adequacy of tense logic with unary operators for dealing with finite trees. We prove that models on finite trees can be characterized by tense formulas, and describe an effective method to find an axiomatization of the theory of a given finite tree in tense logic. The strength of the characterization is shown by proving that adding the binary operators "Until" and "Since" to the language does not result in a better description than that given (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  3. Fabio Bellissima & Saverio Cittadini (1999). Minimal P-Morphic Images, Axiomatizations and Coverings in the Modal Logic K. Studia Logica 62 (3):371-398.
    We define the concepts of minimal p-morphic image and basic p-morphism for transitive Kripke frames. These concepts are used to determine effectively the least number of variables necessary to axiomatize a tabular extension of K4, and to describe the covers and co-covers of such a logic in the lattice of the extensions of K4.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  4. Fabio Bellissima & Saverio Cittadini (1998). Duality and Completeness for US-Logics. Notre Dame Journal of Formal Logic 39 (2):231-242.
    The semantics of e-models for tense logics with binary operators for `until' and `since' (US-logics) was introduced by Bellissima and Bucalo in 1995. In this paper we show the adequacy of these semantics by proving a general Henkin-style completeness theorem. Moreover, we show that for these semantics there holds a Stone-like duality theorem with the algebraic structures that naturally arise from US-logics.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  5. Fabio Bellissima & Saverio Cittadini (1997). Minimal Axiomatization in Modal Logic. Mathematical Logic Quarterly 43 (1):92-102.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  6. Fabio Bellissima & Anna Bucalo (1995). A Distinguishable Model Theorem for the Minimal US-Tense Logic. Notre Dame Journal of Formal Logic 36 (4):585-594.
    A new concept of model for the US-tense logic is introduced, in which ternary relations of betweenness are adjoined to the usual early-later relation. The class of these new models, which contains the class of Kripke models, satisfies, contrary to that, the Distinguishable Model Theorem, in the sense that each model is equivalent to a model in which no two points verify exactly the same formulas.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  7. Fabio Bellissima & Alessandra Ciupi (1992). On the Inadequacy of the Relational Semantic for the “Until” Operator. Mathematical Logic Quarterly 38 (1):247-252.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  8. Fabio Bellissima (1990). Post Complete and 0-Axiomatizable Modal Logics. Annals of Pure and Applied Logic 47 (2):121-144.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  9. Fabio Bellissima (1989). Two Classes of Intermediate Propositional Logics Without Disjunction Property. Archive for Mathematical Logic 28 (1):23-33.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  10. Fabio Bellissima (1989). Infinite Sets of Nonequivalent Modalities. Notre Dame Journal of Formal Logic 30 (4):574-582.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  11. Fabio Bellissima & Massimo Mirolli (1989). A General Treatment of Equivalent Modalities. Journal of Symbolic Logic 54 (4):1460-1471.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  12. Fabio Bellissima (1988). Finite and Finitely Separable Intermediate Propositional Logics. Journal of Symbolic Logic 53 (2):403-420.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  13. Fabio Bellissima (1988). On the Lattice of Extensions of the Modal Logics KAltn. Archive for Mathematical Logic 27 (2):107-114.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  14. Fabio Bellissima (1986). Finitely Generated Free Heyting Algebras. Journal of Symbolic Logic 51 (1):152-165.
    The aim of this paper is to give, using the Kripke semantics for intuitionism, a representation of finitely generated free Heyting algebras. By means of the representation we determine in a constructive way some set of "special elements" of such algebras. Furthermore, we show that many algebraic properties which are satisfied by the free algebra on one generator are not satisfied by free algebras on more than one generator.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  15. Fabio Bellissima (1985). A Test to Determine Distinct Modalities in the Extensions of S4. Mathematical Logic Quarterly 31 (1‐6):57-61.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  16. Fabio Bellissima (1984). Atoms in Modal Algebras. Mathematical Logic Quarterly 30 (19‐24):303-312.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  17. Fabio Bellissima (1984). On the Relationship Between One-Point Frames and Degrees of Unsatisfiability of Modal Formulas. Notre Dame Journal of Formal Logic 25 (2):117-126.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  18. Fabio Bellissima & Massimo Mirolli (1983). On the Axiomatization of Finitek-Frames. Studia Logica 42 (4):383 - 388.
    We find a short way to construct a formula which axiomatizes a given finite frame of the modal logicK, in the sense that for each finite frameA, we construct a formula A which holds in those and only those frames in which every formula true inA holds.To obtain this result we find, for each finite model and each natural numbern, a formula which holds in those and only those models in which every formula true in , and involving the firstn (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation