On the public citation graph

Completeness theory for finite partial algebras

https://doi.org/10.1007/bf01212439
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-0348-5547-1openalex-snapshot
Funktionen- und Relationenalgebren
inferredcites →https://doi.org/10.1007/bf01069627openalex-snapshot
The algebras of partial functions and their invariants
inferredcites →https://doi.org/10.1007/bf01099358openalex-snapshot
Maximal subalgebras of algebras of partial multivalued logic functions
inferredcites →https://doi.org/10.1016/0166-218x(88)90039-xopenalex-snapshot
The strong chromatic number of partial triple systems
inferredcites →https://doi.org/10.1016/0166-218x(92)90279-jopenalex-snapshot
Maximal partial clones determined by the areflexive relations
inferredcites →https://doi.org/10.1016/s0195-6698(13)80003-0openalex-snapshot
Partial Sheffer Operations
inferredcites →https://doi.org/10.2307/2370324openalex-snapshot
Introduction to a General Theory of Elementary Propositions

What points at this work

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

inferred← citeshttps://doi.org/10.1002/malq.19970430407openalex-snapshot
On Partial Classes Containig All Monotone and Zero‐Preserving Total Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-1-4020-1898-5_5openalex-snapshot
Galois Connections for Operations and Relations
inferred← citeshttps://doi.org/10.1007/s00012-011-0138-zopenalex-snapshot
Uniqueness of minimal coverings of maximal partial clones
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.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.1017/s0004972700029919openalex-snapshot
Minimal partial clones
inferred← citeshttps://doi.org/10.1109/fskd.2008.169openalex-snapshot
Full Symmetric Function in Partial K-Valued Logic
inferred← citeshttps://doi.org/10.1109/ismvl.1991.130740openalex-snapshot
A note on minimal partial clones
inferred← citeshttps://doi.org/10.1109/ismvl.1994.302203openalex-snapshot
Completeness criteria in many-valued set logic under compositions with Boolean functions
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.1998.679516openalex-snapshot
On partial clones containing all idempotent partial operations
inferred← citeshttps://doi.org/10.1109/ismvl.1999.779700openalex-snapshot
Partial clones and their generating sets
inferred← citeshttps://doi.org/10.1109/ismvl.2000.848649openalex-snapshot
On the intersection of maximal partial clones and the join of minimal partial clones
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.2007.12openalex-snapshot
Characterization of Partial Sheffer Functions in 3-Valued Logic
inferred← citeshttps://doi.org/10.1109/ismvl.2009.32openalex-snapshot
Minimal Coverings of Maximal Partial Clones
inferred← citeshttps://doi.org/10.1109/ismvl.2009.33openalex-snapshot
The Minimal Covering of Maximal Partial Clones in 4-valued Logic
inferred← citeshttps://doi.org/10.1109/ismvl.2009.47openalex-snapshot
Counting Problems and Clones of 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.2013.33openalex-snapshot
Intersections with Slupecki Partial Clones on a Finite Set
inferred← citeshttps://doi.org/10.1109/ismvl.2017.55openalex-snapshot
A Note on Intervals of Słupecki Partial Clones
inferred← citeshttps://doi.org/10.1109/ismvl.2019.00016openalex-snapshot
The mathematics of Ivo Rosenberg
inferred← citeshttps://doi.org/10.20948/mvk-2024-14openalex-snapshot
Closed classes in partial k-valued logic
inferred← citeshttps://doi.org/10.25596/jalc-2002-083openalex-snapshot
Maximal and Minimal Partial Clones
inferred← citeshttps://doi.org/10.25596/jalc-2006-399openalex-snapshot
Intervals of Partial Clones Containing Maximal Clones
inferred← citeshttps://doi.org/10.7151/dmgt.1252openalex-snapshot
A clone-theoretic formulation of the Erdős-Faber-Lovász conjecture
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.