Order:
Disambiguations
Loredana Biacino [9]L. Biacino [1]
  1.  12
    Connection Structures: Grzegorczyk's and Whitehead's Definitions of Point.Loredana Biacino & Giangiacomo Gerla - 1996 - Notre Dame Journal of Formal Logic 37 (3):431-439.
    Whitehead, in his famous book Process and Reality, proposed a definition of point assuming the concepts of "region" and "connection relation" as primitive. Several years after and independently Grzegorczyk, in a brief but very interesting paper, proposed another definition of point in a system in which the inclusion relation and the relation of being separated were assumed as primitive. In this paper we compare their definitions and we show that, under rather natural assumptions, they coincide.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  2.  27
    Connection Structures: Grzegorczyk’s and Whitehead’s Definitions of Point.Loredana Biacino & Giangiacomo Gerla - 1991 - Notre Dame Journal of Formal Logic 32 (2):242-247.
    Whitehead, in his famous book "Process and Reality", proposed a definition of point assuming the concepts of “region” and “connection relation” as primitive. Several years after and independently Grzegorczyk, in a brief but very interesting paper proposed another definition of point in a system in which the inclusion relation and the relation of being separated were assumed as primitive. In this paper we compare their definitions and we show that, under rather natural assumptions, they coincide.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  3.  18
    Fuzzy Logic, Continuity and Effectiveness.Loredana Biacino & Giangiacomo Gerla - 2002 - Archive for Mathematical Logic 41 (7):643-667.
    It is shown the complete equivalence between the theory of continuous (enumeration) fuzzy closure operators and the theory of (effective) fuzzy deduction systems in Hilbert style. Moreover, it is proven that any truth-functional semantics whose connectives are interpreted in [0,1] by continuous functions is axiomatizable by a fuzzy deduction system (but not by an effective fuzzy deduction system, in general).
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  4.  27
    Recursively Enumerable L‐Sets.Loredana Biacino & Giangiacomo Gerla - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (2):107-113.
  5.  18
    Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets.Loredana Biacino & Giangiacomo Gerla - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (1):49-62.
  6.  4
    Recursively Enumerable L-Sets.Loredana Biacino & Giangiacomo Gerla - 1987 - Mathematical Logic Quarterly 33 (2):107-113.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  7.  6
    Decidability, Recursive Enumerability and Kleene Hierarchy For L‐Subsets.Loredana Biacino & Giangiacomo Gerla - 1989 - Mathematical Logic Quarterly 35 (1):49-62.
  8.  12
    Approximate Reasoning Based on Similarity.M. Ying, L. Biacino & G. Gerla - 2000 - Mathematical Logic Quarterly 46 (1):77-86.
    The connection between similarity logic and the theory of closure operators is examined. Indeed one proves that the consequence relation defined in [14] can be obtained by composing two closure operators and that the resulting operator is still a closure operator. Also, we extend any similarity into a similarity which is compatible with the logical equivalence, and we prove that this gives the same consequence relation.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark