A CATEGORICAL MODEL OF PREDICATE LINEAR LOGIC

Abstract. Linear logic is one of the logical systems with special properties suitable for describing real processes used in computer science. It enables one to specify dynamics, non determinism, consecutive processes and important resources as memory and time on syntactic level. Moreover, its deduction system enables one to verify specified properties. Constructing an appropriate model based on categories can serve for modeling various program systems in the wide spectrum of computer science. Mainly, propositional linear logic is used for these purposes. The expression power of linear logic significantly grows by extending propositional logic with predicates and quantifiers. Our paper concerns itself with defining predicate linear logic together with its deduction system and our main aim is to construct a categorical model of predicate linear logic as a symmetric monoidal closed category