Defining a composition operation on sets of formulas one obtains a many-sorted algebra which satisfies the superassociative law and one more identity. This algebra is called the clone of formulas of the given type. The interpretations of formulas on an algebraic system of the same type form a many-sorted algebra with similar properties. The satisfaction of a formula by an algebraic system defines a Galois connection between classes of algebraic systems of the same type and collections of formulas. Hypersubstitutions are (...) mappings sending pairs of operation symbols to pairs of terms of the corresponding arities and relation symbols to formulas of the same arities. Using hypersubstitutions we define hyperformulas. Satisfaction of a hyperformula by an algebraic system defines a second Galois connection between classes of algebraic systems of the same type and collections of formulas. A class of algebraic systems is said to be solid if every formula which is satisfied is also satisfied as a hyperformula. On the basis of these two Galois connections we construct a conjugate pair of additive closure operators and are able to characterize solid classes of algebraic systems. (shrink)

Hybrid identities are sentences in a special second order language with identity. The model classes of sets of hybrid identities are called hybrid solid varieties. We give a Birkhoff-type-characterization of hybrid solid varieties and develop a hybrid equational logic.

P-compatible identities are built up from terms with a special structure. We investigate a variety defined by a set ofP-compatible hybrid identities and answer the question whether a variety defined by a set ofP-compatible hyperidentities can be solid.

The study of hyperidentities is a growing field of research. While hyperidentities hark back to before 1965, they have found a rebirth in the late seventies and early eighties. It is being expanded in several directions, from connections with clone theory, to finite basis problems, to semigroup theory, to classification of M-solid varieties. Applications to digital logic, formal languages, and hypertext systems have been suggested. The concept of a P-compatible equation, where P is a partition on the set of operation (...) symbols, is a good tool to study the structure of identities. In [4] we asked for P-compatible hyperidentities. In this paper we will consider hypersubstitutions which are compatible with the partition P and will develop a generalized equational theory for certain P-compatible hyperidentities. (shrink)