A remark on functional completeness of binary expansions of Kleene’s strong 3-valued logic
[EN] A classical result by Słupecki states that a logic L is functionally complete for the 3-element set of truth-values THREE if, in addition to functionally including Łukasiewicz’s 3-valued logic Ł3, what he names the ‘T -function’ is definable in L. By leaning upon this classical result, we prove...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2022 |
| País: | España |
| Recursos: | Universidad de León |
| Repositorio: | BULERIA. Repositorio Institucional de la Universidad de León |
| OAI Identifier: | oai:buleria.unileon.es:10612/25669 |
| Acesso em linha: | https://hdl.handle.net/10612/25669 |
| Access Level: | acceso abierto |
| Palavra-chave: | Lógica 3-valued logic Kleene’s strong 3-valued logic Łukasiewicz’s 3-valued logic Functional completeness 11 Lógica |
| Resumo: | [EN] A classical result by Słupecki states that a logic L is functionally complete for the 3-element set of truth-values THREE if, in addition to functionally including Łukasiewicz’s 3-valued logic Ł3, what he names the ‘T -function’ is definable in L. By leaning upon this classical result, we prove a general theorem for defining binary expansions (i.e., expansions with a binary connective) of Kleene’s strong logic that are functionally complete for THREE. |
|---|