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

LFCS, pp. 60-75, 2016.

EI

Abstract:

We study the recognition problem in the metaprogramming of finite normal predicate logic programs. That is, let (mathcal {L}) be a computable first order predicate language with infinitely many constant symbols and infinitely many n-ary predicate symbols and n-ary function symbols for all (n ge 1). Then we can effectively list all the fin...More

Code:

Data:

Tags

Comments