Related papers: Some model-theoretic results on the 3-valued parac…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
It is argued that a fuzzy version of 4-truth-valued paraconsistent logic (with truth values corresponding to True, False, Both and Neither) can be approximately isomorphically mapped into the complex-number algebra of quantum probabilities.…
We consider the problem of answering queries about formulas of first-order logic based on background knowledge partially represented explicitly as other formulas, and partially represented as examples independently drawn from a fixed…
This paper is part of a project that is based on the notion of dialectical system, introduced by Magari as a way of capturing trial and error mathematics. In previous work, we investigated the expressive and computational power of…
A thorough investigation of the foundations of paraconsistent logics. Relations between logical principles are formally studied, a novel notion of consistency is introduced, the logics of formal inconsistency, and the subclasses of…
A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTTO and LTTO*, which we claim correspond closely to the classical predicative…
In this note, we give a linear-size translation from formulas of first-order logic into equations of the calculus of relations preserving validity and finite validity. Our translation also gives a linear-size conservative reduction from…
Logical transductions provide a very useful tool to encode classes of structures inside other classes of structures. In this paper we study first-order (FO) transductions and the quasiorder they induce on infinite classes of finite graphs.…
We characterise non-distributive positive logic as the fragment of a single-sorted first-order language that is preserved by a new notion of simulation called a meet-simulation. Meet-simulations distinguish themselves from simulations…
The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…
It is well-known that a Hilbert-style deduction system for first-order classical logic is sound and complete for a model theory built using all Boolean algebras as truth-value algebras if and only if it is sound and complete for a model…
Over the past 50 years, Nelson algebras have been extensively studied by distinguished scholars as the algebraic counterpart of Nelson's constructive logic with strong negation. Despite these studies, a comprehensive survey of the topic is…
In the development of operational semantics of concurrent systems, a key decision concerns the adoption of a suitable notion of execution model, which basically amounts to choosing a class of partial orders according to which events are…
This paper proposes the meeting of fuzzy logic with paraconsistency in a very precise and foundational way. Specifically, in this paper we introduce expansions of the fuzzy logic MTL by means of primitive operators for consistency and…
The thesis of this paper is that truth-relevant logic is a better foundation for mathematics than classical logic. It is a system proposed by Richard Diaz in 1981. In a certain sense t-relevant logic is based on Kleene strong tables. These…
We show that the theory of the partial order of computably enumerable equivalence relations (ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same result for the structure comprised of the dark ceers and the…
We study the following problem: Determine which almost structurally complete quasivarieties are structurally complete. We propose a general solution to this problem and then a solution in the semisimple case. As a consequence, we obtain a…
It is well-known that $QI(\mathbb{R})\cong(QI(\mathbb{R}_{+})\times QI(\mathbb{R}_{-}))\rtimes <t>$, where $QI(\mathbb{R})$(resp. $QI(\mathbb{R}_{+})(\cong QI(\mathbb{R_-}))$) is the group of quasi-isometries of the real line (resp.…
Classical limits of quantum groups give rise to multiplicative Poisson structures such as Poisson-Lie and quasi-Poisson structures. We relate them to the notion of a shifted Poisson structure which gives a conceptual framework for…
This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spirit of Satisfiability Modulo Theories. The resulting logic,…