Preservation and decomposition theorems for bounded degree structures
We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the class \^ad of all finite structures of degree at most d: For each FO-sentence that is preserved under extensions (homomorphisms) on \^ad, a \^ad-equivalent existential (existential-positive) FO-sente...
Kaydedildi:
| Asıl Yazarlar: | , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Logical Methods in Computer Science e.V.
2015-12-01
|
| Seri Bilgileri: | Logical Methods in Computer Science |
| Konular: | |
| Online Erişim: | https://lmcs.episciences.org/1618/pdf |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|