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...
Guardado en:
Autores principales: | , , |
---|---|
Formato: | SER |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_03029743_v5407LNCS_n_p16_Areces |
Aporte de: |
id |
todo:paper_03029743_v5407LNCS_n_p16_Areces |
---|---|
record_format |
dspace |
spelling |
todo:paper_03029743_v5407LNCS_n_p16_Areces2023-10-03T15:19:06Z Completeness results for memory logics Areces, C. Figueira, S. Mera, S. Complete axiomatizations Modal logic Relational structures Data structures Computer science 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. © Springer-Verlag Berlin Heidelberg 2009. 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. SER info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_03029743_v5407LNCS_n_p16_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 |
Complete axiomatizations Modal logic Relational structures Data structures Computer science |
spellingShingle |
Complete axiomatizations Modal logic Relational structures Data structures Computer science Areces, C. Figueira, S. Mera, S. Completeness results for memory logics |
topic_facet |
Complete axiomatizations Modal logic Relational structures Data structures Computer science |
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. © Springer-Verlag Berlin Heidelberg 2009. |
format |
SER |
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_03029743_v5407LNCS_n_p16_Areces |
work_keys_str_mv |
AT arecesc completenessresultsformemorylogics AT figueiras completenessresultsformemorylogics AT meras completenessresultsformemorylogics |
_version_ |
1782030087242121216 |