Extensionality with respect to indistinguishability operators

Extensionality is explored form different points of view. Extensional fuzzy subsets from a fuzzy equivalence relation E are considered as observable subsets with respect to the granularity generated by E. Interestingly, they are characterized as the fuzzy subsets that can be obtained as combinations of the fuzzy equivalence classes of E. Extensional mappings are characterized topologically and the set of extensional mappings between two universes are algebraically determined. Specifying the results to fuzzy mappings from a universe X onto [0, 1] an interpretation of type-2 fuzzy subsets of X as fuzzification of its type-1 fuzzy subsets is provided.Peer ReviewedPostprint (author's final draft

Aggregation operators and lipschitzian conditions

Lipschitzian aggregation operators with respect to the natural T - indistin- guishability operator Et and their powers, and with respect to the residuation ! T with respect to a t-norm T and its powers are studied. A t-norm T is proved to be E T -Lipschitzian and -Lipschitzian, and is interpreted as a fuzzy point and a fuzzy map as well. Given an Archimedean t-norm T with additive generator t , the quasi- arithmetic mean generated by t is proved to be the most stable aggregation operator with respect to TPeer Reviewe

ET-lipschitzian and ET-kernel aggregation operators

AbstractLipschitzian and kernel aggregation operators with respect to natural T-indistinguishability operators ET and their powers are studied. A t-norm T is proved to be ET-lipschitzian, and is interpreted as a fuzzy point and a fuzzy map as well. Given an archimedean t-norm T with additive generator t, the quasi-arithmetic mean generated by t is proved to be the most stable aggregation operator with respect to T

ET-Lipschitzian aggregation operators

Lipschitzian and kernel aggregation operators with respect to the natural Tindistinguishability operator ET and their powers are studied. A t-norm T is proved to be ET -lipschitzian, and is interpreted as a fuzzy point and a fuzzy map as well. Given an archimedean t-norm T with additive generator t, the quasi-arithmetic mean generated by t is proved to be the more stable aggregation operator with respect to T.Peer ReviewedPostprint (published version

Trust as a precursor to belief revision

Belief revision is concerned with incorporating new information into a pre-existing set of beliefs. When the new information comes from another agent, we must first determine if that agent should be trusted. In this paper, we define trust as a pre-processing step before revision. We emphasize that trust in an agent is often restricted to a particular domain of expertise. We demonstrate that this form of trust can be captured by associating a state partition with each agent, then relativizing all reports to this partition before revising. We position the resulting family of trust-sensitive revision operators within the class of selective revision operators of Ferme and Hansson, and we prove a representation result that characterizes the class of trust-sensitive revision operators in terms of a set of postulates. We also show that trust-sensitive revision is manipulable, in the sense that agents can sometimes have incentive to pass on misleading information

Fifty years of similarity relations: a survey of foundations and applications

On the occasion of the 50th anniversary of the publication of Zadeh's significant paper Similarity Relations and Fuzzy Orderings, an account of the development of similarity relations during this time will be given. Moreover, the main topics related to these fuzzy relations will be reviewed.Peer ReviewedPostprint (author's final draft

Quantum Mechanics, Ontology, and Non-Reflexive Logics

This is a general philosophical paper where I overview some ideas concerning the non-reflexive foundations of quan- tum mechanics (NRFQM). By NRFQM I mean formalism and an interpretation of QM that considers an involved on- tology of non-individuals as explained in the text. Thus, I do not endorse a purely instrumentalist view of QM, but believe that it speaks of something, and then I try to show that one of the plausible views of this ‘something’ is as en- tities devoid of identity conditions

Bisimulation in Inquisitive Modal Logic

Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. Technically, InqML fits within the family of logics based on team semantics. From a model-theoretic perspective, it takes us a step in the direction of monadic second-order logic, as inquisitive modal operators involve quantification over sets of worlds. We introduce and investigate the natural notion of bisimulation equivalence in the setting of InqML. We compare the expressiveness of InqML and first-order logic, and characterise inquisitive modal logic as the bisimulation invariant fragments of first-order logic over various classes of two-sorted relational structures. These results crucially require non-classical methods in studying bisimulations and first-order expressiveness over non-elementary classes.Comment: In Proceedings TARK 2017, arXiv:1707.0825