Completeness results for memory logics

Mostrar todas las versiones(2)

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, Carlos Eduardo, Figueira, Santiago Daniel, Mera, Sergio Fernando
Publicado: 2009
Materias:
Complete axiomatizations
Modal logic
Relational structures
Data structures
Computer science
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v5407LNCS_n_p16_Areces
http://hdl.handle.net/20.500.12110/paper_03029743_v5407LNCS_n_p16_Areces
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id paper:paper_03029743_v5407LNCS_n_p16_Areces
record_format dspace
spelling paper:paper_03029743_v5407LNCS_n_p16_Areces2025-07-30T18:06:15Z Completeness results for memory logics Areces, Carlos Eduardo Figueira, Santiago Daniel Mera, Sergio Fernando 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. 2009 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v5407LNCS_n_p16_Areces 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, Carlos Eduardo
Figueira, Santiago Daniel
Mera, Sergio Fernando
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.
author Areces, Carlos Eduardo
Figueira, Santiago Daniel
Mera, Sergio Fernando
author_facet Areces, Carlos Eduardo
Figueira, Santiago Daniel
Mera, Sergio Fernando
author_sort Areces, Carlos Eduardo
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
publishDate 2009
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v5407LNCS_n_p16_Areces
http://hdl.handle.net/20.500.12110/paper_03029743_v5407LNCS_n_p16_Areces
work_keys_str_mv AT arecescarloseduardo completenessresultsformemorylogics
AT figueirasantiagodaniel completenessresultsformemorylogics
AT merasergiofernando completenessresultsformemorylogics
_version_ 1840327865658245120

Ejemplares similares