On the public citation graph

Boolean functions on distributive lattices

0 signed · 36 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/bf02023870openalex-snapshot

Ideals and congruence relations in lattices

What points at this work

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

inferred← citeshttps://doi.org/10.1006/aima.1999.1854openalex-snapshot

Functions on Distributive Lattices with the Congruence Substitution Property: Some Problems of Grätzer from 1964

inferred← citeshttps://doi.org/10.1007/978-1-4020-1898-5_6openalex-snapshot

Galois Connections and Polynomial Completeness

inferred← citeshttps://doi.org/10.1007/978-1-4757-0507-2_3openalex-snapshot

Lattice Theory

inferred← citeshttps://doi.org/10.1007/bf00338748openalex-snapshot

Affine completions of distributive lattices

inferred← citeshttps://doi.org/10.1007/bf01108769openalex-snapshot

Affine complete distributive lattices

inferred← citeshttps://doi.org/10.1007/bf01110547openalex-snapshot

Strictly locally order affine complete lattices

inferred← citeshttps://doi.org/10.1007/bf01182092openalex-snapshot

Affine complete Stone algebras

inferred← citeshttps://doi.org/10.1007/bf01191772openalex-snapshot

Affine complete double Stone algebras with bounded core

inferred← citeshttps://doi.org/10.1007/bf01191794openalex-snapshot

Note on compatible operations of modular lattices

inferred← citeshttps://doi.org/10.1007/bf01214209openalex-snapshot

�ber endliche, ordnungsaffinvollst�ndige Verb�nde

inferred← citeshttps://doi.org/10.1007/bf01895229openalex-snapshot

Affine complete Stone algebras

inferred← citeshttps://doi.org/10.1007/bf02483091openalex-snapshot

A note on local polynomial functions over lattices

inferred← citeshttps://doi.org/10.1007/bf02944977openalex-snapshot

Characterization of algebraic functions in equational classes generated by independent primal algebras

inferred← citeshttps://doi.org/10.1007/s00012-004-1869-xopenalex-snapshot

Congruence-preserving functions on Stone and Kleene algebras

inferred← citeshttps://doi.org/10.1007/s00012-008-2099-4openalex-snapshot

Congruence-preserving functions on distributive lattices

inferred← citeshttps://doi.org/10.1007/s00012-013-0231-6openalex-snapshot

Interpolation by polynomial functions of distributive lattices: a generalization of a theorem of R. L. Goodstein

inferred← citeshttps://doi.org/10.1007/s00012-017-0464-xopenalex-snapshot

Congruence preserving functions on free monoids

inferred← citeshttps://doi.org/10.1007/s00012-020-00690-6openalex-snapshot

Affine completeness of the algebra of full binary trees

inferred← citeshttps://doi.org/10.1007/s00012-020-0639-8openalex-snapshot

Solution sets of systems of equations over finite lattices and semilattices

inferred← citeshttps://doi.org/10.1007/s000120050032openalex-snapshot

Affine completeness of Kleene algebras

inferred← citeshttps://doi.org/10.1016/j.fss.2023.01.012openalex-snapshot

A new characterization of congruences and the discrete Sugeno integral on LB-valued general fuzzy automata

inferred← citeshttps://doi.org/10.1016/j.ins.2016.06.017openalex-snapshot

Congruences and the discrete Sugeno integrals on bounded distributive lattices

inferred← citeshttps://doi.org/10.1016/s0079-8169(08)61359-8openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73819-2openalex-snapshot

Compatible Orderings and Toleranges of Lattices

inferred← citeshttps://doi.org/10.1016/s0924-6509(08)70608-1openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1017/s0013091500010312openalex-snapshot

Functions and equations in classes of distributive lattices with pseudocomplementation

inferred← citeshttps://doi.org/10.1017/s001708950000896xopenalex-snapshot

On affine completeness of distributive p-algebras

inferred← citeshttps://doi.org/10.1023/a:1022849823068openalex-snapshot

Affine completness of projectable lattice ordered groups

inferred← citeshttps://doi.org/10.1109/tfuzz.2017.2785791openalex-snapshot

On Linear Approximations of Sugeno Integrals on Bounded Distributive Lattices

inferred← citeshttps://doi.org/10.21136/cmj.1995.128545openalex-snapshot

Affine completeness of complete lattice ordered groups

inferred← citeshttps://doi.org/10.2478/s11533-006-0012-yopenalex-snapshot

Remarks on affine complete distributive lattices

inferred← citeshttps://doi.org/10.3390/math10173078openalex-snapshot

Remarks on Sugeno Integrals on Bounded Lattices

inferred← citeshttps://doi.org/10.46298/dmtcs.6890openalex-snapshot

The algebra of binary trees is affine complete

inferred← citeshttps://doi.org/10.48550/arxiv.0705.4286openalex-snapshot

Remarks on affine complete distributive lattices

inferred← citeshttps://doi.org/10.48550/arxiv.2006.04540openalex-snapshot

The algebra of complete binary trees is affine complete

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.