On the formal semantics of IF-like logics

Mostrar todas las versiones(4)

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 th...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Figueira, S., Gorín, D., Grimson, R.
Formato:	JOUR
Materias:	Compositional semantics Flattening operator Full abstraction Independence friendly logic Regular formulas Signaling Valuation Bound variables Classical logic Formal Semantics Abstracting Formal methods Game theory Semantics
Acceso en línea:	http://hdl.handle.net/20.500.12110/paper_00220000_v76_n5_p333_Figueira
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	todo:paper_00220000_v76_n5_p333_Figueira
record_format	dspace
spelling	todo:paper_00220000_v76_n5_p333_Figueira2023-10-03T14:25:21Z On the formal semantics of IF-like logics Figueira, S. Gorín, D. Grimson, R. 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 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. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_00220000_v76_n5_p333_Figueira
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
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
spellingShingle	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 Figueira, S. Gorín, D. Grimson, R. On the formal semantics of IF-like logics
topic_facet	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
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.
format	JOUR
author	Figueira, S. Gorín, D. Grimson, R.
author_facet	Figueira, S. Gorín, D. Grimson, R.
author_sort	Figueira, S.
title	On the formal semantics of IF-like logics
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
url	http://hdl.handle.net/20.500.12110/paper_00220000_v76_n5_p333_Figueira
work_keys_str_mv	AT figueiras ontheformalsemanticsofiflikelogics AT gorind ontheformalsemanticsofiflikelogics AT grimsonr ontheformalsemanticsofiflikelogics
_version_	1782023485626777600

On the formal semantics of IF-like logics

Ejemplares similares