On the public citation graph

Eine Charakterisierung endlicher, ordnungspolynomvollst�ndiger Verb�nde

https://doi.org/10.1007/bf01223966
0 signed · 23 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/bf01246623openalex-snapshot
S-verklebte Summen von Verb�nden
inferredcites →https://doi.org/10.1007/bf01298196openalex-snapshot
�ber endliche, ordnungspolynomvollst�ndige Verb�nde

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-1-4020-1898-5_6openalex-snapshot
Galois Connections and Polynomial Completeness
inferred← citeshttps://doi.org/10.1007/978-94-009-7798-3_2openalex-snapshot
Exponentiation and Duality
inferred← citeshttps://doi.org/10.1007/978-94-010-1220-1_6openalex-snapshot
Aspects of Finite Lattices
inferred← citeshttps://doi.org/10.1007/978-94-017-0697-1_5openalex-snapshot
Lectures on Free Lattices
inferred← citeshttps://doi.org/10.1007/bf00143900openalex-snapshot
Gluings of modular lattices
inferred← citeshttps://doi.org/10.1007/bf01110547openalex-snapshot
Strictly locally order affine complete lattices
inferred← citeshttps://doi.org/10.1007/bf01190716openalex-snapshot
Polynomial automorphisms of lattices
inferred← citeshttps://doi.org/10.1007/bf01190762openalex-snapshot
Images of simple lattice polynomials
inferred← citeshttps://doi.org/10.1007/bf01192711openalex-snapshot
Interpolation of monotone functions in lattices
inferred← citeshttps://doi.org/10.1007/bf01196090openalex-snapshot
On order polynomially complete lattices
inferred← citeshttps://doi.org/10.1007/bf01214209openalex-snapshot
�ber endliche, ordnungsaffinvollst�ndige Verb�nde
inferred← citeshttps://doi.org/10.1007/bf01226114openalex-snapshot
Eine Charakterisierung polynomvollst�ndiger Polarit�tsverb�nde
inferred← citeshttps://doi.org/10.1007/bf01951011openalex-snapshot
On locally order-polynomially complete modular lattices
inferred← citeshttps://doi.org/10.1007/bf02483091openalex-snapshot
A note on local polynomial functions over lattices
inferred← citeshttps://doi.org/10.1007/bf02483911openalex-snapshot
Exponents of lattice-ordered algebras
inferred← citeshttps://doi.org/10.1007/bfb0063438openalex-snapshot
Finite forbidden lattices
inferred← citeshttps://doi.org/10.1007/s10587-007-0113-1openalex-snapshot
Order affine completeness of lattices with Boolean congruence lattices
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73819-2openalex-snapshot
Compatible Orderings and Toleranges of Lattices
inferred← citeshttps://doi.org/10.1017/s1446788700027063openalex-snapshot
Central relations on lattices
inferred← citeshttps://doi.org/10.1090/s0002-9939-1981-0597663-5openalex-snapshot
Compatible Relations of Modular and Orthomodular Lattices
inferred← citeshttps://doi.org/10.1112/jlms/s2-17.2.203openalex-snapshot
Exponents of Finite Simple Lattices
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.