Completeness results for memory logics

Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structures. In this paper we present sound and complete axiomatizations for some members of this family. We analyze the use of nom...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Areces, C., Figueira, S., Mera, S.
Formato: JOUR
Materias:
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_01680072_v163_n7_p961_Areces
Aporte de:
id todo:paper_01680072_v163_n7_p961_Areces
record_format dspace
spelling todo:paper_01680072_v163_n7_p961_Areces2023-10-03T15:05:41Z Completeness results for memory logics Areces, C. Figueira, S. Mera, S. Completeness Hybrid logics Memory logics Modal logics Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structures. In this paper we present sound and complete axiomatizations for some members of this family. We analyze the use of nominals to achieve completeness, and present one example in which they can be avoided. © 2011 Elsevier B.V. Fil:Areces, C. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Figueira, S. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Mera, S. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_01680072_v163_n7_p961_Areces
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Completeness
Hybrid logics
Memory logics
Modal logics
spellingShingle Completeness
Hybrid logics
Memory logics
Modal logics
Areces, C.
Figueira, S.
Mera, S.
Completeness results for memory logics
topic_facet Completeness
Hybrid logics
Memory logics
Modal logics
description Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structures. In this paper we present sound and complete axiomatizations for some members of this family. We analyze the use of nominals to achieve completeness, and present one example in which they can be avoided. © 2011 Elsevier B.V.
format JOUR
author Areces, C.
Figueira, S.
Mera, S.
author_facet Areces, C.
Figueira, S.
Mera, S.
author_sort Areces, C.
title Completeness results for memory logics
title_short Completeness results for memory logics
title_full Completeness results for memory logics
title_fullStr Completeness results for memory logics
title_full_unstemmed Completeness results for memory logics
title_sort completeness results for memory logics
url http://hdl.handle.net/20.500.12110/paper_01680072_v163_n7_p961_Areces
work_keys_str_mv AT arecesc completenessresultsformemorylogics
AT figueiras completenessresultsformemorylogics
AT meras completenessresultsformemorylogics
_version_ 1807314594882912256