Closed systems of functions and predicates

DOI10.2140/pjm.1968.27.95zbMath0186.02502OpenAlexW2149922426MaRDI QIDQ2536623

David Geiger

Publication date: 1968

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1968.27.95

zbMATH Keywords

general algebraic structures

Related Items (98)

THE LATTICE OF ALTER EGOS ⋮ Quantified Constraint Satisfaction Problem on Semicomplete Digraphs ⋮ Topology and Adjunction in Promise Constraint Satisfaction ⋮ Polymorphism-homogeneity and universal algebraic geometry ⋮ Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\) ⋮ A short introduction to clones. ⋮ Logical relations and parametricity -- a Reynolds programme for category theory and programming languages ⋮ Semantical conditions for the definability of functions and relations ⋮ CSP for binary conservative relational structures ⋮ The lattice and semigroup structure of multipermutations ⋮ Galois theory for semiclones ⋮ Constraint Satisfaction Problems Solvable by Local Consistency Methods ⋮ What makes propositional abduction tractable ⋮ Galois connection for multiple-output operations ⋮ Unique inclusions of maximal C-clones in maximal clones ⋮ Strong partial clones and the time complexity of SAT problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Critical relations of crowns in critical times of coronavirus depression ⋮ All centralising monoids with majority witnesses on a four-element set ⋮ Deciding absorption in relational structures ⋮ Closed classes of functions, generalized constraints, and clusters ⋮ Meet-irreducible submaximal clones determined by nontrivial equivalence relations ⋮ Complexity Classifications for Logic-Based Argumentation ⋮ Natural duality via a finite set of relations ⋮ On the complexity of \(\mathbb{H}\)-coloring for special oriented trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A general Galois theory for operations and relations in arbitrary categories ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Lewis dichotomies in many-valued logics ⋮ The algebraic structure of the densification and the sparsification tasks for CSPs ⋮ An algebraic characterization of tractable constraints ⋮ The lattice of clones of self-dual operations collapsed ⋮ Constraint satisfaction problem: what makes the problem easy ⋮ Galois theory for analogical classifiers ⋮ Galois theory for sets of operations closed under permutation, cylindrification, and composition ⋮ Submaximal clones over a three-element set up to minor-equivalence ⋮ Generic expression hardness results for primitive positive formula comparison ⋮ On finitely related semigroups. ⋮ Algebras of prime cardinality with a cyclic automorphism ⋮ Colouring, constraint satisfaction, and complexity ⋮ Weak bases of Boolean co-clones ⋮ n-Permutability is not join-prime for n ≥ 5 ⋮ The existence of a near-unanimity function is decidable ⋮ Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem ⋮ The complexity of equality constraint languages ⋮ Quantified Constraints in Twenty Seventeen ⋮ On Boolean primitive positive clones ⋮ Existence of cube terms in finite algebras ⋮ An algebraic hardness criterion for surjective constraint satisfaction. ⋮ Boolean max-co-clones ⋮ Structure identification of Boolean relations and plain bases for co-clones ⋮ A Generalized Version of the Baker–Pixley Theorem ⋮ Rigid binary relations on a 4-element domain ⋮ Gap theorems for robust satisfiability: Boolean CSPs and beyond ⋮ Trichotomies in the complexity of minimal inference ⋮ On the expression complexity of equivalence and isomorphism of primitive positive formulas ⋮ On orders of closed classes containing a homogeneous switching function ⋮ Clones with finitely many relative \({\mathcal R}\)-classes ⋮ A GENERAL DUALITY THEORY FOR CLONES ⋮ Unnamed Item ⋮ The completeness problem in partial hyperclones ⋮ CHARACTERIZATION OF PRECLONES BY MATRIX COLLECTIONS ⋮ Unnamed Item ⋮ Generalized satisfiability problems via operator assignments ⋮ THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA ⋮ Taylor's modularity conjecture and related problems for idempotent varieties ⋮ The subalgebra systems of direct powers ⋮ COUNTING THE RELATIONS COMPATIBLE WITH AN ALGEBRA ⋮ Dualizable algebras with parallelogram terms ⋮ Solution sets of systems of equations over finite lattices and semilattices ⋮ Affine systems of equations and counting infinitary logic ⋮ The complexity of satisfiability problems: Refining Schaefer's theorem ⋮ Robustly Solvable Constraint Satisfaction Problems ⋮ Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems) ⋮ On the algebraic structure of combinatorial problems ⋮ The size of generating sets of powers ⋮ Extension of not everywhere defined functions of many-valued logic ⋮ A combinatorial constraint satisfaction problem dichotomy classification conjecture ⋮ Topological Birkhoff ⋮ Time Complexity of Constraint Satisfaction via Universal Algebra ⋮ Unnamed Item ⋮ Finitely Many Primitive Positive Clones ⋮ Unnamed Item ⋮ A complete classification of equational classes of threshold functions included in clones ⋮ Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? ⋮ Basics of Galois Connections ⋮ Constraint Satisfaction Problems with Infinite Templates ⋮ Partial Polymorphisms and Constraint Satisfaction Problems ⋮ Finite degree clones are undecidable ⋮ Existence of finite total equivalence systems for certain closed classes of 3-valued logic functions ⋮ Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations ⋮ A Dichotomy Theorem for the Inverse Satisfiability Problem ⋮ Unnamed Item ⋮ On the use of majority for investigating primeness of 3-permutability ⋮ Functional clones and expressibility of partition functions

This page was built for publication: Closed systems of functions and predicates