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: | Areces, C., Figueira, S., Mera, S. |
---|---|
Formato: | SER |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_03029743_v5407LNCS_n_p16_Areces |
Aporte de: |
Ejemplares similares
-
Completeness results for memory logics
por: Areces, Carlos Eduardo, et al.
Publicado: (2009) -
Completeness results for memory logics
por: Areces, C., et al. -
Completeness results for memory logics
por: Areces, Carlos Eduardo, et al.
Publicado: (2012) -
Basic model theory for memory logics
por: Areces, C., et al. -
Tableaux and model checking for memory logics
por: Areces, C., et al.