Journal of Symbolic Logic · 2005 · 25 citations · 7 references
HumanitiesComputer ScienceMathematicsAlgebraFormal MethodsLogicIntuitionistic LogicMathematical LogicModel TheoryNon-classical LogicPhilosophical LogicPropositional LogicAlgebraic SemanticsEquational LogicIntuitionistic Propositional Logic
Abstract The logics considered here are the propositional Linear Logic and propositional Intuitionistic Linear Logic extended by a knotted structural rule : . It is proved that the class of algebraic models for such a logic has the finite embeddability property , meaning that every finite partial subalgebra of an algebra in the class can be embedded into a finite full algebra in the class. It follows that each such logic has the finite model property with respect to its algebraic semantics and hence that the logic is decidable.
7
Decision problems for propositional linear logic
Patrick Lincoln, John C. Mitchell, Andre Scedrov et al. · Annals of Pure and Applied Logic · 1992 · 224 citations