
En logique classique, la signification d'une formule est invariante par rapport au changement de nom des variables liées. Il a été démontré que cette propriété, normalement prise pour acquise, ne tient pas dans le cas des logiques favorables à l'indépendance (IF). Dans cet article, nous soutenons qu'il ne s'agit pas d'une caractéristique inhérente à ces logiques, mais d'un défaut dans la manière dont la sémantique compositionnelle donnée par Hodges pour le fragment régulier a été généralisée à des formules arbitraires. Nous corrigeons cela en proposant une formalisation alternative, basée sur une variation de la notion classique de valorisation. Les résultats métathéorétiques de base sont prouvés. Nous présentons ces résultats pour la logique slash de Hodges (à partir de laquelle ceux-ci peuvent être facilement transférés vers d'autres logiques de type IF) et nous considérons également l'opérateur d'aplatissement, pour lequel nous donnons une nouvelle sémantique de la théorie des jeux.
En la lógica clásica, el significado de una fórmula es invariante con respecto al cambio de nombre de las variables unidas. Se ha demostrado que esta propiedad, que normalmente se da por sentada, no se mantiene en el caso de las lógicas favorables a la independencia (IF). En este artículo argumentamos que esta no es una característica inherente de estas lógicas, sino un defecto en la forma en que la semántica compositiva dada por Hodges para el fragmento regular se generalizó a fórmulas arbitrarias. Lo solucionamos proponiendo una formalización alternativa, basada en una variación de la noción clásica de valoración. Los resultados metateóricos básicos están probados. Presentamos estos resultados para la lógica de barra oblicua de Hodges (desde la cual se pueden transferir fácilmente a otras lógicas similares a IF) y también consideramos el operador de aplanamiento, para el cual damos una semántica teórica de juegos novedosa.
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.
في المنطق الكلاسيكي، يكون معنى الصيغة ثابتًا فيما يتعلق بإعادة تسمية المتغيرات المرتبطة. وقد تبين أن هذه الخاصية، التي تؤخذ عادة كأمر مسلم به، لا تحتفظ في حالة المنطق الصديق للاستقلال (IF). في هذه الورقة، نجادل بأن هذه ليست سمة متأصلة في هذه المنطق ولكنها عيب في الطريقة التي تم بها تعميم الدلالات التركيبية التي قدمها هودجز للجزء العادي على الصيغ التعسفية. نصلح هذا من خلال اقتراح إضفاء الطابع الرسمي البديل، بناءً على اختلاف المفهوم الكلاسيكي للتقييم. تم إثبات النتائج النظرية الفوقية الأساسية. نقدم هذه النتائج لمنطق القطع لهودجز (الذي يمكن من خلاله نقلها بسهولة إلى منطق آخر يشبه IF) وننظر أيضًا في عامل التسطيح، والذي نعطيه دلالات نظرية جديدة للعبة.
Monoidal t-norm logic, Artificial intelligence, Principle of compositionality, Gene, Biochemistry, independence-friendly logic, Logic Programming and Knowledge Representation, full abstraction, https://purl.org/becyt/ford/1.1, Independence friendly logic, Game theory, Regular formulas, flattening operator, Fuzzy number, Nonmonotonic Reasoning, Applied Mathematics, Membership function, Discrete mathematics, Independence friendly logic; Regular formulas; Signaling; Valuation; Compositional semantics; Full abstraction; Flattening operator, Formal semantics (linguistics), Semantics, Programming language, Chemistry, Full abstraction, Computational Theory and Mathematics, Mathematical physics, Physical Sciences, regular formulas, Program Analysis and Verification Techniques, signaling, valuation, Modal Logics, Computer Networks and Communications, Compositional Semantics, Flattening operator, Operator (biology), T-norm fuzzy logics, Description Logics, Theoretical Computer Science, Information Friendly Logic, Theoretical computer science, Compositional semantics, Temporal Logic, Artificial Intelligence, Classical logic, Abstracting, Fuzzy Logic and Residuated Lattices, Programming Language Semantics, FOS: Mathematics, https://purl.org/becyt/ford/1, Algebra over a field, Mathematical economics, Formal methods, Regular Formulas, Pure mathematics, Semantics (computer science), Invariant (physics), Other nonclassical logic, Computer science, Signaling, Valuation, Bound variables, Fuzzy logic, Computer Science, Repressor, Fuzzy set, compositional semantics, Transcription factor, Formal Semantics, Mathematics
Monoidal t-norm logic, Artificial intelligence, Principle of compositionality, Gene, Biochemistry, independence-friendly logic, Logic Programming and Knowledge Representation, full abstraction, https://purl.org/becyt/ford/1.1, Independence friendly logic, Game theory, Regular formulas, flattening operator, Fuzzy number, Nonmonotonic Reasoning, Applied Mathematics, Membership function, Discrete mathematics, Independence friendly logic; Regular formulas; Signaling; Valuation; Compositional semantics; Full abstraction; Flattening operator, Formal semantics (linguistics), Semantics, Programming language, Chemistry, Full abstraction, Computational Theory and Mathematics, Mathematical physics, Physical Sciences, regular formulas, Program Analysis and Verification Techniques, signaling, valuation, Modal Logics, Computer Networks and Communications, Compositional Semantics, Flattening operator, Operator (biology), T-norm fuzzy logics, Description Logics, Theoretical Computer Science, Information Friendly Logic, Theoretical computer science, Compositional semantics, Temporal Logic, Artificial Intelligence, Classical logic, Abstracting, Fuzzy Logic and Residuated Lattices, Programming Language Semantics, FOS: Mathematics, https://purl.org/becyt/ford/1, Algebra over a field, Mathematical economics, Formal methods, Regular Formulas, Pure mathematics, Semantics (computer science), Invariant (physics), Other nonclassical logic, Computer science, Signaling, Valuation, Bound variables, Fuzzy logic, Computer Science, Repressor, Fuzzy set, compositional semantics, Transcription factor, Formal Semantics, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
