76,423 research outputs found

    Category-based induction in conceptual spaces

    Get PDF
    Category-based induction is an inferential mechanism that uses knowledge of conceptual relations in order to estimate how likely is for a property to be projected from one category to another. During the last decades, psychologists have identified several features of this mechanism, and they have proposed different formal models of it. In this article; we propose a new mathematical model for category-based induction based on distances on conceptual spaces. We show how this model can predict most of the properties of this kind of reasoning while providing a solid theoretical foundation for it. We also show that it subsumes some of the previous models proposed in the literature and that it generates new predictions

    Dual Logic Concepts based on Mathematical Morphology in Stratified Institutions: Applications to Spatial Reasoning

    Full text link
    Several logical operators are defined as dual pairs, in different types of logics. Such dual pairs of operators also occur in other algebraic theories, such as mathematical morphology. Based on this observation, this paper proposes to define, at the abstract level of institutions, a pair of abstract dual and logical operators as morphological erosion and dilation. Standard quantifiers and modalities are then derived from these two abstract logical operators. These operators are studied both on sets of states and sets of models. To cope with the lack of explicit set of states in institutions, the proposed abstract logical dual operators are defined in an extension of institutions, the stratified institutions, which take into account the notion of open sentences, the satisfaction of which is parametrized by sets of states. A hint on the potential interest of the proposed framework for spatial reasoning is also provided.Comment: 36 page

    Relational Parametricity for Computational Effects

    Get PDF
    According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relational parametricity, introduced by Reynolds, is one possible mathematical formulation of this idea. Relational parametricity provides a powerful tool for establishing data abstraction properties, proving equivalences of datatypes, and establishing equalities of programs. Such properties have been well studied in a pure functional setting. Many programs, however, exhibit computational effects, and are not accounted for by the standard theory of relational parametricity. In this paper, we develop a foundational framework for extending the notion of relational parametricity to programming languages with effects.Comment: 31 pages, appears in Logical Methods in Computer Scienc

    Relational Graph Models at Work

    Full text link
    We study the relational graph models that constitute a natural subclass of relational models of lambda-calculus. We prove that among the lambda-theories induced by such models there exists a minimal one, and that the corresponding relational graph model is very natural and easy to construct. We then study relational graph models that are fully abstract, in the sense that they capture some observational equivalence between lambda-terms. We focus on the two main observational equivalences in the lambda-calculus, the theory H+ generated by taking as observables the beta-normal forms, and H* generated by considering as observables the head normal forms. On the one hand we introduce a notion of lambda-K\"onig model and prove that a relational graph model is fully abstract for H+ if and only if it is extensional and lambda-K\"onig. On the other hand we show that the dual notion of hyperimmune model, together with extensionality, captures the full abstraction for H*

    A predicative variant of a realizability tripos for the Minimalist Foundation.

    Get PDF
    open2noHere we present a predicative variant of a realizability tripos validating the intensional level of the Minimalist Foundation extended with Formal Church thesis.the file attached contains the whole number of the journal including the mentioned pubblicationopenMaietti, Maria Emilia; Maschio, SamueleMaietti, MARIA EMILIA; Maschio, Samuel
    • 

    corecore