LBPC-I paraconsistent system

The language of the LBPc¬I system extends the language of positive classical logic by including a weak negation operator and an incompatibility operator, in addition, it allows defining a strong negation operator; The latter has all the characteristics of classical negation. The system is characteri...

Full description

Autores:
Sierra A., Manuel
Tipo de recurso:
Fecha de publicación:
2006
Institución:
Universidad EAFIT
Repositorio:
Repositorio EAFIT
Idioma:
spa
OAI Identifier:
oai:repository.eafit.edu.co:10784/14558
Acceso en línea:
http://hdl.handle.net/10784/14558
Palabra clave:
Pain Compatibility
Weak Denial
Para-Consistent Deductive System
Paincompatibilidad
Negación Débil
Sistema Deductivo Para-Consistente
Rights
License
Copyright (c) 2006 Manuel Sierra A.
id REPOEAFIT2_03114c328ed32f72d4f5a915f243f692
oai_identifier_str oai:repository.eafit.edu.co:10784/14558
network_acronym_str REPOEAFIT2
network_name_str Repositorio EAFIT
repository_id_str
spelling Medellín de: Lat: 06 15 00 N degrees minutes Lat: 6.2500 decimal degrees Long: 075 36 00 W degrees minutes Long: -75.6000 decimal degrees2006-12-012019-11-22T19:18:49Z2006-12-012019-11-22T19:18:49Z2256-43141794-9165http://hdl.handle.net/10784/14558The language of the LBPc¬I system extends the language of positive classical logic by including a weak negation operator and an incompatibility operator, in addition, it allows defining a strong negation operator; The latter has all the characteristics of classical negation. The system is characterized by a semantics of traditional valuations with which it is proved that, with respect to the weak negation operator, the system is paraconsistent. As expected, when the formulas involved in an argument behave classically, that is, they are incompatible with their weak denial, then weak denial behaves like classical denial, but this requirement is not always necessary, weak denial can be punctually as powerful as the classic one, although the formulas involved do not behave classically.El lenguaje del sistema LBPc¬I extiende el lenguaje de la lógica clásica positiva al incluir un operador de negación débil y un operador de incompatibilidad, además, permite definir un operador de negación fuerte; este último tiene todas las características de la negación clásica. El sistema es caracterizado por una semántica de valuaciones tradicionales con la cual se prueba que, respecto al operador de negación débil, el sistema es paraconsistente. Como es de esperarse, cuando las fórmulas involucradas en un argumento se comportan clásicamente, es decir, son incompatibles con su negación débil, entonces la negación débil se comporta como la negación clásica, pero este requisito no siempre es necesario, la negación débil puede ser puntualmente tan potente como la clásica, aunque las fórmulas involucradas no se comporten clásicamente.application/pdfspaUniversidad EAFIThttp://publicaciones.eafit.edu.co/index.php/ingciencia/article/view/475http://publicaciones.eafit.edu.co/index.php/ingciencia/article/view/475Copyright (c) 2006 Manuel Sierra A.Acceso abiertohttp://purl.org/coar/access_right/c_abf2instname:Universidad EAFITreponame:Repositorio Institucional Universidad EAFITIngeniería y Ciencia; Vol 2, No 4 (2006)LBPC-I paraconsistent systemSistema paraconsistente LBPc¬Iarticleinfo:eu-repo/semantics/articlepublishedVersioninfo:eu-repo/semantics/publishedVersionArtículohttp://purl.org/coar/version/c_970fb48d4fbd8a85http://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1Pain CompatibilityWeak DenialPara-Consistent Deductive SystemPaincompatibilidadNegación DébilSistema Deductivo Para-ConsistenteSierra A., ManuelUniversidad EAFITIngeniería y Ciencia24163178ing.cienc.THUMBNAILminaitura-ig_Mesa de trabajo 1.jpgminaitura-ig_Mesa de trabajo 1.jpgimage/jpeg265796https://repository.eafit.edu.co/bitstreams/0f146bf0-f248-4636-974a-e3cb98089635/downloadda9b21a5c7e00c7f1127cef8e97035e0MD51ORIGINALdocument (3).pdfdocument (3).pdfTexto completo PDFapplication/pdf164755https://repository.eafit.edu.co/bitstreams/1d84a8bd-4777-4547-a42f-d2c2f2c90002/download1b6d30a50a01cc2e36a17a3c6ca2bfa5MD52articulo.htmlarticulo.htmlTexto completo HTMLtext/html373https://repository.eafit.edu.co/bitstreams/227face8-57e4-4a87-b5a3-5bdaa9cbd088/download07ed9b7a14cbd7f8357098e96c3262d4MD5310784/14558oai:repository.eafit.edu.co:10784/145582020-03-02 23:31:23.436open.accesshttps://repository.eafit.edu.coRepositorio Institucional Universidad EAFITrepositorio@eafit.edu.co
dc.title.eng.fl_str_mv LBPC-I paraconsistent system
dc.title.spa.fl_str_mv Sistema paraconsistente LBPc¬I
title LBPC-I paraconsistent system
spellingShingle LBPC-I paraconsistent system
Pain Compatibility
Weak Denial
Para-Consistent Deductive System
Paincompatibilidad
Negación Débil
Sistema Deductivo Para-Consistente
title_short LBPC-I paraconsistent system
title_full LBPC-I paraconsistent system
title_fullStr LBPC-I paraconsistent system
title_full_unstemmed LBPC-I paraconsistent system
title_sort LBPC-I paraconsistent system
dc.creator.fl_str_mv Sierra A., Manuel
dc.contributor.author.spa.fl_str_mv Sierra A., Manuel
dc.contributor.affiliation.spa.fl_str_mv Universidad EAFIT
dc.subject.keyword.eng.fl_str_mv Pain Compatibility
Weak Denial
Para-Consistent Deductive System
topic Pain Compatibility
Weak Denial
Para-Consistent Deductive System
Paincompatibilidad
Negación Débil
Sistema Deductivo Para-Consistente
dc.subject.keyword.spa.fl_str_mv Paincompatibilidad
Negación Débil
Sistema Deductivo Para-Consistente
description The language of the LBPc¬I system extends the language of positive classical logic by including a weak negation operator and an incompatibility operator, in addition, it allows defining a strong negation operator; The latter has all the characteristics of classical negation. The system is characterized by a semantics of traditional valuations with which it is proved that, with respect to the weak negation operator, the system is paraconsistent. As expected, when the formulas involved in an argument behave classically, that is, they are incompatible with their weak denial, then weak denial behaves like classical denial, but this requirement is not always necessary, weak denial can be punctually as powerful as the classic one, although the formulas involved do not behave classically.
publishDate 2006
dc.date.issued.none.fl_str_mv 2006-12-01
dc.date.available.none.fl_str_mv 2019-11-22T19:18:49Z
dc.date.accessioned.none.fl_str_mv 2019-11-22T19:18:49Z
dc.date.none.fl_str_mv 2006-12-01
dc.type.eng.fl_str_mv article
info:eu-repo/semantics/article
publishedVersion
info:eu-repo/semantics/publishedVersion
dc.type.coarversion.fl_str_mv http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.coar.fl_str_mv http://purl.org/coar/resource_type/c_6501
http://purl.org/coar/resource_type/c_2df8fbb1
dc.type.local.spa.fl_str_mv Artículo
status_str publishedVersion
dc.identifier.issn.none.fl_str_mv 2256-4314
1794-9165
dc.identifier.uri.none.fl_str_mv http://hdl.handle.net/10784/14558
identifier_str_mv 2256-4314
1794-9165
url http://hdl.handle.net/10784/14558
dc.language.iso.spa.fl_str_mv spa
language spa
dc.relation.isversionof.none.fl_str_mv http://publicaciones.eafit.edu.co/index.php/ingciencia/article/view/475
dc.relation.uri.none.fl_str_mv http://publicaciones.eafit.edu.co/index.php/ingciencia/article/view/475
dc.rights.eng.fl_str_mv Copyright (c) 2006 Manuel Sierra A.
dc.rights.coar.fl_str_mv http://purl.org/coar/access_right/c_abf2
dc.rights.local.spa.fl_str_mv Acceso abierto
rights_invalid_str_mv Copyright (c) 2006 Manuel Sierra A.
Acceso abierto
http://purl.org/coar/access_right/c_abf2
dc.format.none.fl_str_mv application/pdf
dc.coverage.spatial.eng.fl_str_mv Medellín de: Lat: 06 15 00 N degrees minutes Lat: 6.2500 decimal degrees Long: 075 36 00 W degrees minutes Long: -75.6000 decimal degrees
dc.publisher.spa.fl_str_mv Universidad EAFIT
dc.source.none.fl_str_mv instname:Universidad EAFIT
reponame:Repositorio Institucional Universidad EAFIT
dc.source.spa.fl_str_mv Ingeniería y Ciencia; Vol 2, No 4 (2006)
instname_str Universidad EAFIT
institution Universidad EAFIT
reponame_str Repositorio Institucional Universidad EAFIT
collection Repositorio Institucional Universidad EAFIT
bitstream.url.fl_str_mv https://repository.eafit.edu.co/bitstreams/0f146bf0-f248-4636-974a-e3cb98089635/download
https://repository.eafit.edu.co/bitstreams/1d84a8bd-4777-4547-a42f-d2c2f2c90002/download
https://repository.eafit.edu.co/bitstreams/227face8-57e4-4a87-b5a3-5bdaa9cbd088/download
bitstream.checksum.fl_str_mv da9b21a5c7e00c7f1127cef8e97035e0
1b6d30a50a01cc2e36a17a3c6ca2bfa5
07ed9b7a14cbd7f8357098e96c3262d4
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
repository.name.fl_str_mv Repositorio Institucional Universidad EAFIT
repository.mail.fl_str_mv repositorio@eafit.edu.co
_version_ 1808498877862510592