Some coinductive graphs |
| |
Authors: | A H Lachlan |
| |
Institution: | (1) Department of Mathematics and Statistics, Simon Fraser University, V5A 1S6 Burnaby, B.C., Canada |
| |
Abstract: | Summary LetT be a universal theory of graphs such that Mod(T) is closed under disjoint unions. Let
T
be a disjoint union
i
such that each
i
is a finite model ofT and every finite isomorphism type in Mod(T) is represented in{
i
i<3}. We investigate under what conditions onT, Th(
T
) is a coinductive theory, where a theory is called coinductive if it can be axiomatizated by -sentences. We also characterize coinductive graphs which have quantifier-free rank 1. |
| |
Keywords: | Subject Classification Numbers 03 C99 (Primary) 03 C45 (Secondary) |
本文献已被 SpringerLink 等数据库收录! |
|