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

Cignoli, Roberto Leonardo Oscar; Torrens Torrell, Antoni

info:eu-repo/semantics/article

Fecha

2005-05

Registro en:

Cignoli, 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

1432-7643

http://hdl.handle.net/11336/110170

1433-7479

CONICET Digital

CONICET

https://repositorioslatinoamericanos.uchile.cl/handle/2250/4335336

Autor

Cignoli, Roberto Leonardo Oscar

Torrens Torrell, Antoni

Institución

Consejo Nacional de Investigaciones Científicas y Tecnológicas (Argentina)

Resumen

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

Materias

MATHEMATICAL LOGIC

CONTROL ENGINEER

COMPUTING METHODOLOGY

BASIC LOGIC

SIMPLE COMPONENT

Mostrar el registro completo del ítem