Related papers: Completeness Theorems for Kleene algebra with test…
We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho…
The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…
We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…
We prove two theorems on cohomologically complete complexes. These theorems are inspired by, and yield an alternative proof of, a recent theorem of P. Schenzel on complete modules.
We give the quantum subset construction of orthomodular lattice-valued finite automata, then we show the equivalence between orthomodular lattice-valued finite automata, orthomodular lattice-valued deterministic finite automata and…
A new viewpoint of the G\"odel's incompleteness theorem be given in this article which reveals the deep relationship between the logic and computation. Upon the results of these studies, an algorithm be given which shows how to search a…
The linguistic applications of the Lambek calculus suggest its semantics over algebras of formal languages. A straightforward approach to construct such semantics indeed yields a brilliant completeness theorem (Pentus 1995). However,…
A famous theorem of Kuratowski states that in a topological space, at most 14 distinct sets can be produced by repeatedly applying the operations of closure and complement to a given set. We re-examine this theorem in the setting of formal…
Let p be prime number, K be a p-adically closed field, X $\subseteq$ K^m a semi-algebraic set defined over K and L(X) the lattice of semi-algebraic subsets of X which are closed in X. We prove that the complete theory of L(X) eliminates the…
This paper combines two studies: a topological semantics for epistemic notions and abstract argumentation theory. In our combined setting, we use a topological semantics to represent the structure of an agent's collection of evidence, and…
In the context of his theory of numberings, Ershov showed that Kleene's recursion theorem holds for any precomplete numbering. We discuss various generalizations of this result. Among other things, we show that Arslanov's completeness…
One of the main reasons for the correspondence of regular languages and monadic second-order logic is that the class of regular languages is closed under images of surjective letter-to-letter homomorphisms. This closure property holds for…
We discuss proving correctness and completeness of definite clause logic programs. We propose a method for proving completeness, while for proving correctness we employ a method which should be well known but is often neglected. Also, we…
In this paper we formulate and prove a general theorem of stability of exactness properties under the pro-completion, which unifies several such theorems in the literature and gives many more. The theorem depends on a formal approach to…
We develop and explore the idea of recognition of languages (in the general sense of subsets of topological algebras) as preimages of clopen sets under continuous homomorphisms into Stone topological algebras. We obtain an Eilenberg…
In this paper we introduce a model theoretic construction for the theories of uniform layered domains and semifields introduced in the paper of Izhakian, Knebusch and Rowen. We prove that, for a given layering semiring L, the theory of…
Given a graph of C*-algebras, we prove a long exact sequence in KK-theory for both the maximal and the vertex-reduced fundamental C*-algebras in the presence of possibly non GNS-faithful conditional expectations. We deduce from it the…
This paper continues the investigation of the logic of competing theories, be they scientific, social, political etc. We introduce a many-valued, multi-type modal language which we endow with relational semantics based on enriched reflexive…
We investigate homological properties of perfect algebras of prime characteristic. The principle is as follows: perfect algebras resolve the singularities. For example, we show any module over the ring of absolute integral closure has…