On the public citation graph

Elementary Algebraic Specifications of the Rational Function Field

0 signed · 34 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/11780274_24openalex-snapshot
Elementary Algebraic Specifications of the Rational Complex Numbers
inferredcites →https://doi.org/10.1007/3-540-44622-2_19openalex-snapshot
Disjunctive Tautologies as Synchronisation Schemes
inferredcites →https://doi.org/10.1007/3-540-45066-1openalex-snapshot
Discrete Mathematics and Theoretical Computer Science
inferredcites →https://doi.org/10.1007/3-540-62950-5_64openalex-snapshot
Rewrite systems for natural, integral, and rational arithmetic
inferredcites →https://doi.org/10.1007/978-3-540-45220-1_25openalex-snapshot
On Algebraic Specifications of Abstract Data Types
inferredcites →https://doi.org/10.1007/978-3-642-76771-5openalex-snapshot
Universal Algebra for Computer Scientists
inferredcites →https://doi.org/10.1016/0168-0072(94)00038-5openalex-snapshot
The data type variety of stack algebras
inferredcites →https://doi.org/10.1016/0304-3975(87)90123-xopenalex-snapshot
Algebraic specifications of computable and semicomputable data types
inferredcites →https://doi.org/10.1016/0304-3975(89)90024-8openalex-snapshot
On a conjecture of Bergstra and Tucker
inferredcites →https://doi.org/10.1016/0304-3975(92)90305-yopenalex-snapshot
Final algebras, cosemicomputable algebras and degrees of unsolvability
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50018-4openalex-snapshot
Algebraic Specification
inferredcites →https://doi.org/10.1016/s0019-9958(82)80021-1openalex-snapshot
The completeness of the algebraic specification methods for computable data types
inferredcites →https://doi.org/10.1016/s0049-237x(99)80028-7openalex-snapshot
Computable Rings and Fields
inferredcites →https://doi.org/10.1016/s0049-237x(99)x8015-3openalex-snapshot
Handbook of Computability Theory
inferredcites →https://doi.org/10.1016/s0168-0072(97)00040-7openalex-snapshot
Randomness, computability and algebraic specifications
inferredcites →https://doi.org/10.1016/s0304-3975(01)00189-xopenalex-snapshot
On abstract data types presented by multiequations
inferredcites →https://doi.org/10.1017/cbo9780511551574openalex-snapshot
Model Theory
inferredcites →https://doi.org/10.1017/s0960129500000517openalex-snapshot
An Oxford survey of order sorted algebra
inferredcites →https://doi.org/10.1080/00029890.2000.12005205openalex-snapshot
Recounting the Rationals
inferredcites →https://doi.org/10.1093/oso/9780198537359.003.0003openalex-snapshot
Universal Algebra
inferredcites →https://doi.org/10.1093/oso/9780198537809.003.0004openalex-snapshot
Effective algebras
inferredcites →https://doi.org/10.1137/0212024openalex-snapshot
Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
inferredcites →https://doi.org/10.1145/1219092.1219095openalex-snapshot
The rational numbers as an abstract data type
inferredcites →https://doi.org/10.1145/227683.227687openalex-snapshot
Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.1145/988071.988075openalex-snapshot
Some definitions for algebraic data type specifications
inferredcites →https://doi.org/10.46298/dmtcs.280openalex-snapshot
Simple Equational Specifications of Rational Arithmetic

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4903428openalex-extracted
Flasque Meadows
inferred← citeshttps://doi.org/10.1007/11780274_24openalex-snapshot
Elementary Algebraic Specifications of the Rational Complex Numbers
inferred← citeshttps://doi.org/10.1007/s00224-007-9035-4openalex-snapshot
Division Safe Calculation in Totalised Fields
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.015openalex-snapshot
Meadows and the equational specification of division
inferred← citeshttps://doi.org/10.1080/00927872.2025.2573809openalex-snapshot
Bridging meadows and sheaves
inferred← citeshttps://doi.org/10.1142/s0218196724500310openalex-snapshot
Towards an enumeration of finite common meadows
inferred← citeshttps://doi.org/10.1145/1219092.1219095openalex-snapshot
The rational numbers as an abstract data type
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.