On the public citation graph

Perfect extensions of regular double Stone algebras

0 signed · 36 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4615-2217-1_2openalex-snapshot
Introduction to Lattice Theory
inferredcites →https://doi.org/10.1007/bf02485414openalex-snapshot
Essential extensions and injective hulls of double Stone algebras
inferredcites →https://doi.org/10.1007/bf02485733openalex-snapshot
Injective double Stone algebras
inferredcites →https://doi.org/10.1007/bf02945029openalex-snapshot
A regular variety of type <2, 2, 1, 1, 0, 0>
inferredcites →https://doi.org/10.1016/0168-0072(89)90032-8openalex-snapshot
Varieties of complex algebras
inferredcites →https://doi.org/10.2140/pjm.1971.38.29openalex-snapshot
Representations by algebras of sections over Boolean spaces
inferredcites →https://doi.org/10.2307/2313381openalex-snapshot
Introduction to Lattice Theory.
inferredcites →https://doi.org/10.2307/2372074openalex-snapshot
Boolean Algebras with Operators
inferredcites →https://doi.org/10.2307/2372123openalex-snapshot
Boolean Algebras with Operators. Part I
inferredcites →https://doi.org/10.4064/-28-1-117-124openalex-snapshot
On connections between information systems, rough sets and algebraic logic

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-01162-8_3openalex-snapshot
Algebraic Methods for Granular Rough Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-71200-8_1openalex-snapshot
Propositional Logics from Rough Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-18859-6_7openalex-snapshot
Algebras from Rough Sets
inferred← citeshttps://doi.org/10.1007/978-3-662-54069-5_11openalex-snapshot
A Semantic Analysis of Stone and Dual Stone Negations with Regularity
inferred← citeshttps://doi.org/10.1007/978-3-662-62798-3_4openalex-snapshot
A Study of Algebras and Logics of Rough Sets Based on Classical and Generalized Approximation Spaces
inferred← citeshttps://doi.org/10.1007/978-3-7908-1888-8_5openalex-snapshot
Rough Sets and Algebras of Relations
inferred← citeshttps://doi.org/10.1007/s00500-021-06068-7openalex-snapshot
Stone algebras: 3-valued logic and rough sets
inferred← citeshttps://doi.org/10.1007/s00500-024-09767-zopenalex-snapshot
k-filters and k-$$\{^*\}$$-congruences of core regular double Stone algebras
inferred← citeshttps://doi.org/10.1007/s00500-025-10476-4openalex-snapshot
Ring structure of rough sets
inferred← citeshttps://doi.org/10.1007/s11083-011-9245-xopenalex-snapshot
A Method of Representing Rough Sets System Determined by Quasi Orders
inferred← citeshttps://doi.org/10.1007/s11225-011-9349-8openalex-snapshot
Discrete Dualities for Double Stone Algebras
inferred← citeshttps://doi.org/10.1007/s11225-016-9696-6openalex-snapshot
Kleene Algebras and Logic: Boolean and Rough Set Representations, 3-Valued, Rough Set and Perp Semantics
inferred← citeshttps://doi.org/10.1007/s11225-025-10191-zopenalex-snapshot
Orthomodular and Unsharp Orthomodular Lattices: A Categorical Equivalence
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.07.007openalex-snapshot
Proper Multi-Type Display Calculi for Rough Algebras
inferred← citeshttps://doi.org/10.1016/j.ijar.2021.05.002openalex-snapshot
Defining rough sets as core–support pairs of three-valued functions
inferred← citeshttps://doi.org/10.1016/j.ijar.2024.109170openalex-snapshot
A study of rough inclusion on algebras with quasi-Boolean base
inferred← citeshttps://doi.org/10.1016/j.ins.2020.05.074openalex-snapshot
Rough concepts
inferred← citeshttps://doi.org/10.1080/11663081.2024.2336386openalex-snapshot
Nelson algebras, residuated lattices and rough sets: A survey
inferred← citeshttps://doi.org/10.1093/jigpal/jzag038openalex-snapshot
Dualities in quasiorder-generated covering-based approximation spaces
inferred← citeshttps://doi.org/10.1142/s1793005725500309openalex-snapshot
Rough Sets: A Topological View
inferred← citeshttps://doi.org/10.1142/s1793557118500833openalex-snapshot
Ideals of core regular double Stone algebra
inferred← citeshttps://doi.org/10.2298/fil2001035bopenalex-snapshot
Constraction of a core regular double MS-algebra
inferred← citeshttps://doi.org/10.26634/jmat.12.2.20136openalex-snapshot
Tolerance based rough algebras induced by blocks
inferred← citeshttps://doi.org/10.3233/fi-2013-892openalex-snapshot
Rough Sets: Some Foundational Issues
inferred← citeshttps://doi.org/10.48550/arxiv.1511.07165openalex-snapshot
Kleene Algebras and Logic: Boolean and Rough Set Representations, 3-valued, Rough and Perp Semantics
inferred← citeshttps://doi.org/10.48550/arxiv.1710.02393openalex-snapshot
Stone and double Stone algebras: Boolean and Rough Set Representations, 3-valued and 4-valued Logics
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.