Modus ponens on Boolean algebras revisited

In a Boolean Algebra B, an inequality f(x,x -> y))<=y satisfying the condition f(1,1)=1, is considered for defining operations a->b among the elements of B. These operations are called ``Conditionals'' for f. In this paper, we obtain all the boolean Conditionals and Internal Condi...

Descripción completa

Detalles Bibliográficos
Autores: Trillas i Gay, Enric, Cubillo Villanueva, Susana
Tipo de recurso: artículo
Fecha de publicación:1996
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2099/2618
Acceso en línea:https://hdl.handle.net/2099/2618
Access Level:acceso abierto
Palabra clave:Boolean algebras
Conditionals
Àlgebra booleana
Lògica algebraica
Classificació AMS::03 Mathematical logic and foundations::03G Algebraic logic
id ES_c6c97273952e070ce1ce3053ba5cb0a7
oai_identifier_str oai:upcommons.upc.edu:2099/2618
network_acronym_str ES
network_name_str España
repository_id_str
spelling Modus ponens on Boolean algebras revisitedTrillas i Gay, EnricCubillo Villanueva, SusanaBoolean algebrasConditionalsÀlgebra booleanaLògica algebraicaClassificació AMS::03 Mathematical logic and foundations::03G Algebraic logicIn a Boolean Algebra B, an inequality f(x,x -> y))<=y satisfying the condition f(1,1)=1, is considered for defining operations a->b among the elements of B. These operations are called ``Conditionals'' for f. In this paper, we obtain all the boolean Conditionals and Internal Conditionals, and some of their properties as, for example, monotonicity are briefly discussed.Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica19961996-01-0120072007-04-03journal articlehttp://purl.org/coar/resource_type/c_6501NAhttp://purl.org/coar/version/c_be7fb7dd8ff6fe43info:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2099/2618reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2http://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2099/26182026-05-27T15:37:01Z
dc.title.none.fl_str_mv Modus ponens on Boolean algebras revisited
title Modus ponens on Boolean algebras revisited
spellingShingle Modus ponens on Boolean algebras revisited
Trillas i Gay, Enric
Boolean algebras
Conditionals
Àlgebra booleana
Lògica algebraica
Classificació AMS::03 Mathematical logic and foundations::03G Algebraic logic
title_short Modus ponens on Boolean algebras revisited
title_full Modus ponens on Boolean algebras revisited
title_fullStr Modus ponens on Boolean algebras revisited
title_full_unstemmed Modus ponens on Boolean algebras revisited
title_sort Modus ponens on Boolean algebras revisited
dc.creator.none.fl_str_mv Trillas i Gay, Enric
Cubillo Villanueva, Susana
author Trillas i Gay, Enric
author_facet Trillas i Gay, Enric
Cubillo Villanueva, Susana
author_role author
author2 Cubillo Villanueva, Susana
author2_role author
dc.subject.none.fl_str_mv Boolean algebras
Conditionals
Àlgebra booleana
Lògica algebraica
Classificació AMS::03 Mathematical logic and foundations::03G Algebraic logic
topic Boolean algebras
Conditionals
Àlgebra booleana
Lògica algebraica
Classificació AMS::03 Mathematical logic and foundations::03G Algebraic logic
description In a Boolean Algebra B, an inequality f(x,x -> y))<=y satisfying the condition f(1,1)=1, is considered for defining operations a->b among the elements of B. These operations are called ``Conditionals'' for f. In this paper, we obtain all the boolean Conditionals and Internal Conditionals, and some of their properties as, for example, monotonicity are briefly discussed.
publishDate 1996
dc.date.none.fl_str_mv 1996
1996-01-01
2007
2007-04-03
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
NA
http://purl.org/coar/version/c_be7fb7dd8ff6fe43
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2099/2618
url https://hdl.handle.net/2099/2618
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2

http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2

http://creativecommons.org/licenses/by-nc-nd/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica
publisher.none.fl_str_mv Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869419102280351744
score 15,300719

Similares en LA Referencia