On the formal semantics of IF-like logics

Mostrar todas las versiones(5)

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 Information Friendly (IF) logics. In this work we propose an alternative formalization under which invarian...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Figueira, S., Gorín, D., Grimson, R.
Formato:	SER
Materias:	Canning Game theory Information theory Linguistics Semantics Bound variables Classical logics Compositionality Formal Semantics Heidelberg (CO) International (CO) Fuzzy logic
Acceso en línea:	http://hdl.handle.net/20.500.12110/paper_03029743_v5110LNAI_n_p164_Figueira
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	todo:paper_03029743_v5110LNAI_n_p164_Figueira
record_format	dspace
spelling	todo:paper_03029743_v5110LNAI_n_p164_Figueira2023-10-03T15:19:05Z On the formal semantics of IF-like logics Figueira, S. Gorín, D. Grimson, R. Canning Game theory Information theory Linguistics Semantics Bound variables Classical logics Compositionality Formal Semantics Heidelberg (CO) International (CO) Fuzzy logic 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 Information Friendly (IF) logics. In this work we propose an alternative formalization under which invariance with respect the renaming of bound variables is restored. We show that, when one restricts to formulas where each variable is bound only once, our semantics coincide with those previously used in the literature. We also prove basic metatheoretical results of the resulting logic, such as compositionality and truth preserving operations on valuations. We work on Hodges' slash logic (from which results can be easily transferred to other IF-like logics) and we also consider his flattening operator, for which we give a game-theoretical semantics. © 2008 Springer-Verlag Berlin Heidelberg. 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. SER info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_03029743_v5110LNAI_n_p164_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	Canning Game theory Information theory Linguistics Semantics Bound variables Classical logics Compositionality Formal Semantics Heidelberg (CO) International (CO) Fuzzy logic
spellingShingle	Canning Game theory Information theory Linguistics Semantics Bound variables Classical logics Compositionality Formal Semantics Heidelberg (CO) International (CO) Fuzzy logic Figueira, S. Gorín, D. Grimson, R. On the formal semantics of IF-like logics
topic_facet	Canning Game theory Information theory Linguistics Semantics Bound variables Classical logics Compositionality Formal Semantics Heidelberg (CO) International (CO) Fuzzy logic
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 Information Friendly (IF) logics. In this work we propose an alternative formalization under which invariance with respect the renaming of bound variables is restored. We show that, when one restricts to formulas where each variable is bound only once, our semantics coincide with those previously used in the literature. We also prove basic metatheoretical results of the resulting logic, such as compositionality and truth preserving operations on valuations. We work on Hodges' slash logic (from which results can be easily transferred to other IF-like logics) and we also consider his flattening operator, for which we give a game-theoretical semantics. © 2008 Springer-Verlag Berlin Heidelberg.
format	SER
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_03029743_v5110LNAI_n_p164_Figueira
work_keys_str_mv	AT figueiras ontheformalsemanticsofiflikelogics AT gorind ontheformalsemanticsofiflikelogics AT grimsonr ontheformalsemanticsofiflikelogics
_version_	1807321607828406272

On the formal semantics of IF-like logics

Ejemplares similares