Capturing relational NEXPTIME with a Fragment of Existential Third Order Logic

• Autores: José María Turull Torres
• Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 15, Nº. 2, 2015, págs. 87-92
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • We prove that the existential fragment Σ12,ω of the third order logic TOω captures the relational complexity class non deterministic exponential time. As a Corollary we have that relational machines that work in NEXPTIMEr can simulate third order relational machines that work in NEXPTIME3,r.