Subprevarieties Versus Extensions. Application to the Logic of Paradox
|
Descargar SCORM
Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
Subprevarieties Versus Extensions. Application to the Logic of Paradox
|
| Id. |
37476186 |
| Idioma |
inglés
|
| Titulo |
Subprevarieties Versus Extensions. Application to the Logic of Paradox |
| Autor(es) |
Pynko, Alexej P.
|
| Localización |
http://projecteuclid.org/euclid.jsl/1183746075
J. Symbolic Logic 65, iss. 2 (2000), 756-766
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
In the present paper we prove that the poset of all extensions of the logic defined by a class of matrices whose sets of distinguished values are equationally definable by their algebra reducts is the retract, under a Galois connection, of the poset of all subprevarieties of the prevariety generated by the class of the algebra reducts of the matrices involved. We apply this general result to the problem of finding and studying all extensions of the logic of paradox (viz., the implication-free fragment of any non-classical normal extension of the relevance-mingle logic). In order to solve this problem, we first study the structure of prevarieties of Kleene lattices. Then, we show that the poset of extensions of the logic of paradox forms a four-element chain, all the extensions being finitely many-valued and finitely-axiomatizable logics. There are just two proper consistent extensions of the logic of paradox. The first is the classical logic that is relatively axiomatized by the Modus ponens rule for the material implication. The second extension, being intermediate between the logic of paradox and the classical logic, is the one relatively axiomatized by the Ex Contradictione Quodlibet rule.
|
| Palabras clave |
Propositional Logic
|
| Tipo de recurso |
Text
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
Copyright 2000 Association for Symbolic Logic |
| Requerimientos técnicos |
Browser: Any
|
| Fecha de contribución |
21-nov-2008 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
