Results 161 to 170 of about 884 (194)

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\).
exaly   +2 more sources

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

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 ...
Majid Alizadeh, Farzaneh Derakhshan, Hiroakira Ono   +2 more
openaire   +1 more source

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

Combinatory Logic and the Semantics of Substructural Logics

Studia Logica, 2007
In his earlier paper ``Combinator logics'' [ibid. 76, No. 1, 17--66 (2004; Zbl 1054.03019)] the author extended the positive relevance logic Bo, with and, or and o (fusion) by o-axioms related to the reduction rules of a set of combinators. He then extended the Routley-Meyer semantics to this extended logic.
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