On the public citation graph

Algebraic Logic and Universal Algebra in Computer Science

https://doi.org/10.1007/bfb0043074
0 signed · 29 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.605openalex-snapshot
JAC: an aspect‐based distributed dynamic framework
inferred← citeshttps://doi.org/10.1006/jvlc.2000.0166openalex-snapshot
A Comparison of Inferences about Containers and Surfaces in Small-Scale and Large-Scale Spaces
inferred← citeshttps://doi.org/10.1007/11526841_27openalex-snapshot
Strategic Term Rewriting and Its Application to a Vdm-sl to Sql Conversion
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_17openalex-snapshot
Beth Definability for the Guarded Fragment
inferred← citeshttps://doi.org/10.1007/978-3-540-24771-5_9openalex-snapshot
Pointer Kleene Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-31847-7_15openalex-snapshot
Relationships Between Equational and Inductive Data Types
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_8openalex-snapshot
Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence
inferred← citeshttps://doi.org/10.1007/978-3-642-14464-6_9openalex-snapshot
Case-Based Reasoning in a Travel Medicine Application
inferred← citeshttps://doi.org/10.1007/978-94-017-0452-6_3openalex-snapshot
Algebraic Logic
inferred← citeshttps://doi.org/10.1007/bf00370684openalex-snapshot
Algebraization of quantifier logics, an introductory overview
inferred← citeshttps://doi.org/10.1007/s10469-008-9012-2openalex-snapshot
The Beth property and interpolation in lattice-based algebras and logics
inferred← citeshttps://doi.org/10.1007/s11225-006-7203-1openalex-snapshot
Definability and Interpolation in Non-Classical Logics
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90120-7openalex-snapshot
An algebraically specified language for data directed design
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00041-gopenalex-snapshot
Equational properties of Kleene algebras of relations with conversion
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90279-8openalex-snapshot
On dynamic algebras
inferred← citeshttps://doi.org/10.1016/j.artint.2007.12.003openalex-snapshot
On propositional definability
inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.019openalex-snapshot
Axiomatizability of representable domain algebras
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.09.024openalex-snapshot
The equational theory of Kleene lattices
inferred← citeshttps://doi.org/10.1016/s0049-237x(02)80051-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00027-4openalex-snapshot
Complexity of equations valid in algebras of relations part I: Strong non-finitizability
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00032-3openalex-snapshot
Notions of density that imply representability in algebraic logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00248-4openalex-snapshot
The equational logic of fixed points
inferred← citeshttps://doi.org/10.1016/s1874-5857(06)80030-0openalex-snapshot
Relevant and substructural logics
inferred← citeshttps://doi.org/10.1023/a:1004275029985openalex-snapshot
Modal Languages and Bounded Fragments of Predicate Logic
inferred← citeshttps://doi.org/10.1142/s0218196720500083openalex-snapshot
Loop conditions for strongly connected digraphs
inferred← citeshttps://doi.org/10.1556/sscmath.38.2001.1-4.20openalex-snapshot
Free Boolean algebras with closure operators and a conjecture of Henkin, Monk, and Tarski
inferred← citeshttps://doi.org/10.2307/2275853openalex-snapshot
Cylindric modal logic
inferred← citeshttps://doi.org/10.2307/2586507openalex-snapshot
Interpolation, preservation, and pebble games
inferred← citeshttps://doi.org/10.4064/-28-1-95-116openalex-snapshot
What the finitization problem is not
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.