We confirm a conjecture, about neat embeddings of cylindric algebras, made in 1969 by J. D. Monk, and a later conjecture by Maddux about relation algebras obtained from cylindric algebras. These results in algebraic logic have the following consequence for predicate logic: for every finite cardinal α ≥ 3 there is a logically valid sentence X, in a first-order language ℒ with equality and exactly one nonlogical binary relation symbol E, such that X contains only 3 variables (each of which may occur arbitrarily many times), X has a proof containing exactly α + 1 variables, but X has no proof containing only α variables. This solves a problem posed by Tarski and Givant in 1987.
Self-similar distributions of species across a landscape have been proposed as one potential cause of the well-known species-area relationship. The best known of these proposals is in the form of a probability rule for species occurrence. The application of this rule to the number of species occurring in primary wellshaped rectangles within the landscape gives rise to a discrete power law for species-area relationships. However, this result requires a specic scheme for bisecting the landscape to generate the rectangles. Some additional, more general consequences of the probability rule are presented here. These include the result that the number of species in a well-shaped rectangle depends on its location, not just on its area. In addition, a self-similar landscape contains well-shaped rectangles that are, in fact, not self-similar. The probability rule in general produces testable predictions about how and where species are distributed that are independent of the power law. Subject headings: species-area relationship, self-similarity, probability rules,
Sound and complete semantics for classical propositional logic can be obtained by interpreting sentences as sets. Replacing sets with commuting dense binary relations produces an interpretation that turns out to be sound but not complete for R. Adding transitivity yields sound and complete semantics for RM, because all normal Sugihara matrices are representable as algebras of binary relations.
Relevance logicsare known to be sound and complete for relational semantics with a ternary accessibility relation. This paper investigates the problem of adequacy with respect to special kinds ofdynamic semantics(i.e., proper relation algebras and relevant families of relations). We prove severalsoundnessresults here. We also prove thecompletenessof a certain positive fragment ofRas well as of the first-degree fragment of relevance logics. These results show that some core ideas are shared between relevance logics and relation algebras. Some details of certain incompleteness results, however, pinpoint where relevance logics and relation algebras diverge. To carry out these semantic investigations, we define anew tableauxformalization and newsequent calculi(with the single cut rule admissible) for various relevance logics.