On the public citation graph

Nominal Algebra and the HSP Theorem

0 signed · 44 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-3-540-73445-1_12openalex-snapshot
A Formal Calculus for Informal Equality with Binding
inferredcites →https://doi.org/10.1007/s00165-007-0056-1openalex-snapshot
Capture-avoiding substitution as a nominal algebra
inferredcites →https://doi.org/10.1007/s001650200016openalex-snapshot
A New Approach to Abstract Syntax with Variable Binding
inferredcites →https://doi.org/10.1016/0304-3975(93)90091-7openalex-snapshot
Combinatory reduction systems: introduction and survey
inferredcites →https://doi.org/10.1016/j.entcs.2007.02.009openalex-snapshot
Nominal Equational Logic
inferredcites →https://doi.org/10.1016/j.ic.2006.12.002openalex-snapshot
Nominal rewriting
inferredcites →https://doi.org/10.1016/j.jal.2005.10.012openalex-snapshot
Fresh Logic: proof-theory and semantics for FM and nominal techniques
inferredcites →https://doi.org/10.1016/j.tcs.2004.06.016openalex-snapshot
Nominal unification
inferredcites →https://doi.org/10.1016/s0304-3975(97)00143-6openalex-snapshot
Higher-order rewrite systems and their confluence
inferredcites →https://doi.org/10.1016/s0304-3975(97)00170-9openalex-snapshot
An algebraic generalization of Frege structures — binding algebras
inferredcites →https://doi.org/10.1016/s0890-5401(03)00138-xopenalex-snapshot
Nominal logic, a first order theory of names and binding
inferredcites →https://doi.org/10.1017/s0305004100013463openalex-snapshot
On the Structure of Abstract Algebras
inferredcites →https://doi.org/10.1093/logcom/exm064openalex-snapshot
One-and-a-halfth-order Logic
inferredcites →https://doi.org/10.1109/lics.2006.16openalex-snapshot
Boolean Algebras for Lambda Calculus
inferredcites →https://doi.org/10.1145/772062.772067openalex-snapshot
Topological incompleteness and order incompleteness of the lambda calculus
inferredcites →https://doi.org/10.2307/2322184openalex-snapshot
A Course in Universal Algebra.
inferredcites →https://doi.org/10.6100/ir630460openalex-snapshot
Logical calculi for reasoning with binding

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-17127-8_23openalex-snapshot
Equational Axiomatization of Algebras with Structure
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_33openalex-snapshot
Equational Reasoning Modulo Commutativity in Languages with Binders
inferred← citeshttps://doi.org/10.1007/978-3-642-22944-2_14openalex-snapshot
Stone Duality for Nominal Boolean Algebras with И
inferred← citeshttps://doi.org/10.1007/978-94-007-6600-6_2openalex-snapshot
Nominal Terms and Nominal Logics: From Foundations to Meta-mathematics
inferred← citeshttps://doi.org/10.1016/j.apal.2016.10.001openalex-snapshot
Representation and duality of the untyped λ-calculus in nominal lattice and topological semantics, with a proof of topological completeness
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.02.002openalex-snapshot
On Solving Nominal Disunification Constraints
inferred← citeshttps://doi.org/10.1016/j.jal.2012.03.001openalex-snapshot
Unity in nominal equational reasoning: The algebra of equality on nominal sets
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.04.002openalex-snapshot
Nominal Lawvere Theories: A category theoretic account of equational theories with names
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.047openalex-snapshot
Term-generic logic
inferred← citeshttps://doi.org/10.1017/s0960129509990399openalex-snapshot
On universal algebra over nominal sets
inferred← citeshttps://doi.org/10.1017/s0960129510000575openalex-snapshot
Equational presentations of functors and monads
inferred← citeshttps://doi.org/10.1093/jigpal/jzs005openalex-snapshot
Meta-variables as infinite lists in nominal terms unification and rewriting
inferred← citeshttps://doi.org/10.1093/logcom/exp033openalex-snapshot
Nominal (Universal) Algebra: Equational Logic with Names and Binding
inferred← citeshttps://doi.org/10.1093/logcom/exp049openalex-snapshot
A Nominal Axiomatization of the Lambda Calculus
inferred← citeshttps://doi.org/10.1093/logcom/exz015openalex-snapshot
Equivariant ZFA and the foundations of nominal techniques
inferred← citeshttps://doi.org/10.1145/1577824.1577835openalex-snapshot
Universal algebra over lambda-terms and nominal terms
inferred← citeshttps://doi.org/10.1145/2287718.2287720openalex-snapshot
Permissive-nominal logic
inferred← citeshttps://doi.org/10.1145/2700819openalex-snapshot
Semantics Out of Context
inferred← citeshttps://doi.org/10.1145/3767744openalex-snapshot
A Nominal Approach to Equational Problems in Languages with Binders
inferred← citeshttps://doi.org/10.2178/bsl/1305810911openalex-snapshot
Foundations of Nominal Techniques: Logic and Semantics of Variables in Abstract Syntax
inferred← citeshttps://doi.org/10.2178/jsl/1344862164openalex-snapshot
Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free
inferred← citeshttps://doi.org/10.4204/eptcs.430.0.4openalex-snapshot
Towards the HSP Theorem in Nominal Algebra with Fixed-Point Constraints (Work in Progress)
inferred← citeshttps://doi.org/10.4204/eptcs.71.5openalex-snapshot
Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets
inferred← citeshttps://doi.org/10.4230/lipics.csl.2015.374openalex-snapshot
Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes
inferred← citeshttps://doi.org/10.46298/entics.14777openalex-snapshot
Strong Nominal Semantics for Fixed-Point Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1006.3027openalex-snapshot
Algebraic Theories over Nominal Sets
inferred← citeshttps://doi.org/10.48550/arxiv.1812.02016openalex-snapshot
Equational Axiomatization of Algebras with Structure
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.