Korovina, Margarita and Kudinov, Oleg (2011) Algorithmic Properties of Sigma--definability over Positive Predicate Structures. In: Models of Computation in Context, Proc. 7th Conference on Computability in Europe, CiE 2011. Springer Lecture Notes in Computer Science (6735). Speinger-Verlag, Heidelberg. (In Press)
![[thumbnail of posit_pred_str.pdf]](https://eprints.maths.manchester.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
posit_pred_str.pdf Download (172kB) |
Abstract
In this paper we propose a generalisation of the authors p results on semantical characterisation of $\Sigma$--definability. We prove that over every positive predicate structure a set is $\Sigma$-definable if and only if it is definable by a disjunction of a recursively enumerable set of existential formulas.
| Item Type: | Book Section |
|---|---|
| Uncontrolled Keywords: | CICADA |
| Subjects: | MSC 2010, the AMS's Mathematics Subject Classification > 68 Computer science |
| Depositing User: | Dr Margarita Korovina |
| Date Deposited: | 24 Jun 2011 |
| Last Modified: | 20 Oct 2017 14:12 |
| URI: | https://eprints.maths.manchester.ac.uk/id/eprint/1634 |
Actions (login required)
 |
View Item |