Some Contributions to the Model Theory of Mono-Unaries
Séminaire lotharingien de combinatoire, Tome 26 (1991)
Citer cet article
Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website
A mono-unary is as tructure of the form (A,f),where A is a non-empty set,and f is a unary function from Ato A. Many of the definitions and results apply also to (first-order) structures of a more general and richer type than mono-unaries. We describe mono-unaries in first-order logic with just one unary function symbol and equality (always interpreted as identity). We investigate rigidity in this context.