On the public citation graph

Adas and the equational theory of if-then-else

0 signed · 47 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-4612-4962-7openalex-snapshot
Algebraic Approaches to Program Semantics
inferredcites →https://doi.org/10.1007/978-1-4612-5983-1openalex-snapshot
The Science of Programming
inferredcites →https://doi.org/10.1007/978-3-642-82921-5_4openalex-snapshot
Notes on Communicating Sequential Systems
inferredcites →https://doi.org/10.1007/bf01110209openalex-snapshot
Stone duality for primal algebra theory
inferredcites →https://doi.org/10.1007/bf01180250openalex-snapshot
Generalized ?Boolean? theory of universal algebras
inferredcites →https://doi.org/10.1007/bf01187560openalex-snapshot
Guard modules
inferredcites →https://doi.org/10.1007/bf01190256openalex-snapshot
The algebra of conditional logic
inferredcites →https://doi.org/10.1007/bf01190851openalex-snapshot
Actions of Boolean rings on sets
inferredcites →https://doi.org/10.1007/bf02414856openalex-snapshot
p-Rings and their Boolean-vector representation
inferredcites →https://doi.org/10.1016/0021-8693(70)90084-0openalex-snapshot
On modules over a semiring
inferredcites →https://doi.org/10.1016/s0049-237x(08)72018-4openalex-snapshot
A Basis for a Mathematical Theory of Computation )
inferredcites →https://doi.org/10.1016/s0049-237x(09)70099-0openalex-snapshot
A Basis for a Mathematical Theory of Computation
inferredcites →https://doi.org/10.1017/cbo9780511569821openalex-snapshot
Predicate Transformer Semantics
inferredcites →https://doi.org/10.1073/pnas.50.5.869openalex-snapshot
FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
inferredcites →https://doi.org/10.1090/s0002-9947-1904-1500675-4openalex-snapshot
Sets of Independent Postulates for the Algebra of Logic
inferredcites →https://doi.org/10.1090/s0002-9947-1936-1501865-8openalex-snapshot
The theory of representations for Boolean algebras
inferredcites →https://doi.org/10.1137/0212047openalex-snapshot
Varieties of ”If-Then-Else“
inferredcites →https://doi.org/10.1137/0216025openalex-snapshot
On the Axiomatization of “If-Then-Else”
inferredcites →https://doi.org/10.1137/0216033openalex-snapshot
Equational Bases for If–Then–Else
inferredcites →https://doi.org/10.1215/s0012-7094-37-00335-1openalex-snapshot
A representation of generalized Boolean rings

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.70026openalex-snapshot
A Common External Framework for Kleene and McCarthy Algebras
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_124openalex-snapshot
Fatal errors in conditional expressions
inferred← citeshttps://doi.org/10.1007/978-3-642-02282-1_3openalex-snapshot
Barycentric Algebras and Gene Expression
inferred← citeshttps://doi.org/10.1007/s00012-018-0490-3openalex-snapshot
Monoids of non-halting programs with tests
inferred← citeshttps://doi.org/10.1007/s00012-020-0648-7openalex-snapshot
On the structure of C-algebras through atomicity and if-then-else
inferred← citeshttps://doi.org/10.1007/s000120050065openalex-snapshot
Sets with B -action and linear algebra
inferred← citeshttps://doi.org/10.1007/s000120050082openalex-snapshot
Radical classes of algebras with B -action
inferred← citeshttps://doi.org/10.1007/s11277-024-11666-3openalex-snapshot
Characterizations of Lattice Ordered Semigroups in Pre-A*_Algebras-A Math Technique in Communication Technology
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.08.007openalex-snapshot
Monoids with tests and the algebra of possibly non-halting programs
inferred← citeshttps://doi.org/10.1090/conm/721/14509openalex-snapshot
Convex sets and barycentric algebras
inferred← citeshttps://doi.org/10.1142/s0218196709005354openalex-snapshot
SEMIGROUPS WITH if–then–else AND HALTING PROGRAMS
inferred← citeshttps://doi.org/10.1142/s0218196717500138openalex-snapshot
Axiomatization of if-then-else over possibly non-halting programs and tests
inferred← citeshttps://doi.org/10.1142/s0218196719500255openalex-snapshot
Algebraic properties of if-then-else and commutative three-valued tests
inferred← citeshttps://doi.org/10.25077/jmu.4.1.115-121.2015openalex-snapshot
PRA A -MODUL ATAS PRA A -ALJABAR DAN ALJABAR IF-THEN-ELSE ATAS PRA A -ALJABAR
inferred← citeshttps://doi.org/10.26389/ajsrp.b140921openalex-snapshot
المثاليات الضبابية في جبور * Pre A
inferred← citeshttps://doi.org/10.3923/aja.2011.1.11openalex-snapshot
Lattice in Pre A*-Algebra
inferred← citeshttps://doi.org/10.3923/ajaps.2011.89.96openalex-snapshot
Logic Circuits and Gates in Pre A*-Algebra
inferred← citeshttps://doi.org/10.3923/ajms.2010.249.253openalex-snapshot
Subdirect Representations in A*-Algebras
inferred← citeshttps://doi.org/10.3923/ajms.2012.150.157openalex-snapshot
Boolean Centre of Pre A*-Algebra
inferred← citeshttps://doi.org/10.3923/ajms.2013.23.32openalex-snapshot
Partial Orders Fascinating on Pre A*-Algebra
inferred← citeshttps://doi.org/10.3923/ajms.2014.29.34openalex-snapshot
Pre A*-Homomorphism
inferred← citeshttps://doi.org/10.3923/ajsr.2010.249.257openalex-snapshot
Semilattice Structure on Pre A*-Algebra
inferred← citeshttps://doi.org/10.3923/tasr.2011.108.120openalex-snapshot
Prime and Maximal Ideals of Pre A*-Algebra
inferred← citeshttps://doi.org/10.48550/arxiv.1609.00132openalex-snapshot
Axiomatization of if-then-else over possibly non-halting programs and tests
inferred← citeshttps://doi.org/10.48550/arxiv.1702.05752openalex-snapshot
Axiomatization of if-then-else over monoids of possibly non-halting programs and tests
inferred← citeshttps://doi.org/10.5897/ajmcsr.9000100openalex-snapshot
Pre A*-Algebra as a Poset
inferred← citeshttps://doi.org/10.5897/ajmcsr.9000119openalex-snapshot
Some structural compatibilities of pre A*-algebra
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.