Capturing relational NEXPTIME with a fragment of existential third order logic

Autores
Turull Torres, José María
Año de publicación
2015
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
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.
Facultad de Informática
Materia
Ciencias Informáticas
relational complexity
third order logic
expressibility of logics
relational machines
fixed point quantifiers
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by/3.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/50177
Acceder
id SEDICI_4bf1a60003a67918b89c04062241d702
oai_identifier_str oai:sedici.unlp.edu.ar:10915/50177
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Capturing relational NEXPTIME with a fragment of existential third order logicTurull Torres, José MaríaCiencias Informáticasrelational complexitythird order logicexpressibility of logicsrelational machinesfixed point quantifiersWe prove that the existential fragment Σ<sub>1</sub><sup>2,ω</sup> of the third order logic TO<sup>ω</sup> captures the relational complexity class non deterministic exponential time. As a Corollary we have that relational machines that work in NEXPTIME<sub>r</sub> can simulate third order relational machines that work in NEXPTIME<sub>3,r</sub>.Facultad de Informática2015-11info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf87-92http://sedici.unlp.edu.ar/handle/10915/50177enginfo:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/JCST41-Paper-7.pdfinfo:eu-repo/semantics/altIdentifier/issn/1666-6038info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/3.0/Creative Commons Attribution 3.0 Unported (CC BY 3.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:03:52Zoai:sedici.unlp.edu.ar:10915/50177Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:03:52.303SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Capturing relational NEXPTIME with a fragment of existential third order logic
title Capturing relational NEXPTIME with a fragment of existential third order logic
spellingShingle Capturing relational NEXPTIME with a fragment of existential third order logic
Turull Torres, José María
Ciencias Informáticas
relational complexity
third order logic
expressibility of logics
relational machines
fixed point quantifiers
title_short Capturing relational NEXPTIME with a fragment of existential third order logic
title_full Capturing relational NEXPTIME with a fragment of existential third order logic
title_fullStr Capturing relational NEXPTIME with a fragment of existential third order logic
title_full_unstemmed Capturing relational NEXPTIME with a fragment of existential third order logic
title_sort Capturing relational NEXPTIME with a fragment of existential third order logic
dc.creator.none.fl_str_mv Turull Torres, José María
author Turull Torres, José María
author_facet Turull Torres, José María
author_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
relational complexity
third order logic
expressibility of logics
relational machines
fixed point quantifiers
topic Ciencias Informáticas
relational complexity
third order logic
expressibility of logics
relational machines
fixed point quantifiers
dc.description.none.fl_txt_mv We prove that the existential fragment Σ<sub>1</sub><sup>2,ω</sup> of the third order logic TO<sup>ω</sup> captures the relational complexity class non deterministic exponential time. As a Corollary we have that relational machines that work in NEXPTIME<sub>r</sub> can simulate third order relational machines that work in NEXPTIME<sub>3,r</sub>.
Facultad de Informática
description We prove that the existential fragment Σ<sub>1</sub><sup>2,ω</sup> of the third order logic TO<sup>ω</sup> captures the relational complexity class non deterministic exponential time. As a Corollary we have that relational machines that work in NEXPTIME<sub>r</sub> can simulate third order relational machines that work in NEXPTIME<sub>3,r</sub>.
publishDate 2015
dc.date.none.fl_str_mv 2015-11
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/50177
url http://sedici.unlp.edu.ar/handle/10915/50177
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/JCST41-Paper-7.pdf
info:eu-repo/semantics/altIdentifier/issn/1666-6038
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by/3.0/
Creative Commons Attribution 3.0 Unported (CC BY 3.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/3.0/
Creative Commons Attribution 3.0 Unported (CC BY 3.0)
dc.format.none.fl_str_mv application/pdf
87-92
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844615907199942656
score 13.070432

Publicaciones similares