On the public citation graph

Maximal subalgebras of algebras of partial multivalued logic functions

https://doi.org/10.1007/bf01099358
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/bf01070906openalex-snapshot
Galois theory for post algebras. I
inferredcites →https://doi.org/10.1016/b978-0-7204-0406-7.50010-7openalex-snapshot
completeness properties of multiple-valued logic algebras
inferredcites →https://doi.org/10.1017/s0305004100047988openalex-snapshot
Some large classes of n-valued Sheffer functions
inferredcites →https://doi.org/10.1109/tc.1977.1674782openalex-snapshot
Static-Hazard-Free T-Gate for Ternary Memory Element and Its Application to Ternary Counters
inferredcites →https://doi.org/10.2307/2370324openalex-snapshot
Introduction to a General Theory of Elementary Propositions
inferredcites →https://doi.org/10.5555/800111.803599openalex-snapshot
Static-hazard-free T-gate for ternary memory element and its application to ternary counters

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf01131846openalex-snapshot
Maximal local classes of partial functions of infinite-valued logic
inferred← citeshttps://doi.org/10.1007/bf01212439openalex-snapshot
Completeness theory for finite partial algebras
inferred← citeshttps://doi.org/10.1007/s00012-016-0418-8openalex-snapshot
On the interval of strong partial clones of Boolean functions containing Pol({(0, 0), (0, 1), (1, 0)})
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90279-jopenalex-snapshot
Maximal partial clones determined by the areflexive relations
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80003-0openalex-snapshot
Partial Sheffer Operations
inferred← citeshttps://doi.org/10.1017/s0004972700014696openalex-snapshot
Partial clones containing all permutations
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.1999.779700openalex-snapshot
Partial clones and their generating sets
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.2005.36openalex-snapshot
Partial Clones Determined by Concatenated Relations
inferred← citeshttps://doi.org/10.1109/ismvl.2009.69openalex-snapshot
Partial Clones Containing All Selfdual Monotonic Boolean Partial Functions
inferred← citeshttps://doi.org/10.1109/ismvl.2010.60openalex-snapshot
Number of Maximal Partial Clones
inferred← citeshttps://doi.org/10.1109/ismvl.2012.34openalex-snapshot
A Survey on Intersections of Maximal Partial Clones of Boolean Partial Functions
inferred← citeshttps://doi.org/10.1109/ismvl.2015.34openalex-snapshot
Hereditarily Rigid Relations: Dedicated to Professor I.G. Rosenberg on the Occasion of His 80-th Birthday
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.1515/dma.2010.038openalex-snapshot
The completeness problem in the function algebra of linear integer-coefficient polynomials
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.