On the formal semantics of IF-like logics

Autores
Figueira, S.; Gorín, D.; Grimson, R.
Año de publicación
2010
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In classical logics, the meaning of a formula is invariant with respect to the renaming of bound variables. This property, normally taken for granted, has been shown not to hold in the case of Independence Friendly (IF) logics. In this paper we argue that this is not an inherent characteristic of these logics but a defect in the way in which the compositional semantics given by Hodges for the regular fragment was generalized to arbitrary formulas. We fix this by proposing an alternative formalization, based on a variation of the classical notion of valuation. Basic metatheoretical results are proven. We present these results for Hodges' slash logic (from which these can be easily transferred to other IF-like logics) and we also consider the flattening operator, for which we give novel game-theoretical semantics. © 2009 Elsevier Inc. All rights reserved.
Fil:Figueira, S. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fil:Gorín, D. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fuente
J. Comput. Syst. Sci. 2010;76(5):333-346
Materia
Compositional semantics
Flattening operator
Full abstraction
Independence friendly logic
Regular formulas
Signaling
Valuation
Bound variables
Classical logic
Compositional semantics
Flattening operator
Formal Semantics
Full abstraction
Abstracting
Formal methods
Game theory
Signaling
Semantics
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by/2.5/ar
Repositorio
Biblioteca Digital (UBA-FCEN)
Institución
Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
OAI Identificador
paperaa:paper_00220000_v76_n5_p333_Figueira

id BDUBAFCEN_d9cf4bedcec3c0cd110af0127e13241a
oai_identifier_str paperaa:paper_00220000_v76_n5_p333_Figueira
network_acronym_str BDUBAFCEN
repository_id_str 1896
network_name_str Biblioteca Digital (UBA-FCEN)
spelling On the formal semantics of IF-like logicsFigueira, S.Gorín, D.Grimson, R.Compositional semanticsFlattening operatorFull abstractionIndependence friendly logicRegular formulasSignalingValuationBound variablesClassical logicCompositional semanticsFlattening operatorFormal SemanticsFull abstractionAbstractingFormal methodsGame theorySignalingSemanticsIn classical logics, the meaning of a formula is invariant with respect to the renaming of bound variables. This property, normally taken for granted, has been shown not to hold in the case of Independence Friendly (IF) logics. In this paper we argue that this is not an inherent characteristic of these logics but a defect in the way in which the compositional semantics given by Hodges for the regular fragment was generalized to arbitrary formulas. We fix this by proposing an alternative formalization, based on a variation of the classical notion of valuation. Basic metatheoretical results are proven. We present these results for Hodges' slash logic (from which these can be easily transferred to other IF-like logics) and we also consider the flattening operator, for which we give novel game-theoretical semantics. © 2009 Elsevier Inc. All rights reserved.Fil:Figueira, S. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.Fil:Gorín, D. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.2010info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfhttp://hdl.handle.net/20.500.12110/paper_00220000_v76_n5_p333_FigueiraJ. Comput. Syst. Sci. 2010;76(5):333-346reponame:Biblioteca Digital (UBA-FCEN)instname:Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturalesinstacron:UBA-FCENenginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/2.5/ar2025-11-06T09:39:39Zpaperaa:paper_00220000_v76_n5_p333_FigueiraInstitucionalhttps://digital.bl.fcen.uba.ar/Universidad públicaNo correspondehttps://digital.bl.fcen.uba.ar/cgi-bin/oaiserver.cgiana@bl.fcen.uba.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:18962025-11-06 09:39:41.199Biblioteca Digital (UBA-FCEN) - Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturalesfalse
dc.title.none.fl_str_mv On the formal semantics of IF-like logics
title On the formal semantics of IF-like logics
spellingShingle On the formal semantics of IF-like logics
Figueira, S.
Compositional semantics
Flattening operator
Full abstraction
Independence friendly logic
Regular formulas
Signaling
Valuation
Bound variables
Classical logic
Compositional semantics
Flattening operator
Formal Semantics
Full abstraction
Abstracting
Formal methods
Game theory
Signaling
Semantics
title_short On the formal semantics of IF-like logics
title_full On the formal semantics of IF-like logics
title_fullStr On the formal semantics of IF-like logics
title_full_unstemmed On the formal semantics of IF-like logics
title_sort On the formal semantics of IF-like logics
dc.creator.none.fl_str_mv Figueira, S.
Gorín, D.
Grimson, R.
author Figueira, S.
author_facet Figueira, S.
Gorín, D.
Grimson, R.
author_role author
author2 Gorín, D.
Grimson, R.
author2_role author
author
dc.subject.none.fl_str_mv Compositional semantics
Flattening operator
Full abstraction
Independence friendly logic
Regular formulas
Signaling
Valuation
Bound variables
Classical logic
Compositional semantics
Flattening operator
Formal Semantics
Full abstraction
Abstracting
Formal methods
Game theory
Signaling
Semantics
topic Compositional semantics
Flattening operator
Full abstraction
Independence friendly logic
Regular formulas
Signaling
Valuation
Bound variables
Classical logic
Compositional semantics
Flattening operator
Formal Semantics
Full abstraction
Abstracting
Formal methods
Game theory
Signaling
Semantics
dc.description.none.fl_txt_mv In classical logics, the meaning of a formula is invariant with respect to the renaming of bound variables. This property, normally taken for granted, has been shown not to hold in the case of Independence Friendly (IF) logics. In this paper we argue that this is not an inherent characteristic of these logics but a defect in the way in which the compositional semantics given by Hodges for the regular fragment was generalized to arbitrary formulas. We fix this by proposing an alternative formalization, based on a variation of the classical notion of valuation. Basic metatheoretical results are proven. We present these results for Hodges' slash logic (from which these can be easily transferred to other IF-like logics) and we also consider the flattening operator, for which we give novel game-theoretical semantics. © 2009 Elsevier Inc. All rights reserved.
Fil:Figueira, S. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
Fil:Gorín, D. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
description In classical logics, the meaning of a formula is invariant with respect to the renaming of bound variables. This property, normally taken for granted, has been shown not to hold in the case of Independence Friendly (IF) logics. In this paper we argue that this is not an inherent characteristic of these logics but a defect in the way in which the compositional semantics given by Hodges for the regular fragment was generalized to arbitrary formulas. We fix this by proposing an alternative formalization, based on a variation of the classical notion of valuation. Basic metatheoretical results are proven. We present these results for Hodges' slash logic (from which these can be easily transferred to other IF-like logics) and we also consider the flattening operator, for which we give novel game-theoretical semantics. © 2009 Elsevier Inc. All rights reserved.
publishDate 2010
dc.date.none.fl_str_mv 2010
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
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://hdl.handle.net/20.500.12110/paper_00220000_v76_n5_p333_Figueira
url http://hdl.handle.net/20.500.12110/paper_00220000_v76_n5_p333_Figueira
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by/2.5/ar
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/2.5/ar
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv J. Comput. Syst. Sci. 2010;76(5):333-346
reponame:Biblioteca Digital (UBA-FCEN)
instname:Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron:UBA-FCEN
reponame_str Biblioteca Digital (UBA-FCEN)
collection Biblioteca Digital (UBA-FCEN)
instname_str Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron_str UBA-FCEN
institution UBA-FCEN
repository.name.fl_str_mv Biblioteca Digital (UBA-FCEN) - Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
repository.mail.fl_str_mv ana@bl.fcen.uba.ar
_version_ 1848046091400904704
score 13.087074