On algebras of binary relations with conjunctive operations

The purpose of the article is the analysis of asymmetric wavelets in binary relations between three coordinates at 290 characteristic points from the source to the mouth of the small river Irovka. The hypsometric characteristic is the most important property of the relief. The Irovka River belongs to a low level, at the mouth it is 89 m high, and at the source it is 148 m above sea level. Modeling of binary relations with latitude, longitude, and height has shown that local latitude receives the greatest quantum certainty. In this case, all paired regularities received a correlation coefficient of more than 0.95. Such a high adequacy of wave patterns shows that geomorphology can go over to the wave multiple fractal representation of the relief. The Irovka River is characterized by a small anthropogenic impact, therefore, the relief over a length of 69 km has the natural character of the oscillatory adaptation of a small river to the surface of the Vyatka Uval from its eastern side. This allows us to proceed to the analysis of the four tributaries of the small river Irovka, as well as to model the relief of the entire catchment basin of 917 km2. The greatest adequacy with a correlation coefficient of 0.9976 was obtained by the influence of latitude on longitude, that is, the geographical location of the relief of the river channel with respect to the geomorphology of the Vyatka Uval. In second place with a correlation of 0.9967 was the influence of the height of the points of the channel of the small river on local longitude and it is also mainly determined by the relief of the Vyatka Uval. In third place was the effect of latitude on height with a correlation coefficient of 0.9859. And in last sixth place is the inverse effect of altitude on local latitude in the North-South direction.

Download Full-text

Second Calculus of Binary Relations as a Concurrent Programming Language.

10.21236/ada329349 ◽

1997 ◽

Author(s):

Vaughan R. Pratt

Keyword(s):

Programming Language ◽

Concurrent Programming ◽

Binary Relations

Download Full-text

Finite representability of semigroups with demonic refinement

Algebra Universalis ◽

10.1007/s00012-021-00718-5 ◽

2021 ◽

Vol 82 (2) ◽

Author(s):

Robin Hirsch ◽

Jaš Šemrl

Keyword(s):

Partial Order ◽

Turing Machines ◽

Binary Relations ◽

Finite Representation ◽

First Order ◽

Finite Structures ◽

Finite Base ◽

Finite Set ◽

Finite Representability ◽

Representation Class

AbstractThe motivation for using demonic calculus for binary relations stems from the behaviour of demonic turing machines, when modelled relationally. Relational composition (; ) models sequential runs of two programs and demonic refinement ($$\sqsubseteq $$ ⊑ ) arises from the partial order given by modeling demonic choice ($$\sqcup $$ ⊔ ) of programs (see below for the formal relational definitions). We prove that the class $$R(\sqsubseteq , ;)$$ R ( ⊑ , ; ) of abstract $$(\le , \circ )$$ ( ≤ , ∘ ) structures isomorphic to a set of binary relations ordered by demonic refinement with composition cannot be axiomatised by any finite set of first-order $$(\le , \circ )$$ ( ≤ , ∘ ) formulas. We provide a fairly simple, infinite, recursive axiomatisation that defines $$R(\sqsubseteq , ;)$$ R ( ⊑ , ; ) . We prove that a finite representable $$(\le , \circ )$$ ( ≤ , ∘ ) structure has a representation over a finite base. This appears to be the first example of a signature for binary relations with composition where the representation class is non-finitely axiomatisable, but where the finite representation property holds for finite structures.

Download Full-text

Program structure definition using binary relations

ACM SIGPLAN Notices ◽

10.1145/987352.987356 ◽

1976 ◽

Vol 11 (12) ◽

pp. 38-55

Author(s):

Lars Kahn

Keyword(s):

Binary Relations ◽

Program Structure

Download Full-text

RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS

The Review of Symbolic Logic ◽

10.1017/s1755020309990293 ◽

2010 ◽

Vol 3 (1) ◽

pp. 41-70 ◽

Cited By ~ 6

Author(s):

ROGER D. MADDUX

Keyword(s):

Propositional Logic ◽

Relevance Logic ◽

Binary Relations ◽

Classical Propositional Logic

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.

Download Full-text

Two preference metrics provide settings for the study of properties of binary relations

Theory and Decision ◽

10.1007/s11238-015-9487-y ◽

2015 ◽

Vol 79 (4) ◽

pp. 615-625

Author(s):

Vicki Knoblauch

Keyword(s):

Binary Relations

Download Full-text

POSITIVE FRAGMENTS OF RELEVANCE LOGIC AND ALGEBRAS OF BINARY RELATIONS

The Review of Symbolic Logic ◽

10.1017/s1755020310000249 ◽

2010 ◽

Vol 4 (1) ◽

pp. 81-105 ◽

Cited By ~ 4

Author(s):

ROBIN HIRSCH ◽

SZABOLCS MIKULÁS

Keyword(s):

Equational Theory ◽

Relevance Logic ◽

Binary Relations ◽

Finitely Based ◽

Similarity Type ◽

Relation Composition

We prove that algebras of binary relations whose similarity type includes intersection, union, and one of the residuals of relation composition form a nonfinitely axiomatizable quasivariety and that the equational theory is not finitely based. We apply this result to the problem of the completeness of the positive fragment of relevance logic with respect to binary relations.

Download Full-text