Results 141 to 150 of about 2,597 (173)

On a substructural logic with minimal negation

, 2004
Salvatore Arpaia
openalex   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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

Algebraic Perspectives on Substructural Logics

2021
This 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, Antonio Ledda, Francesco Paoli   +2 more
openaire   +2 more sources

UNIFORM INTERPOLATION IN SUBSTRUCTURAL LOGICS

The Review of Symbolic Logic, 2014
AbstractUniform interpolation property of a given logic is a stronger form of Craig’s interpolation property where both pre-interpolant and post-interpolant always exist uniformly for any provable implication in the logic. It is known that there exist logics, e.g., modal propositional logic S4, which have Craig’s interpolation property but do not have ...
Alizadeh, Majid, Derakhshan, Farzaneh, Ono, Hiroakira   +2 more
openaire   +1 more source

Metacompleteness of Substructural Logics

Studia Logica, 2012
The paper studies the extensions of the logic \(\mathbf{FL}\) -- the logic of full Lambek calculus. A logic \(L\) is said to enjoy the disjunction property if the fact that \(\alpha \lor \beta\) is a theorem of \(L\) entails that \(\alpha\) or \(\beta\) is a theorem of \(L\).
openaire   +1 more source

A Useful Substructural Logic

Logic Journal of IGPL, 1994
Summary: Formal systems seem to come in two general kinds: useful and useless. This is painting things starkly, but the point is important. Formal structures can either be used in interesting and important ways, or they can languish unused and irrelevant. Lewis' modal logics are good examples.
openaire   +2 more sources

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

Substructural Implicational Logics Including the Relevant Logic E

Studia Logica, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ryo Kashima, Norihiro Kamide
openaire   +1 more source

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

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