Related papers: Additive G\"{o}del Logic
We present an introductory survey to first order logic for metric structures and its applications to C*-algebras.
Propositional logic serves as a fundamental cornerstone in mathematical logic. This paper delves into a semiring characterization of propositional logic, employing the Gr\"oebner-Shirshov basis theory to furnish an algebraic framework for…
We introduce the calculus of neo-Peircean relations, a string diagrammatic extension of the calculus of binary relations that has the same expressivity as first order logic and comes with a complete axiomatisation. The axioms are obtained…
We develop first-order logic and some extensions for incomplete information scenarios and consider related complexity issues.
We consider the question of extending propositional logic to a logic of plausible reasoning, and posit four requirements that any such extension should satisfy. Each is a requirement that some property of classical propositional logic be…
This exposition begins with a systematic account of the theory of group schemes, ultimately specializing to algebraic tori.
Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators "t:",…
We consider (finitary, propositional) logics through the original use of Category Theory: the study of the "sociology of mathematical objects", aligning us with a recent, and growing, trend of study logics through its relations with other…
We propose various methods for combining or amalgamating propositional languages and deductive systems. We make heavy use of quantales and quantale modules in the wake of previous works by the present and other authors. We also describe…
Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups). These calculi are then used to provide new proofs of…
An algebraically expandable (AE) class is a class of algebraic structures axiomatizable by sentences of the form $\forall \exists! \land p = q$. For a logic $L$ algebraized by a quasivariety $\mathcal{Q}$ we show that the AE-subclasses of…
We present a linearity theorem for a proof language of intuitionistic multiplicative additive linear logic, incorporating addition and scalar multiplication. The proofs in this language are linear in the algebraic sense. This work is part…
In this paper we show several similarities among logic systems that deal simultaneously with deductive and quantitative inference. We claim it is appropriate to call the tasks those systems perform as Quantitative Logic Reasoning. Analogous…
We suggest an approach for description of integrable cases of the Abel equations. It is based on increasing of the order of equations up to the second one and using equivalence transformations for the corresponding second-order ordinary…
Using a recently introduced algebraic framework for the classification of fragments of first-order logic, we study the complexity of the satisfiability problem for several ordered fragments of first-order logic, which are obtained from the…
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,…
By means of a generalization of the S-expansion method we construct a procedure to obtain expanded higher-order Lie algebras. It is shown that the direct product between an Abelian semigroup S and a higher-order Lie algebra…
Algebras of Logic deal with some algebraic structures, often bounded lattices, considered as models of certain logics, including logic as a domain of order theory. There are well known their importance and applications in social life to…
In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant characterization of the existence and multiplicity of…
Logics of limited belief aim at enabling computationally feasible reasoning in highly expressive representation languages. These languages are often dialects of first-order logic with a weaker form of logical entailment that keeps reasoning…