On the public citation graph
The algebras of partial functions and their invariants
0 signed · 79 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01069648openalex-snapshot
Algorithmic completeness and complexity of microprograms
inferredcites →https://doi.org/10.1007/bf01069655openalex-snapshot
Galois correspondence between iterative post algebras and relations on an infinite set
inferredcites →https://doi.org/10.1007/bf01070906openalex-snapshot
Galois theory for post algebras. I
inferredcites →https://doi.org/10.1007/bf01224718openalex-snapshot
The set of maximal closed classes of operations on an infinite setA has cardinality $$2^{2^{^{\left| A \right|} } }$$
inferredcites →https://doi.org/10.1007/bf01351890openalex-snapshot
Functional completeness in the small algebraic structure theorems and identities
inferredcites →https://doi.org/10.1007/bf02849497openalex-snapshot
Maximal clones on algebrasA andA r
inferredcites →https://doi.org/10.1080/00029890.1970.11992564openalex-snapshot
On the Foundations of Set Theory
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.1007/978-1-4020-1898-5_5openalex-snapshot
Galois Connections for Operations and Relations
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_4openalex-snapshot
Towards an Algebraic Approach to the Reconfiguration CSP
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_10openalex-snapshot
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-92800-3_3openalex-snapshot
Basics of Galois Connections
inferred← citeshttps://doi.org/10.1007/978-3-540-92800-3_9openalex-snapshot
Partial Polymorphisms and Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_35openalex-snapshot
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis
inferred← citeshttps://doi.org/10.1007/bf01068239openalex-snapshot
The completeness problem in the algebra of partial functions of finite-valued logic
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/bf01212439openalex-snapshot
Completeness theory for finite partial algebras
inferred← citeshttps://doi.org/10.1007/bfb0063443openalex-snapshot
Galois theory for partial algebras
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/s00012-015-0330-7openalex-snapshot
Dichotomy on intervals of strong partial Boolean clones
inferred← citeshttps://doi.org/10.1007/s00012-016-0369-0openalex-snapshot
Weakly extendable partial clones on an infinite set
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.1007/s00012-018-0561-5openalex-snapshot
Endpoints of associated intervals for local clones on an infinite set
inferred← citeshttps://doi.org/10.1007/s00037-024-00253-4openalex-snapshot
Algebraic Global Gadgetry for Surjective Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/s00224-011-9320-0openalex-snapshot
Trichotomies in the Complexity of Minimal Inference
inferred← citeshttps://doi.org/10.1007/s00224-018-9896-8openalex-snapshot
Minimal Distance of Propositional Models
inferred← citeshttps://doi.org/10.1007/s00453-022-01017-8openalex-snapshot
General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.07.012openalex-snapshot
Homogeneous and strictly homogeneous criteria for partial structures
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/j.ipl.2014.03.011openalex-snapshot
Weak bases of Boolean co-clones
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.07.008openalex-snapshot
Strong partial clones and the time complexity of SAT problems
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.10.004openalex-snapshot
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.03.006openalex-snapshot
Gap theorems for robust satisfiability: Boolean CSPs and beyond
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.1017/s0004972700014696openalex-snapshot
Partial clones containing all permutations
inferred← citeshttps://doi.org/10.1093/logcom/exw005openalex-snapshot
The power of primitive positive definitions with polynomially many variables
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.679516openalex-snapshot
On partial clones containing all idempotent partial operations
inferred← citeshttps://doi.org/10.1109/ismvl.1999.779699openalex-snapshot
Maximal chains of partial clones containing all idempotent partial functions
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.2007.12openalex-snapshot
Characterization of Partial Sheffer Functions in 3-Valued Logic
inferred← citeshttps://doi.org/10.1109/ismvl.2009.10openalex-snapshot
Frozen Boolean Partial Co-clones
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.2011.14openalex-snapshot
Galois Theory for Partial Clones and Some Relational 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.2013.41openalex-snapshot
Not Finitely Definable Partial Clones on a Finite Set
inferred← citeshttps://doi.org/10.1109/ismvl.2013.7openalex-snapshot
A Solution to a Problem of D. Lau: Complete Classification of Intervals in the Lattice of Partial Boolean Clones
inferred← citeshttps://doi.org/10.1109/ismvl.2015.33openalex-snapshot
Bounded Bases of Strong Partial Clones
inferred← citeshttps://doi.org/10.1109/ismvl.2017.27openalex-snapshot
On the Interval of Boolean Strong Partial Clones Containing Only Projections as Total Operations
inferred← citeshttps://doi.org/10.1109/ismvl.2019.00014openalex-snapshot
The Inclusion Structure of Boolean Weak Bases
inferred← citeshttps://doi.org/10.1109/ismvl.2019.00037openalex-snapshot
Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey
inferred← citeshttps://doi.org/10.1109/ismvl52857.2022.00017openalex-snapshot
Weak bases for Boolean relational clones revisited
inferred← citeshttps://doi.org/10.1109/ismvl57333.2023.00034openalex-snapshot
Weak bases for maximal clones
inferred← citeshttps://doi.org/10.1109/lics.2009.14openalex-snapshot
Trichotomy in the Complexity of Minimal Inference
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470670openalex-snapshot
Constraint Satisfaction Problems over Finite Structures
inferred← citeshttps://doi.org/10.1145/1805950.1805954openalex-snapshot
Nonuniform Boolean constraint satisfaction problems with cardinality constraint
inferred← citeshttps://doi.org/10.1145/3389411openalex-snapshot
Sparsification of SAT and CSP Problems via Tractable Extensions
inferred← citeshttps://doi.org/10.1145/3434387openalex-snapshot
Fine-Grained Time Complexity of Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1145/3492336openalex-snapshot
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems
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
inferred← citeshttps://doi.org/10.3384/diss.diva-122827openalex-snapshot
Strong Partial Clones and the Complexity of Constraint Satisfaction Problems : Limitations and Applications
inferred← citeshttps://doi.org/10.3384/diss.diva-164157openalex-snapshot
Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.4230/dagsemproc.06401.7openalex-snapshot
New Algebraic Tools for Constraint Satisfaction
inferred← citeshttps://doi.org/10.4230/lipics.cp.2022.11openalex-snapshot
On Redundancy in Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.36openalex-snapshot
On the Strength of Uniqueness Quantification in Primitive Positive Formulas
inferred← citeshttps://doi.org/10.46298/dmtcs.6904openalex-snapshot
Polymorphism-homogeneity and universal algebraic geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1706.05902openalex-snapshot
Time Complexity of Constraint Satisfaction via Universal Algebra
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.