Standard completeness of Hájek basic logic and decompositions of BL-chains

dc.creatorCignoli, Roberto Leonardo Oscar
dc.creatorTorrens Torrell, Antoni
dc.date.accessioned2020-07-24T15:03:36Z
dc.date.accessioned2022-10-15T02:30:35Z
dc.date.available2020-07-24T15:03:36Z
dc.date.available2022-10-15T02:30:35Z
dc.date.created2020-07-24T15:03:36Z
dc.date.issued2005-05
dc.identifierCignoli, Roberto Leonardo Oscar; Torrens Torrell, Antoni; Standard completeness of Hájek basic logic and decompositions of BL-chains; Springer; Soft Computing; 9; 12; 5-2005; 862-868
dc.identifier1432-7643
dc.identifierhttp://hdl.handle.net/11336/110170
dc.identifier1433-7479
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4335336
dc.description.abstractThe aim of this paper is to survey the tools needed to prove the standard completeness of Hájek Basic Logic with respect to continuous t-norms. In particular, decompositions of   totally ordered BL-algebras into simpler components are considered in some detail.
dc.languageeng
dc.publisherSpringer
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007/s00500-004-0444-x
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/https://doi.org/10.1007/s00500-004-0444-x
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subjectMATHEMATICAL LOGIC
dc.subjectCONTROL ENGINEER
dc.subjectCOMPUTING METHODOLOGY
dc.subjectBASIC LOGIC
dc.subjectSIMPLE COMPONENT
dc.titleStandard completeness of Hájek basic logic and decompositions of BL-chains
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:ar-repo/semantics/artículo
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución