5,429 research outputs found
Distributed Relation Logic
We extend the relational algebra of Chin and Tarski so that it is multisorted or, as we prefer, typed. Each type supports a local Boolean algebra outfitted with a converse operator. From Lyndon, we know that relation algebras cannot be represented as proper relation algebras where a proper relation algebra has binary relations as elements and the algebra is singly-typed. Here, the intensional conjunction, which was to represent relational composition in Chin and Tarski, spans three different local algebras, thus the term distributed in the title. Since we do not rely on proper relation algebras, we are free to re-express the algebras as typed. In doing so, we allow many different intensional conjunction operators.We construct a typed logic over these algebras, also known as heterogeneous algebras of Birkhoff and Lipson. The logic can be seen as a form of relevance logic with a classical negation connective where the Routley-Meyer star operator is reified as a converse connective in the logic. Relevance logic itself is not typed but our work shows how it can be made so. Some of the properties of classical relevance logic are weakened from Routley-Meyerâs version which is too strong for a logic over relation algebras
Representable and Diagonally Representable Weakening Relation Algebras
A binary relation defined on a poset is a weakening relation if the partial order acts as a both-sided compositional identity. This is motivated by the weakening rule in sequent calculi and closely related to models of relevance logic. For a fixed poset the collection of weakening relations is a subreduct of the full relation algebra on the underlying set of the poset. We present a two-player game for the class of representable weakening relation algebras akin to that for the class of representable relation algebras. This enables us to define classes of abstract weakening relation algebras that approximate the quasivariety of representable weakening relation algebras. We give explicit finite axiomatisations for some of these classes. We define the class of diagonally representable weakening relation algebras and prove that it is a discriminator variety. We also provide explicit representations for several small weakening relation algebras
Modal and Relevance Logics for Qualitative Spatial Reasoning
Qualitative Spatial Reasoning (QSR) is an alternative technique to represent spatial relations
without using numbers. Regions and their relationships are used as qualitative terms. Mostly
peer qualitative spatial reasonings has two aspect: (a) the first aspect is based on inclusion
and it focuses on the âpart-ofâ relationship. This aspect is mathematically covered by
mereology. (b) the second aspect focuses on topological nature, i.e., whether they are in
âcontactâ without having a common part. Mereotopology is a mathematical theory that
covers these two aspects.
The theoretical aspect of this thesis is to use classical propositional logic with non-classical
relevance logic to obtain a logic capable of reasoning about Boolean algebras i.e., the
mereological aspect of QSR. Then, we extended the logic further by adding modal logic
operators in order to reason about topological contact i.e., the topological aspect of QSR.
Thus, we name this logic Modal Relevance Logic (MRL). We have provided a natural
deduction system for this logic by defining inference rules for the operators and constants
used in our (MRL) logic and shown that our system is correct. Furthermore, we have used
the functional programming language and interactive theorem prover Coq to implement
the definitions and natural deduction rules in order to provide an interactive system for
reasoning in the logic
Singly generated quasivarieties and residuated structures
A quasivariety K of algebras has the joint embedding property (JEP) iff it is
generated by a single algebra A. It is structurally complete iff the free
countably generated algebra in K can serve as A. A consequence of this demand,
called "passive structural completeness" (PSC), is that the nontrivial members
of K all satisfy the same existential positive sentences. We prove that if K is
PSC then it still has the JEP, and if it has the JEP and its nontrivial members
lack trivial subalgebras, then its relatively simple members all belong to the
universal class generated by one of them. Under these conditions, if K is
relatively semisimple then it is generated by one K-simple algebra. It is a
minimal quasivariety if, moreover, it is PSC but fails to unify some finite set
of equations. We also prove that a quasivariety of finite type, with a finite
nontrivial member, is PSC iff its nontrivial members have a common retract. The
theory is then applied to the variety of De Morgan monoids, where we isolate
the sub(quasi)varieties that are PSC and those that have the JEP, while
throwing fresh light on those that are structurally complete. The results
illuminate the extension lattices of intuitionistic and relevance logics
Recommended from our members
Automated verification of refinement laws
Demonic refinement algebras are variants of Kleene algebras. Introduced by von Wright as a light-weight variant of the refinement calculus, their intended semantics are positively disjunctive predicate transformers, and their calculus is entirely within first-order equational logic. So, for the first time, off-the-shelf automated theorem proving (ATP) becomes available for refinement proofs. We used ATP to verify a toolkit of basic refinement laws. Based on this toolkit, we then verified two classical complex refinement laws for action systems by ATP: a data refinement law and Back's atomicity refinement law. We also present a refinement law for infinite loops that has been discovered through automated analysis. Our proof experiments not only demonstrate that refinement can effectively be automated, they also compare eleven different ATP systems and suggest that program verification with variants of Kleene algebras yields interesting theorem proving benchmarks. Finally, we apply hypothesis learning techniques that seem indispensable for automating more complex proofs
- âŠ