Some closure properties of finite definitions (Q5951911)

Systems where circular definitions are allowed and the defined predicates are associated with revision rules (instead of extensions) have been studied by Gupta and Belnap. The set of finite definitions is not recursive (Gupta), so there arises the problem to characterize this set in terms of closure conditions. The main result is: Any definition that only uses symbols of unary predication and equality is bound to be finite.