19
Views
0
CrossRef citations to date
0
Altmetric
Articles

Crypto-preorders, topological relations, information and logic

ORCID Icon
Pages 330-367 | Received 29 May 2023, Accepted 07 Oct 2023, Published online: 17 Apr 2024

References

  • Barwise, J., & Seligman, J. (1997). Information flow: The logic of distributed systems. Cambridge University Press.
  • Erné, M., Koslowski, J., Melton, A., & Strecker, G. E. (1993). Annals of the New York academy of sciences. Papers on General Topology and Applications, 704(1), 103–125.
  • Järvinen, J., Pagliani, P., & Radeleczki, S. (2013). Information completeness in Nelson algebras of rough sets induced by quasiorders. Studia Logica, 101(5), 1073–1092. doi: 10.1007/s11225-012-9421-z
  • Lawvere, F. W. (1969). Adjointness in foundations. Dialectica, 23(3-4), 281–296. https://doi.org/10.1111/dltc.1969.23.issue-3-4
  • Lawvere, F. W. (1986). Introduction to V. Lawvere & S. Schanuel (Eds.), Categories in continuum physics (Buffalo 1982), LNM 1174 (pp. 1–16). Springer-Verlag.
  • Lawvere, F. W. (1991). Intrinsic co-Heyting boundaries and the Leibniz rule in certain toposes. In A. Carboni, M. C. Pedicchio, & G. Rosolini (Eds.), Category theory (Como 1990), LNM 1488 (pp. 279–297). Springer-Verlag.
  • Lin, T. Y. (2004). Mining un-interpreted associations rules by linear inequalities. In S. Tsumoto, R. Sowiski, J. Komorowski, & J.W. Grzymała-Busse (Eds.), Rough sets and current trends in computing. RSCTC 2004. Lecture Notes in Computer Science (Vol. 3066, pp. 285–294). Springer.
  • Pagliani, P. (1998). Intrinsic co-heyting boundaries and information incompleteness in rough set analysis. In L. Polkowski & A. Skowron (Eds.), Rough sets and current trends in computing. RSCTC 1998. Lecture Notes in Computer Science (Vol. 1424, pp. 123–130). Springer.
  • Pagliani, P. (2014). The relational construction of conceptual patterns – tools, implementation and theory. In M. Kryszkiewicz, C. Cornelis, D. Ciucci, J. Medina-Moreno, H. Motoda, & Z.W. Ra (Eds.), Rough sets and intelligent systems paradigms. RSEISP 2014. Lecture Notes in Computer Science (Vol. 8537, pp. 14–27). Springer.
  • Pagliani, P. (2016). Covering rough sets and formal topology – a uniform approach through intensional and extensional constructors. In Transactions on rough sets, XX (pp. 109–145). Springer-Verlag.
  • Pagliani, P. (2018). Three lessons on the topological and algebraic hidden core of rough set theory. In A. Mani, G. Cattaneo, & I. Dntsch (Eds.), Algebraic methods in general rough sets (pp. 337–415). Springer Trends in Mathematics.
  • Pagliani, P., & Chakraborty, M. K. (2008). A geometry of approximation. Trends in logic (Vol. 27). Springer.
  • Pawlak, Z. (1991). Rough sets: Theoretical aspects of reasoning about data. Kluwer Academic Publishing.
  • Pratt, V. (1999). Chu spaces from the representational viewpoint. Annals of Pure and Applied Logic, 96(1-3), 319–333. https://doi.org/10.1016/S0168-0072(98)00043-8
  • Sambin, G. (1987). Intuitionistic formal spaces – a first communication. In D. Skordev (Ed.), Mathematical logic and its applications (pp. 187–204). Plenum.
  • Sambin, G., & Gebellato, S. (1998). A preview of the basic picture: A new perspective on formal topology. In TYPES '98 (pp. 194–207). Springer LNCS 1657.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.