Semantics for structurally free logics LC+
The author addresses a problem emerging from joint work with \textit{J. M. Dunn} on structurally free logics [Log. J. IGPL 6, No. 3, 403-424 (1998; Zbl 0904.03006)]. In structurally free logics, combinators as formulas are used instead of structural sequent rules. Extensions LC+ of the basic structurally free logics LC are considered with additive conjunction and disjunction not distributing over each other. Such non-distributive logics naturally arise in sequent calculus formulations. The main contribution of the paper is a sound and complete set-theoretical, relational semantics for these logics. The canonical model construction uses minimally overlapping filter-ideal pairs. The semantics for LC+ also gives rise to a relational semantics for positive substructural logics with structural rules in place of combinators.
- Semantic trees for Dummett's logic LC
- Four-valued logic
- Semantics for dual and symmetric combinatory calculi
- Symmetric generalized Galois logics
- Current trends in substructural logics
- Note on Structural Logics
- Combinators and structurally free logic
- St. Alasdair on Lattices Everywhere
- Admissibility of cut in LC with fixed point combinator
- Relational semantics for Kleene logic and action logic
This page was built for publication: Semantics for structurally free logics LC+
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2743637)