Results 141 to 150 of about 3,086 (177)
Some of the next articles are maybe not open access.
Algebraic Perspectives on Substructural Logics
Trends in Logic, 2021This volume presents the state of the art in the algebraic investigation into substructural logics. It features papers from the workshop AsubL (Algebra & Substructural Logics - Take 6). Held at the University of Cagliari, Italy, this event is part of the framework of the Horizon 2020 Project SYSMICS: SYntax meets Semantics: Methods, Interactions ...
Davide Fazio +2 more
exaly +3 more sources
SUBSTRUCTURAL INQUISITIVE LOGICS
The Review of Symbolic Logic, 2019AbstractThis paper shows that any propositional logic that extends a basic substructural logic BSL (a weak, nondistributive, nonassociative, and noncommutative version of Full Lambek logic with a paraconsistent negation) can be enriched with questions in the style of inquisitive semantics and logic.
openaire +1 more source
Substructural Fuzzy-Relevance Logic [PDF]
Notre Dame Journal of Formal Logic, 2015 This paper proposes a new topic in substructural logic for use in research joining the fields of relevance and fuzzy logics. For this, we consider old and new relevance principles. We first introduce fuzzy systems satisfying an old relevance principle, that is, Dunn’s weak relevance principle.
exaly +3 more sources
Substructural Propositional Dynamic Logics
Lecture Notes in Computer Science, 2019We prove completeness and decidability of a version of Propositional Dynamic Logic where the underlying non-modal propositional logic is a substructural logic in the vicinity of the Full Distributive Non-associative Lambek Calculus. Extensions of the result to stronger substructural logics are briefly discussed.
Igor Sedlár
exaly +2 more sources
Skolemization for Substructural Logics
2015The usual Skolemization procedure, which removes strong quantifiers by introducing new function symbols, is in general unsound for first-order substructural logics defined based on classes of complete residuated lattices. However, it is shown here following similar ideas of Baaz and Iemhoff for first-order intermediate logics ini¾?[1] that first-order ...
Petr Cintula +2 more
openaire +2 more sources
Substructural logics on display
Logic Journal of IGPL, 1998Belnap-style display characterizations admitting cut-elimination are presented for numerous substructural logics including non-commutative intuitionistic linear logic and its relevant, intuitionistic and classical extensions.
openaire +2 more sources
2013
In this paper, we introduce substructural variants of Artemov's logic of proofs. We show a few things here. First, we introduce a bimodal logic that has both the exponential operator in linear logic and an S4 modal operator which does not bring in any structural feature.
Hidenori Kurokawa, Hirohiko Kushida
openaire +1 more source
In this paper, we introduce substructural variants of Artemov's logic of proofs. We show a few things here. First, we introduce a bimodal logic that has both the exponential operator in linear logic and an S4 modal operator which does not bring in any structural feature.
Hidenori Kurokawa, Hirohiko Kushida
openaire +1 more source
Synthesized substructural logics
Mathematical Logic Quarterly, 2007AbstractA mechanism for combining any two substructural logics (e.g. linear and intuitionistic logics) is studied from a proof‐theoretic point of view. The main results presented are cut‐elimination and simulation results for these combined logics called synthesized substructural logics. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
openaire +1 more source
Herbrand Theorems for Substructural Logics
2013Herbrand and Skolemization theorems are obtained for a broad family of first-order substructural logics. These logics typically lack equivalent prenex forms, a deduction theorem, and reductions of semantic consequence to satisfiability. The Herbrand and Skolemization theorems therefore take various forms, applying either to the left or right of the ...
Petr Cintula, George Metcalfe
openaire +2 more sources
Tableau Methods for Substructural Logics
1999Over the last few decades a good deal of research in logic has been prompted by the realization that logical systems can be successfully employed to formalize and solve a variety of computational problems. Traditionally, the theoretical framework for most applications was assumed to be classical logic. However, this assumption often turned out to clash
D'AGOSTINO, Marcello +2 more
openaire +2 more sources