You are here: MIMS > EPrints
MIMS EPrints

2011.49: Algorithmic Properties of Sigma--definability over Positive Predicate Structures

2011.49: Margarita Korovina and Oleg Kudinov (2011) Algorithmic Properties of Sigma--definability over Positive Predicate Structures. In: Benedikt Löwe, Dag Normann, Ivan Soskov and Alexandra Soskova, (eds). Models of Computation in Context, Proc. 7th Conference on Computability in Europe, CiE 2011. Springer Lecture Notes in Computer Science (6735). Speinger-Verlag, Heidelberg.

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
169 Kb

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 2000 > 68 Computer science
MIMS number:2011.49
Deposited By:Dr Margarita Korovina
Deposited On:24 June 2011

Download Statistics: last 4 weeks
Repository Staff Only: edit this item