ﻻ يوجد ملخص باللغة العربية
For (finitary) deductive systems, we formulate a signature-independent abstraction of the emph{weak excluded middle law} (WEML), which strengthens the existing general notion of an inconsistency lemma (IL). Of special interest is the case where a quasivariety $mathsf{K}$ algebraizes a deductive system $,vdash$. We prove that, in this case, if $,vdash$ has a WEML (in the general sense) then every relatively subdirectly irreducible member of $mathsf{K}$ has a greatest proper $mathsf{K}$-congruence; the converse holds if $,vdash$ has an inconsistency lemma. The result extends, in a suitable form, to all protoalgebraic logics. A super-intuitionistic logic possesses a WEML iff it extends $mathbf{KC}$. We characterize the IL and the WEML for normal modal logics and for relevance logics. A normal extension of $mathbf{S4}$ has a global consequence relation with a WEML iff it extends $mathbf{S4.2}$, while every axiomatic extension of $mathbf{R^t}$ with an IL has a WEML.
Modern distributed systems often rely on so called weakly-consistent databases, which achieve scalability by sacrificing the consistency guarantee of distributed transaction processing. Such databases have been formalised in two different styles, one
In previous work, we have combined computable structure theory and algorithmic learning theory to study which families of algebraic structures are learnable in the limit (up to isomorphism). In this paper, we measure the computational power that is n
We prove that the theory of all modules over the ring of algebraic integers is decidable.
We combine computable structure theory and algorithmic learning theory to study learning of families of algebraic structures. Our main result is a model-theoretic characterization of the class $mathbf{InfEx}_{cong}$, consisting of the structures whos
In several classes of countable structures it is known that every hyperarithmetic structure has a computable presentation up to bi-embeddability. In this article we investigate the complexity of embeddings between bi-embeddable structures in two such