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...
| الحاوية / القاعدة: | Logical Methods in Computer Science |
|---|---|
| المؤلفون الرئيسيون: | , , |
| التنسيق: | مقال |
| اللغة: | الإنجليزية |
| منشور في: |
Logical Methods in Computer Science e.V.
2015-12-01
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://lmcs.episciences.org/1618/pdf |