Cited By
View all- Gadducci FSantini F(2021)Residuation for Soft Constraints: Lexicographic Orders and Approximation TechniquesLogics in Artificial Intelligence10.1007/978-3-030-75775-5_12(162-176)Online publication date: 17-May-2021
We introduce Kripke semantics for modal substructural logics, and prove the completeness theorems with respect to the semantics. The completeness theorems are proved using an extended Ishihara's method of canonical model construction (Ishihara, 2000). The ...
We introduce structural rules mingle, and investigate theorem-equivalence, cut- eliminability, decidability, interpolability and variable sharing property for sequent calculi having the mingle. These results include new cut-elimination results for the ...
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 ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in