Related papers: Universal Algebra and Mathematical Logic
This article fits in the area of research that investigates the application of topological duality methods to problems that appear in theoretical computer science. One of the eventual goals of this approach is to derive results in…
Fine's influential Canonicity Theorem states that if a modal logic is determined by a first-order definable class of Kripke frames, then it is valid in its canonical frames. This article reviews the background and context of this result,…
Two series of W-algebras with two generators are constructed from chiral vertex operators of a free field representation. If $c = 1 - 24k$, there exists a W(2,3k) algebra for k in $Z_{+}/2$ and a W(2,8k) algebra for k in $Z_{+}/4$. All…
Independence-friendly logic is a conservative extension of first-order logic that has the same expressive power as existential second-order logic. In her Ph.D. thesis, Dechesne introduces a variant of independence-friendly logic called IFG…
In this article we investigate the notion and basic properties of Boolean algebras and prove the Stone's representation theorem. The relations of Boolean algebras to logic and to set theory will be studied and, in particular, a neat proof…
The starting point of algebraic language theory is that regular languages of finite words are exactly those recognized by finite monoids. This finiteness condition gives rise to a topological space whose points, called profinite words,…
First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification…
The author has recently introduced an abstract algebraic framework of analogical proportions within the general setting of universal algebra. The purpose of this paper is to lift that framework from universal algebra to the strictly more…
This paper aims to provide an analysis of what it means when we say that a pair of theories, very generously construed, are equivalent in the sense that they are interdefinable. With regard to theories articulated in first order logic, we…
We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…
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…
There are many examples of dualities between topological spaces and algebras in the literature. Particularly, many of those examples come from the algebraic counterpart of a logical system, e.g, boolean and heyting algebras, MV-algebras,…
The overarching theme of the following pages is that mathematical logic -- centered around the incompleteness theorems -- is first and foremost an investigation of $\textit{computation}$, not arithmetic. Guided by this intuition we will…
The purpose of this note is to provide a gentle introduction to basic universal algebra and (abstract) clones.
We present a unified categorical treatment of completeness theorems for several classical and intuitionistic infinitary logics with a proposed axiomatization. This provides new completeness theorems and subsumes previous ones by G\"odel,…
We to a large extent sort out when does a (first order complete theory) T have a superlimit model in a cardinal lambda . Also we deal with relation notions of being limit.
(1) Let 1\leq k\leq \omega. Call an atom structure \alpha weakly k neat representable, the term algebra is in \RCA_n\cap \Nr_n\CA_{n+k}, but the complex algebra is not representable. Call an atom structure neat if there is an atomic algebra…
A clone on a set X is a set of finitary functions on X which contains the projections and which is closed under composition. The set of all clones on X forms a complete algebraic lattice Cl(X). We obtain several results on the structure of…
We investigate atomicity of free algebras and various forms of amalgamation for BL and MV algebras, and also Heyting algebras, though the latter algebras may not be linearly ordered, so strictly speaking their corresponding intuitionistic…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…