Giangiacomo Gerla

This note is motivated by Whitehead’s researches in inclusion-based point-free geometry as exposed in An Inquiry Concerning the Principles of Natural Knowledge and in The concept of Nature. More precisely, we observe that Whitehead’s definition of point, based on the notions of abstractive class and covering, is not adequate. Indeed, if we admit such a definition it is also questionable that a point exists. On the contrary our approach, in which the diameter is a further primitive, enables us to avoid such a drawback. Moreover, since such a notion enables us to define a metric in the set of points, our proposal looks to be a good starting point for a foundation of the geometry metrical in nature (as proposed, for example, by L.M. Blumenthal)

A metric approach to Popper's verisimilitude question is proposed which is related to point-free geometry. Indeed, we define the theory of approximate metric spaces whose primitive notions are regions, inclusion relation, minimum distance, and maximum distance between regions. Then, we show that the class of possible scientific theories has the structure of an approximate metric space. So, we can define the verisimilitude of a theory as a function of its (approximate) distance from the truth. This avoids some of the difficulties arising from the known definitions of verisimilitude.

We propose a first order modal logic, theQS4E-logic, obtained by adding to the well-known first order modal logicQS4 arigidity axiom schemas:A → □A, whereA denotes a basic formula. In this logic, thepossibility entails the possibility of extending a given classical first order model. This allows us to express some important concepts of classical model theory, such as existential completeness and the state of being infinitely generic, that are not expressibile in classical first order logic. Since they can be expressed in -logic, we are also induced to compare the expressive powers ofQS4E and . Some questions concerning the power of rigidity axiom are also examined.

If X is set and L a lattice, then an L-subset or fuzzy subset of X is any map from X to L, [11]. In this paper we extend some notions of recursivity theory to fuzzy set theory, in particular we define and examine the concept of almost decidability for L-subsets. Moreover, we examine the relationship between imprecision and decidability. Namely, we prove that there exist infinitely indeterminate L-subsets with no more precise decidable versions and classical subsets whose unique shaded decidable versions are the L-subsets almost-everywhere indeterminate

ABSTRACT In this work the connections between the fuzzy closure operators and the graded consequence relations are examined Namely, as it is well known, in the crisp case there is a complete equivalence between the notion of closure operator and the one of consequence relation. We extend this result by proving that the graded consequence relations are related to a particular class of fuzzy closure operators, namely the class of fuzzy closure operators that can be obtained by a chain of classical closure operators

Let S be a set, P the class of all subsets of S and F the class of all fuzzy subsets of S. In this paper an “extension principle” for closure operators and, in particular, for deduction systems is proposed and examined. Namely we propose a way to extend any closure operator J defined in P into a fuzzy closure operator J* defined in F. This enables us to give the notion of canonical extension of a deduction system and to give interesting examples of fuzzy logics. In particular, the canonical extension of the classical propositional calculus is defined and it is showed its connection with possibility and necessity measures. Also, the canonical extension of first order logic enables us to extend some basic notions of programming logic, namely to define the fuzzy Herbrand models of a fuzzy program. Finally, we show that the extension principle enables us to obtain fuzzy logics related to fuzzy subalgebra theory and graded consequence relation theory