On conceptual completeness of syntactic-semantical systems (Q798654): Difference between revisions

The aim of the paper is to give a uniform formulation of several types of logics describing the relation between their syntax and semantics by means of category theory, representating the syntax by suitable algebras rather than by certain categories. The notion of a syntactic-semantical system (SS-system) is defined within the framework of 2-categories to consist of the following data: - a 2-category L - the syntax of the system, its objects are called theories, morphisms between theories are called interpretations and morphisms between interpretations are called modifications; - an arbitrary ''reasonable'' category X - the base category of the system, together with the constant functor \(E=E_ X\) fixing X from \(L^ o\) (the dual of L - interpretations are reversed, modifications saved) to CAT (the 2-category of locally small categories); - a 2-faithful 2-functor \(Mod:L^ o\to CAT\) - the semantics of the system, together with a pointwise faithful natural transformation \(\Omega:Mod\to E\) (for a theory T, \(\Omega_ T:Mod T\to X\) is the forgetful functor from the category of models of T to X). Thus \(T\mapsto <Mod T,\Omega_ T>\) converts Mod into a 2-faithful 2- functor \(<Mod,\Omega >:L^ o\to Con X\) (the 2-category of concrete categories over X) frequently denoted simply by Mod. An SS-system is called (weakly) conceptually complete if the localizations \(Mod_{T,S}:L(T,S)\to Con X(Mod S,Mod T)\) define a system of (equivalences) isomorphisms of categories natural in S, T. Further the concept of conditional conceptual completeness with respect to a preservation condition is introduced. The representation of equational theories of clones and of first-order theories by cylindric algebras and discovering the 2-categorical structure in their categories enables to subsume the equational and the first-order logics as well as ''linear logic'' (rings and modules over them) under this unifying scope. The notion of conceptual completeness enables to obtain a qualitative disctinction between them: The equational logic as well as the ''linear logic'' are conceptually complete while the first-order logic is not. All the same, it is conditionally conceptually complete with respect to the preservation condition given by the ultraproduct construction.