Switch to: References

Add citations

You must login to add citations.
  1. Some Coinductive Graphs.A. H. Lachlan - 1990 - Archive for Mathematical Logic 29 (4):213-229.
    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.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation