Journal of Symbolic Logic 60 (4):1087-1114 (1995)

Both syntactic and semantic solutions are given for the entailment problem of duality theory. The test algebra theorem provides both a syntactic solution to the entailment problem in terms of primitive positive formulae and a new derivation of the corresponding result in clone theory, viz. the syntactic description of $\operatorname{Inv(Pol}(R))$ for a given set R of finitary relations on a finite set. The semantic solution to the entailment problem follows from the syntactic one, or can be given in the form of an algorithm. It shows, in the special case of a purely relational type, that duality-theoretic entailment is describable in terms of five constructs, namely trivial relations, intersection, repetition removal, product, and retractive projection. All except the last are concrete, in the sense that they are described by a quantifier-free formula. It is proved that if the finite algebra $\underline{M}$ generates a congruence-distributive variety and all subalgebras of $\underline{M}$ are subdirectly irreducible, then concrete constructs suffice to describe entailment. The concept of entailment appropriate to strong dualities is also introduced, and described in terms of coordinate projections, restriction of domains, and composition of partial functions
Keywords Natural duality   clone   entailment   syntax   semantics
Categories (categorize this paper)
DOI 10.2307/2275875
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 64,159
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles


Added to PP index

Total views
15 ( #678,696 of 2,454,900 )

Recent downloads (6 months)
1 ( #449,233 of 2,454,900 )

How can I increase my downloads?


My notes