Generalized Rough Sets (Preclusivity Fuzzy-Intuitionistic (BZ) Lattices)

The standard Pawlak approach to rough set theory, as an approximation space consisting of a universe U and an equivalence (indiscernibility) relation R U x U, can be equivalently described by the induced preclusivity ("discernibility") relation U x U \ R, which is irreflexive and symmetric.We generalize the notion of approximation space as a pair consisting of a universe U and a discernibility or preclusivity (irreflexive and symmetric) relation, not necessarily induced from an equivalence relation. In this case the "elementary" sets are not mutually disjoint, but all the theory of generalized rough sets can be developed in analogy with the standard Pawlak approach. On the power set of the universe, the algebraic structure of the quasi fuzzy-intuitionistic "classical" (BZ) lattice is introduced and the sets of all "closed" and of all "open" definable sets with the associated complete (in general nondistributive) ortholattice structures are singled out.The rough approximation of any fixed subset of the universe is the pair consisting of the best "open" approximation from the bottom and the best "closed" approximation from the top. The properties of this generalized rough approximation mapping are studied in the context of quasi-BZ lattice structures of "closed-open" ordered pairs (the "algebraic logic" of generalized rough set theory), comparing the results with the standard Pawlak approach. A particular weak form of rough representation is also studied.     

A Logic for Reasoning about Relative Similarity

A similarity relation is a reflexive and symmetric binary relation between objects. Similarity is relative: it depends on the set of properties of objects used in determining their similarity or dissimilarity. A multi-modal logical language for reasoning about relative similarities is presented. The modalities correspond semantically to the upper and lower approximations of a set of objects by similarity relations corresponding to all subsets of a given set of properties of objects. A complete deduction system for the language is presented.     

Choosing what to choose from: Preference for inclusion over exclusion when constructing consideration sets from large choice sets

Decision making is a two‐stage process, consisting of, first, consideration set construction and then final choice. Decision makers can form a consideration set from a choice set using one of two strategies: including the options they wish to further consider or excluding those they do not wish to further consider. The authors propose that decision makers have a relative preference for an inclusion (vs. exclusion) strategy when choosing from large choice sets and that this preference is driven primarily by a lay belief that inclusion requires less effort than exclusion, particularly in large choice sets. Study 1 demonstrates that decision makers prefer using an inclusion (vs. exclusion) strategy when faced with large choice sets. Study 2 replicates the effect of choice set size on preference for consideration set construction strategy and demonstrates that the belief that exclusion is more effortful mediates the relative preference for inclusion in large choice sets. Studies 3 and 4 further support the importance of perceived effort, demonstrating a greater preference for inclusion in large choice sets when decision makers are primed to think about effort (vs. accuracy; Study 3) and when the choice set is perceived as requiring more effort because of more information being presented about each alternative (vs. more alternatives in the choice set; Study 4). Finally, Study 5 manipulates consideration set construction strategy, showing that using inclusion (vs. exclusion) in large choice sets leads to smaller consideration sets, greater confidence in the decision process, and a higher quality consideration set.     

Algebras of Intervals and a Logic of Conditional Assertions

Intervals in boolean algebras enter into the study of conditional assertions (or events) in two ways: directly, either from intuitive arguments or from Goodman, Nguyen and Walker's representation theorem, as suitable mathematical entities to bear conditional probabilities, or indirectly, via a representation theorem for the family of algebras associated with de Finetti's three-valued logic of conditional assertions/events. Further representation theorems forge a connection with rough sets. The representation theorems and an equivalent of the boolean prime ideal theorem yield an algebraic completeness theorem for the three-valued logic. This in turn leads to a Henkin-style completeness theorem. Adequacy with respect to a family of Kripke models for de Finetti's logic, ukasiewicz's three-valued logic and Priest's Logic of Paradox is demonstrated. The extension to first-order yields a short proof of adequacy for Körner's logic of inexact predicates.     

On Modal μ-Calculus and Non-Well-Founded Set Theory

A finitary characterization for non-well-founded sets with finite transitive closure is established in terms of a greatest fixpoint formula of the modal -calculus. This generalizes the standard result in the literature where a finitary modal characterization is provided only for wellfounded sets with finite transitive closure. The proof relies on the concept of automaton, leading then to new interlinks between automata theory and non-well-founded sets.     

人体系统非优性的进化论诠释

从进化论的角度论述了人体系统非优性的成因,说明了生物竿化在人体系统中保留下大量的时空沉迹,其形式与特征表现为层次套叠,多元集合,转化退化。从而成为新与旧,高级与低级,复杂与简单,一句话就是优 与非优相互缠绕,相互作用,互补关联的协同统一性,而疾病的发生则是这种辩证统一的失调或破坏。     

Extending Standard Models of ZFC to Models of Nonstandard Set Theories

We study those models of ZFCwhich are embeddable, as the class of all standard sets, in a model of internal set theory >ISTor models of some other nonstandard set theories. This revised version was published online in June 2006 with corrections to the Cover Date.     

Numeracy Predicts More Effortful and Elaborative Search Strategies in a Complex Risky Choice Context: A Process‐Tracing Approach

The goal of the current study was to explore information search and processing differences between individuals who are less and more numerate in an attempt to better understand the mechanisms that might differentiate the choices they make. We did so using a computerized process‐tracing system known as MouseTrace, which presented monetary gambles in an alternative × attribute matrix with outcome (dollar amount) and probability information as attributes. This information was initially occluded but could be revealed by clicking on the cell that contained the desired information. Beginning with nine gambles offering the chance of gaining or losing a specified amount, participants (N = 110) narrowed down the options (to three and then one) using an inclusion or exclusion strategy. Consistent with previous research, inclusion was a more effortful strategy, and individuals who were higher in numeracy were more likely to select prospects with the highest expected value. Process measures revealed these individuals expended more effort (i.e., attended to and sought out more information and processed it in greater depth) and exhibited more compensatory processing than those who were lower in numeracy, but this sometimes depended on whether one was asked to include or exclude. These results serve as further evidence that individuals with higher levels of numeracy often engage in more elaborative processing of the decision task, which tends to lead to more optimal choices. However, they also suggest that individuals are adaptive and that the specific situation can matter. Copyright © 2016 John Wiley & Sons, Ltd.