On the public citation graph
Mathematical Logic and Applications
0 signed · 11 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.
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.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19900360409openalex-snapshot
Some extensions of built‐upness on systems of fundamental sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-45091-7_7openalex-snapshot
Description Logics for Ontologies
inferred← citeshttps://doi.org/10.1007/978-3-7908-1828-4_16openalex-snapshot
Beyond Modalities: Sufficiency and Mixed Algebras
inferred← citeshttps://doi.org/10.1007/978-3-7908-1840-6_10openalex-snapshot
Logical and Algebraic Techniques for Rough Set Data Analysis
inferred← citeshttps://doi.org/10.1007/978-3-7908-1888-8_1openalex-snapshot
Introduction: What You Always Wanted to Know about Rough Sets
inferred← citeshttps://doi.org/10.1007/978-94-011-5108-5_23openalex-snapshot
Studying Incompleteness of Information: A Class of Information Logics
inferred← citeshttps://doi.org/10.1007/978-94-015-8273-5_11openalex-snapshot
Relational Semantics for Nonclassical Logics: Formulas are Relations
inferred← citeshttps://doi.org/10.1007/bf00935602openalex-snapshot
Kripke semantics for knowledge representation logics
inferred← citeshttps://doi.org/10.1016/j.apal.2003.11.009openalex-snapshot
Boolean algebras arising from information systems
inferred← citeshttps://doi.org/10.2307/2275368openalex-snapshot
Independence, randomness and the axiom of choice
inferred← citeshttps://doi.org/10.2307/2275670openalex-snapshot
The Sacks density theorem and Σ2-bounding
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.