A very general structure in mathematics is a function system, that is a structure J = 〈UJ ,ΩJ ,ΛJ 〉, where UJ is a finite universe set and WJ is a finite set of functions ai : U → ΛJ . In this paper we use a function system to develop a mathematical theory of the indiscernibility. More in detail, we first use a natural equivalence relation induced by any function subset A ⊆ ΩJ to introduce a complete lattice of set partitions of UJ. We prove several properties of this order structure and we develop two specific cases of study concerning directed and undirected graphs. Next, for finite function systems we introduce two approximation measures that have a deep similarity with the Lebesgue measure and with the conditional probability. Also in this case we provide two specific cases of study on directed and undirected graphs.
Indiscernibility structures induced from function sets : Graph and digraph case
Giampiero Chiaselotti
;Tommaso Gentile;Federico Infusino;Paolo A. Oliverio
2018-01-01
Abstract
A very general structure in mathematics is a function system, that is a structure J = 〈UJ ,ΩJ ,ΛJ 〉, where UJ is a finite universe set and WJ is a finite set of functions ai : U → ΛJ . In this paper we use a function system to develop a mathematical theory of the indiscernibility. More in detail, we first use a natural equivalence relation induced by any function subset A ⊆ ΩJ to introduce a complete lattice of set partitions of UJ. We prove several properties of this order structure and we develop two specific cases of study concerning directed and undirected graphs. Next, for finite function systems we introduce two approximation measures that have a deep similarity with the Lebesgue measure and with the conditional probability. Also in this case we provide two specific cases of study on directed and undirected graphs.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
