Switch to: References

Add citations

You must login to add citations.
  1. Granular knowledge and rational approximation in general rough sets – I.A. Mani - 2024 - Journal of Applied Non-Classical Logics 34 (2):294-329.
    Rough sets are used in numerous knowledge representation contexts and are then empowered with varied ontologies. These may be intrinsically associated with ideas of rationality under certain conditions. In recent papers, specific granular generalisations of graded and variable precision rough sets are investigated by the present author from the perspective of rationality of approximations (and the associated semantics of rationality in approximate reasoning). The studies are extended to ideal-based approximations (sometimes referred to as subsethood-based approximations). It is additionally shown that (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Crypto-preorders, topological relations, information and logic.Piero Pagliani - 2024 - Journal of Applied Non-Classical Logics 34 (2):330-367.
    As is well known, any preorder R on a set U induces an Alexandrov topology on U. In some interesting cases related to data mining an Alexandrov topology can be transformed into different types of logico-algebraic models. In some cases, (pre)topological operators provided by Pointless Topology may define a topological space on U even if R is not a preorder. If this is the case, then we call R a crypto-preorder. The paper studies the conditions under which a relation R (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Handbook of Logical Thought in India.Sundar Sarukkai & Mihir Chakraborty (eds.) - 2018 - New Delhi, India: Springer.
    Download  
     
    Export citation  
     
    Bookmark  
  • Information Completeness in Nelson Algebras of Rough Sets Induced by Quasiorders.Jouni Järvinen, Piero Pagliani & Sándor Radeleczki - 2013 - Studia Logica 101 (5):1073-1092.
    In this paper, we give an algebraic completeness theorem for constructive logic with strong negation in terms of finite rough set-based Nelson algebras determined by quasiorders. We show how for a quasiorder R, its rough set-based Nelson algebra can be obtained by applying Sendlewski’s well-known construction. We prove that if the set of all R-closed elements, which may be viewed as the set of completely defined objects, is cofinal, then the rough set-based Nelson algebra determined by the quasiorder R forms (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Advances in Natural Deduction: A Celebration of Dag Prawitz's Work.Luiz Carlos Pereira & Edward Hermann Haeusler (eds.) - 2012 - Dordrecht, Netherland: Springer.
    This collection of papers, celebrating the contributions of Swedish logician Dag Prawitz to Proof Theory, has been assembled from those presented at the Natural Deduction conference organized in Rio de Janeiro to honour his seminal research. Dag Prawitz’s work forms the basis of intuitionistic type theory and his inversion principle constitutes the foundation of most modern accounts of proof-theoretic semantics in Logic, Linguistics and Theoretical Computer Science. The range of contributions includes material on the extension of natural deduction with higher-order (...)
    Download  
     
    Export citation  
     
    Bookmark