Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction)

We present a coinductive definition of models for modal logics and show that it provides a homogeneous framework in which it is possible to include different modal languages ranging from classical modalities to operators from hybrid and memory logics. Moreover, results that had to be proved separate...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 2010
Materias:
Hybrid logics
Modal depth
Modal logics
Normal forms
Bisimulations
Coinduction
Conjunctive normal forms
Hybrid logic
Modal formulas
Modal language
Modal logic
Normal form
Polynomial-time
Propositional logic
Satisfiability
Polynomial approximation
Boolean functions
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15708683_v8_n4_p305_Areces
http://hdl.handle.net/20.500.12110/paper_15708683_v8_n4_p305_Areces
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares