# Index Sets for Finite Normal Predicate Logic Programs with Function Symbols

@inproceedings{Cenzer2016IndexSF, title={Index Sets for Finite Normal Predicate Logic Programs with Function Symbols}, author={Douglas A. Cenzer and Victor W. Marek and Jeffrey B. Remmel}, booktitle={LFCS}, year={2016} }

_e is the effective list of all finite predicate logic programs. is the list of recursive trees. We modify constructions of Marek, Nerode, and Remmel [25] to construct recursive functions f and g such that for all indices e, (i) there is a one-to-one degree preserving correspondence between the set of stable models of Q_e and the set of infinite paths through T_{f(e)} and (ii) there is a one-to-one degree preserving correspondence between the set of infinite paths through T_e and the set of… CONTINUE READING

#### Topics from this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 71 REFERENCES

## Omega-Restricted Logic Programs

VIEW 1 EXCERPT

## Recursively enumerable sets and degrees

VIEW 3 EXCERPTS

## One More Decidable Class of Finitely Ground Programs

VIEW 1 EXCERPT