Abstract

Stemming from the works of Petr Hájek on mathematical fuzzy logic, graded model theory has been developed by several authors in the last two decades as an extension of classical model theory that studies the semantics of many-valued predicate logics. In this paper we take the first steps towards an abstract formulation of this model theory. We give a general notion of abstract logic based on many-valued models and prove six Lindström-style characterizations of maximality of first-order logics in terms of metalogical properties such as compactness, abstract completeness, the Löwenheim–Skolem property, the Tarski union property, and the Robinson property, among others. As necessary technical restrictions, we assume that the models are valued on finite MTL-chains and the language has a constant for each truth-value.