Abstract

In this paper, we present a generic format for adaptive vague logics. Logics based on this format are able to (1) identify sentences as vague or non-vague in light of a given set of premises, and to (2) dynamically adjust the possible set of inferences in accordance with these identifications, i.e. sentences that are identified as vague allow only for the application of vague inference rules and sentences that are identified as non-vague also allow for the application of some extra set of classical logic rules. The generic format consists of a set of minimal criteria that must be satisfied by the vague logic in casu in order to be usable as a basis for an adaptive vague logic. The criteria focus on the way in which the logic deals with a special ⊡-operator. Depending on the kind of logic for vagueness that is used as a basis for the adaptive vague logic, this operator can be interpreted as completely true, definitely true, clearly true, etc. It is proven that a wide range of famous logics for vagueness satisfies these criteria when extended with a specific ⊡-operator, e.g. fuzzy basic logic and its well known extensions, cf. [7], super- and subvaluationist logics, cf. [6], [9], and clarity logic, cf. [13]. Also a fuzzy logic is presented that can be used for an adaptive vague logic that can deal with higher-order vagueness. To illustrate the theory, some toy-examples of adaptive vague proofs are provided