Strongly \(\forall\)-finite theories of unars (Q1113894)

A unar is an algebraic system whose signature consists of an identity symbol and a single unary function. A theory T with a finite signature S is called strongly \(\forall\)-finite if for each finite set C of constant symbols the theory \(T_ 1\) determined by T in the signature \(S\cup C\) is \(\forall\)-finite. That is, the universal theory of each extension \(T_ 2\) of \(T_ 1\) in the signature \(S\cup C\) is finitely axiomatizable. This paper studies questions relating to strong \(\forall\)-finiteness of (fragments of) the theory of unars and connections between such fragments and the theory of trees. For example, it is shown that the theory of unars is not strongly \(\forall\)-finite. Connections with recursive model theory are discussed.