Algebraization, parametrized local deduction theorem and interpolation for substructural logics over FL

From MaRDI portal
Publication:2433102

DOI10.1007/s11225-006-8305-5zbMath1105.03021OpenAlexW2062581225MaRDI QIDQ2433102

Nikolaos Galatos, Hiroakira Ono

Publication date: 27 October 2006

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-006-8305-5




Related Items

Representable idempotent commutative residuated latticesInterpolation via translationsStrong negation in intuitionistic style sequent systems for residuated latticesSemi-linear Varieties of Lattice-Ordered AlgebrasA category equivalence for odd Sugihara monoids and its applicationsAlgebraic proof theory for substructural logics: cut-elimination and completionsProper semantics for substructural logics, from a stalker theoretic point of viewThe Beth property in algebraic logicOn varieties of biresiduation algebrasCut elimination and strong separation for substructural logics: an algebraic approachSome modal and temporal translations of generalized basic logicContextual deduction theoremsTopological proofs of some Rasiowa-Sikorski lemmasMacNeille completions of FL-algebrasResiduated Structures, Concentric Sums and Finiteness ConditionsConstructive logic with strong negation is a substructural logic. IAmalgamation through quantifier elimination for varieties of commutative residuated latticesAlgebraic Kripke-style semantics for relevance logicsCraig Interpolation in Displayable LogicsBOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICSŁ\(\Pi\) logic with fixed pointsResiduated frames with applications to decidabilityAmalgamation and interpolation in ordered algebras.2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06Disjunction property and complexity of substructural logicsFuzzy logics from substructural perspectiveInterpolation and Beth's property in propositional many-valued logics: a semantic investigationAlgebraic proof theory: hypersequents and hypercompletionsTowards an algorithmic construction of cut-elimination proceduresConstructive logic with strong negation is a substructural logic. IIEquivalence of consequence relations: an order-theoretic and categorical perspectiveGlivenko theorems for substructural logics over FLIdempotent residuated structures: Some category equivalences and their applicationsPoset products as relational models



Cites Work