On the public citation graph

The completeness problem in the algebra of partial functions of finite-valued logic

https://doi.org/10.1007/bf01068239
0 signed · 20 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/bf01069627openalex-snapshot
The algebras of partial functions and their invariants

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf01130083openalex-snapshot
Maximal finitely defined subalgebras of partial functions of infinite-valued logic
inferred← citeshttps://doi.org/10.1007/bf01131846openalex-snapshot
Maximal local classes of partial functions of infinite-valued logic
inferred← citeshttps://doi.org/10.1007/s000120050095openalex-snapshot
Maximal partial clones with no finite basis
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.033openalex-snapshot
The completeness problem in partial hyperclones
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.080openalex-snapshot
Extendable local partial clones
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00091-8openalex-snapshot
Completeness theory for the product of finite partial algebras
inferred← citeshttps://doi.org/10.1109/ismvl.1995.513514openalex-snapshot
Completeness theory for vector partial multiple-valued logic functions
inferred← citeshttps://doi.org/10.1109/ismvl.1996.508367openalex-snapshot
On the lattice of partial clones on a finite set
inferred← citeshttps://doi.org/10.1109/ismvl.1998.679515openalex-snapshot
Generating sets for clones and partial clones
inferred← citeshttps://doi.org/10.1109/ismvl.1999.779700openalex-snapshot
Partial clones and their generating sets
inferred← citeshttps://doi.org/10.1109/ismvl.2002.1011064openalex-snapshot
Partial hyperclones on a finite set
inferred← citeshttps://doi.org/10.1109/ismvl.2003.1201423openalex-snapshot
On intervals of partial clones of boolean partial functions
inferred← citeshttps://doi.org/10.1109/ismvl.2004.1319930openalex-snapshot
Some properties of local partial clones on an infinite set
inferred← citeshttps://doi.org/10.1109/ismvl.2005.36openalex-snapshot
Partial Clones Determined by Concatenated Relations
inferred← citeshttps://doi.org/10.1109/ismvl.2006.42openalex-snapshot
Theoretical Basis of Commutation Theory for Partial Clones
inferred← citeshttps://doi.org/10.1109/ismvl.2009.20openalex-snapshot
Positive Primitive Structures
inferred← citeshttps://doi.org/10.1109/ismvl.2017.55openalex-snapshot
A Note on Intervals of Słupecki Partial Clones
inferred← citeshttps://doi.org/10.1515/dma-2021-0014openalex-snapshot
On the action of the implicative closure operator on the set of partial functions of the multivalued logic
inferred← citeshttps://doi.org/10.25596/jalc-2006-399openalex-snapshot
Intervals of Partial Clones Containing Maximal Clones
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.