Blocking the routes to triviality with depth relevance
[EN] In Rogerson and Restall’s (J Philos Log 36, 2006, p. 435), the “class of implication formulas known to trivialize (NC)” (NC abbreviates “naïve comprehension”) is recorded. The aim of this paper is to show how to invalidate any member in this class by using “weak relevant model structures”. Weak...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2014 |
| País: | España |
| Institución: | Universidad de León |
| Repositorio: | BULERIA. Repositorio Institucional de la Universidad de León |
| OAI Identifier: | oai:buleria.unileon.es:10612/25757 |
| Acceso en línea: | https://link.springer.com/article/10.1007/s10849-014-9199-7 https://hdl.handle.net/10612/25757 |
| Access Level: | acceso abierto |
| Palabra clave: | Lógica Naive set theory Weak relevant model structures Depth relevance Deep relevant logics 11 Lógica |
| Sumario: | [EN] In Rogerson and Restall’s (J Philos Log 36, 2006, p. 435), the “class of implication formulas known to trivialize (NC)” (NC abbreviates “naïve comprehension”) is recorded. The aim of this paper is to show how to invalidate any member in this class by using “weak relevant model structures”. Weak relevant model structures verify deep relevant logics only. |
|---|