On the public citation graph

On the smooth calculation of relational recursive expressions out of first-order non-constructive specifications involving quantifiers

https://doi.org/10.1007/bfb0039715
0 signed · 25 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-4471-3227-1_16openalex-snapshot
Comparing Two Different Approaches to Products in Abstract Relation Algebra
inferredcites →https://doi.org/10.1007/978-3-642-83608-4openalex-snapshot
Relationen und Graphen
inferredcites →https://doi.org/10.1007/bf00370681openalex-snapshot
The origin of relation algebras in the development and axiomatization of the calculus of relations
inferredcites →https://doi.org/10.1007/bf00370684openalex-snapshot
Algebraization of quantifier logics, an introductory overview
inferredcites →https://doi.org/10.1016/0012-365x(85)90064-0openalex-snapshot
Relation algebras: Concept of points and representability
inferredcites →https://doi.org/10.1016/0168-0072(83)90055-6openalex-snapshot
A sequent calculus for relation algebras
inferredcites →https://doi.org/10.1090/bullopenalex-snapshot
Bulletin of the American Mathematical Society
inferredcites →https://doi.org/10.1090/pspum/025/0376346openalex-snapshot
Cylindric algebras and related structures
inferredcites →https://doi.org/10.2307/1969375openalex-snapshot
The Representation of Relational Algebras
inferredcites →https://doi.org/10.2307/2266341openalex-snapshot
Louise H. Chin and Alfred Tarski. Distributive and modular laws in the arithmetic of relation algebras. University of California publications in mathematics, n.s. vol. 1 no. 9 (1951), pp. 341–384.
inferredcites →https://doi.org/10.2307/2268577openalex-snapshot
On the calculus of relations
inferredcites →https://doi.org/10.2307/2271948openalex-snapshot
Projective algebra and the calculus of relations
inferredcites →https://doi.org/10.2307/2371742openalex-snapshot
Projective Algebra I
inferredcites →https://doi.org/10.2307/2372123openalex-snapshot
Boolean Algebras with Operators. Part I
inferredcites →https://doi.org/10.3233/fi-1986-9104openalex-snapshot
The Weakest Prespecification, Part I

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-46508-1_12openalex-snapshot
An Equational Re-engineering of Set Theories
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_147openalex-snapshot
From specifications to programs: A fork-algebraic approach to bridge the gap
inferred← citeshttps://doi.org/10.1007/3-540-62064-8_19openalex-snapshot
Adding design strategies to fork algebras
inferred← citeshttps://doi.org/10.1007/978-1-4471-1486-4_5openalex-snapshot
Semantic Optimization of Queries in Deductive Object-Oriented Database
inferred← citeshttps://doi.org/10.1007/978-3-540-24615-2_5openalex-snapshot
An Environment for Specifying Properties of Dyadic Relations and Reasoning about Them I: Language Extension Mechanisms
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00299-xopenalex-snapshot
A short proof of representability of fork algebras
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00147-1openalex-snapshot
Layered map reasoning
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80932-0openalex-snapshot
Refinement and Development of Programs from Relational Specifications
inferred← citeshttps://doi.org/10.1093/jigpal/6.2.227openalex-snapshot
Representability and program construction within fork algebras
inferred← citeshttps://doi.org/10.3233/fi-1997-32101openalex-snapshot
Fork Algebras in Algebra, Logic and Computer Science
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.