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}
}
  • Douglas A. Cenzer, Victor W. Marek, Jeffrey B. Remmel
  • Published in LFCS 2016
  • Computer Science, Mathematics
  • _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