An algebraic study of the first order version of some implicational fragments of the three-valued Lukasiewicz logic

Aldo Figallo-Orellano, Juan Sebastian Slagter

英文摘要：

MV-algebras are an algebraic semantics for Lukasiewicz logic and MV-algebras generated by a finite chain are Heyting algebras where the Godel implication can be written in terms of De Morgan and Moisil's modal operators. In our work, a fragment of trivalent Lukasiewicz logic is studied. The propositional and first-order logic is presented. The maximal consistent theories are studied as Monteiro's maximal deductive systems of the Lindenbaum-Tarski algebra, in both cases. Consequently, the adequacy theorem with respect to the suitable algebraic structures is proven.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Implicational Relevance Logic is 2-EXPTIME-Complete

We show that provability in the implicational fragment of relevance logic is complete for doubly exponential time, using reductions to and from coverability in branching vector addition systems.

2022-05-16cs.LO

Proof complexity of intuitionistic implicational formulas

We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of intuitionistic extended Frege (EF) or substitution Frege (SF) proofs up to a polynomial. On the other hand, EF proofs in the implicational fragment of IPC polynomially simulate full intuitionistic logic for implicational tautologies. The results also apply to other fragments of other superintuitionistic logics under certain conditions. In particular, the expo…

2016-09-18cs.LOmath.LO

Deriving Theorems in Implicational Linear Logic, Declaratively

University of North Texas（北德克萨斯大学）；Topos Institute（Topos研究所）

The problem we want to solve is how to generate all theorems of a given size in the implicational fragment of propositional intuitionistic linear logic. We start by filtering for linearity the proof terms associated by our Prolog-based theorem prover for Implicational Intuitionistic Logic. This works, but using for each formula a PSPACE-complete algorithm limits it to very small formulas. We take a few walks back and forth over the bridge between proof terms and theorems, provided by the Curry-Howard isomorphism, and derive step-by-step an efficient algorithm requiring a low polynomial effort …

2020-09-22cs.AIcs.LOcs.PL

Negative Translations for Affine and Lukasiewicz Logic

We investigate four well-known negative translations of classical logic into intuitionistic logic within a substructural setting. We find that in affine logic the translation schemes due to Kolmogorov and Gödel both satisfy Troelstra's criteria for a negative translation. On the other hand, the schemes of Glivenko and Gentzen both fail for affine logic, but for different reasons: one can extend affine logic to make Glivenko work and Gentzen fail and vice versa. By contrast, in the setting of Lukasiewicz logic, we can prove a general result asserting that a wide class of formula translations in…

2019-11-29cs.LOmath.LO

Propositional Logics Complexity and the Sub-Formula Property

In 1979 Richard Statman proved, using proof-theory, that the purely implicational fragment of Intuitionistic Logic (M-imply) is PSPACE-complete. He showed a polynomially bounded translation from full Intuitionistic Propositional Logic into its implicational fragment. By the PSPACE-completeness of S4, proved by Ladner, and the Goedel translation from S4 into Intuitionistic Logic, the PSPACE- completeness of M-imply is drawn. The sub-formula principle for a deductive system for a logic L states that whenever F1,...,Fk proves A, there is a proof in which each formula occurrence is either a sub-fo…

2015-04-10cs.LO

Negational Fragment of Intuitionistic Control Logic

We investigate properties of monadic purely negational fragment of Intuitionistic Control Logic (ICL). This logic arises from Intuitionistic Propositional Logic (IPL) by extending language of IPL by additional new constant for falsum. Having two different falsum constants enables to define two forms of negation. We analyse implicational relations between negational monadic formulae and present a poset of non equivalent formulae of this fragment of ICL.

2014-08-09cs.LOmath.LO

更多相关论文收起更多论文

Ordered direct implicational basis of a finite closure system

Closure system on a finite set is a unifying concept in logic programming, relational data bases and knowledge systems. It can also be presented in the terms of finite lattices, and the tools of economic description of a finite lattice have long existed in lattice theory. We present this approach by describing the so-called D-basis and introducing the concept of ordered direct basis of an implicational system. A direct basis of a closure operator, or an implicational system, is a set of implications that allows one to compute the closure of an arbitrary set by a single iteration. This property…

2012-05-13cs.LOmath.COmath.RA

关于极小纯蕴涵逻辑中dag推导的水平压缩

On the horizontal compression of dag-derivations in minimal purely implicational logic

本文在极小纯蕴涵逻辑中定义了Dag-like推导，提出水平折叠规则集与算法HC，将多项式高度受限的树状证明压缩为更小的dag-like证明，并证明其可靠性与多项式上界。

2025-01-30cs.LO