Answers are grounded in this paper and cite their sources.
In this paper we show that there is a one to one correspondence between systems of functions defined on a finite set A and systems of predicates defined on A. This result implies that a complete set of invariants for a universal algebra on A is given by predicates defined on A. Conversely functions on A provide a complete system of invariants for sets of predicates closed under conjunction, change of variable and application of the existential quantifier. We begin in § 2 by giving a definition of closure for systems of functions and predicates. This is followed by a definition of commutivity of a function and a predicate which gives a correspondence between the two types of systems. In Theorems 1 and 2 of § 3 we show that the correspondence is a Galois connection. In Theorem 3 we consider sets of predicates closed under the existential quantifier and show that the corresponding systems are determined by functions defined for all values of the arguments. In Theorems 4 and 5 we include disjunction and then negation in the definition of closure of a set of predicates. We also require that equality be among the predicates. The corresponding systems consist of essentially first order functions and essentially first order permutations respectively. We conclude in § 4 with some comments on the infinite case and some general comments on these results.
No takes yet. Share an insight, caveat, or question.
David Geiger (1968) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: