Results 171 to 175 of about 481 (175)

Finite Models of Some Substructural Logics

MLQ, 2002
Summary: We give a proof of the finite model property (fmp) of some fragments of commutative and noncommutative linear logic: the Lambek calculus, BCI, BCK and their enrichments, MALL and Cyclic MALL. We essentially simplify our method used in Stud. Log.
openaire   +3 more sources

Epistemic Models, Logical Monotony and Substructural Logics

2006
Since the seminal work of [Hin62], classical epistemic logic (CEL) and its applications are undermined by the so-called problem of logical omniscience (PLO). Indeed, this problem is only one instance of logical monotony, a strong idealization that is common to most of actual epistemic models. The purpose of this paper is, following [Dub91] and [Dub02],
openaire   +3 more sources

Substructural Logics: A Primer

2002
openaire   +2 more sources

An Introduction to Substructural Logics

1969
openaire   +1 more source

Using Substructural Logic

2002
openaire   +2 more sources