Jorge, Juan Pablo and Vázquez, Hernán Luis and Holik, Federico (2024) Valuaciones de complejidad: un marco semántico general para lenguajes proposicionales. [Preprint]
Text
Jorge_Vázquez_Holik__Actas_Dr__A__Monteiro (1).pdf Download (344kB) |
|
Archive
Jorge-Vázquez-Holik, Actas Dr. A. Monteiro.zip Download (167kB) |
Abstract
A general mathematical framework is presented, based on countable partitions of Natural Numbers,is presented [1], that allows to provide a Semantics to propositional languages. It has the particularity of allowing both the valuations and the interpretation Sets for the connectives to discriminate complexity of the formulas. This allows different adequacy criteria to be used to assess formulas associated with the same connective, but that differ in their complexity. The presented method can be adapted to an potentially infinite number of connec-tives and truth values, therefore, it can be considered a general framework to provide semantics to several of the known logic systems (eg, LC, L3 LP, FDE). The presented semantics allow to converge to different standard semantics if the separation complexity procedure is annulled. Therefore, it can be understood as a framework that allows greater precision (in complexity terms) with respect to formula satisfaction. Naturally, because of how it is built, it can be incorporated into non-deterministic semantics. The presented procedure also allows generating valuations that grant a different truth value to each formula of propositional language. As a positive side effect, our method allows a constructive proof of the equipotence between N and N^n for all Natural n.
Export/Citation: | EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL |
Social Networking: |
Monthly Views for the past 3 years
Monthly Downloads for the past 3 years
Plum Analytics
Altmetric.com
Actions (login required)
View Item |