Mereotopological Connection

The paper outlines a model-theoretic framework for investigating and comparing a variety of mereotopological theories. In the first part we consider different ways of characterizing a mereotopology with respect to (i) the intended interpretation of the connection primitive, and (ii) the composition of the admissible domains of quantification (e.g., whether or not they include boundary elements). The second part extends this study by considering two further dimensions along which different patterns of topological connection can be classified—the strength of the connection and its multiplicity

Box dimension of the graph of continuous function: a necessary condition.

In questa breve nota si dimostra una condizione necessaria che deve essere soddisfatta nei punti di un sottoinsieme denso del suo insieme di definizione da una funzione reale continua di cui sia nota la dimensione frattale del diagramma

Logics with approximate premises

INTERNATIONAL J. OF INTELL. SYSTEM

Approximate Reasoning Based Similarity

MATH. LOGIC QUARTEL

Approximate reasoning based on similarity

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