Decidability of quantified propositional intuitionistic logic and S4 on
trees
|
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
|
|
|
Decidability of quantified propositional intuitionistic logic and S4 on
trees
|
| Id. |
400375 |
| Titulo |
Decidability of quantified propositional intuitionistic logic and S4 on
trees |
| Autor(es) |
Zach, Richard
|
| Localización |
http://arxiv.org/abs/math/0203113
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
Quantified propositional intuitionistic logic is obtained from propositional
intuitionistic logic by adding quantifiers \forall p, \exists p over
propositions. In the context of Kripke semantics, a proposition is a subset of
the worlds in a model structure which is upward closed. Kremer (1997) has shown
that the quantified propositional intuitionistic logic H\pi+ based on the class
of all partial orders is recursively isomorphic to full second-order logic. He
raised the question of whether the logic resulting from restriction to trees is
axiomatizable. It is shown that it is, in fact, decidable. The methods used can
also be used to establish the decidability of modal S4 with propositional
quantification on similar types of Kripke structures.
|
| Palabras clave |
Mathematics - Logic
|
| Tipo de recurso |
Texto Narrativo
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
| Requerimientos técnicos |
Browser: Any
|
| Fecha de contribución |
25-feb-2007 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
