Results 161 to 170 of about 696 (191)

Substructural Logics with Mingle

Journal of Logic, Language and Information, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Skolemization for Substructural Logics

2015
The 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, Denisa Diaconescu, George Metcalfe   +2 more
openaire   +2 more sources

SUBSTRUCTURAL INQUISITIVE LOGICS

The Review of Symbolic Logic, 2019
AbstractThis 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 logics on display

Logic Journal of IGPL, 1998
Belnap-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

Substructural Logic of Proofs

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

Synthesized substructural logics

Mathematical Logic Quarterly, 2007
AbstractA 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

2013
Herbrand 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

1999
Over 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, GABBAY D. M., BRODA K.   +2 more
openaire   +2 more sources

A SAHLQVIST THEOREM FOR SUBSTRUCTURAL LOGIC

The Review of Symbolic Logic, 2013
AbstractIn this paper, we establish the first-order definability of sequents with consistent variable occurrence on bi-approximation semantics by means of the Sahlqvist–van Benthem algorithm. Then together with the canonicity results in Suzuki (2011), this allows us to establish a Sahlqvist theorem for substructural logic.
openaire   +2 more sources

Substructural logics, pluralism and collapse

Synthese, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eduardo Alejandro Barrio, Federico Pailos, Damián Szmuc   +2 more
openaire   +3 more sources