Results 151 to 160 of about 2,597 (173)
Some of the next articles are maybe not open access.
Substructural epistemic logics
Journal of Applied Non-Classical Logics, 2015The article introduces substructural epistemic logics of belief supported by evidence. The logics combine normal modal epistemic logics (implicit belief) with distributive substructural logics (available evidence). Pieces of evidence are represented by points in substructural models and availability of evidence is modelled by a function on the point ...
openaire +1 more source
1993
Abstract Sub structural logics are non classical logics, which arose in response to problems in foundations of mathematics and logic, theoretical computer science, mathematical linguistics, and category theory. They include intuitionistic logic, relevant logic, BCK logic, linear logic, and Lambek's calculus of syntactic categories.
openaire +1 more source
Abstract Sub structural logics are non classical logics, which arose in response to problems in foundations of mathematics and logic, theoretical computer science, mathematical linguistics, and category theory. They include intuitionistic logic, relevant logic, BCK logic, linear logic, and Lambek's calculus of syntactic categories.
openaire +1 more source
Current Trends in Substructural Logics
Journal of Philosophical Logic, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Substructural Logical Specifications
2012A logical framework and its implementation should serve as a flexible tool for specifying, simulating, and reasoning about formal systems. When the formal systems we are interested in exhibit state and concurrency, however, existing logical frameworks fall short of this goal.
openaire +1 more source
Combinatory Logic and the Semantics of Substructural Logics
Studia Logica, 2007In 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
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 ...
Cintula, P. (Petr) +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
Finite Models of Some Substructural Logics
MLQ, 2002Summary: 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 +2 more sources