Characterization and definability in modal first-order fragments - Computer Science > Logic in Computer ScienceReportar como inadecuado




Characterization and definability in modal first-order fragments - Computer Science > Logic in Computer Science - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Model theoretic results such as Characterization and Definability giveimportant information about different logics. It is well known that the proofsof those results for several modal logics have, somehow, the same -taste-. Ageneral proof for most modal logics below first order is still too ambitious.In this thesis we plan to isolate sufficient conditions for thecharacterization and definability theorems to hold in a wide range of logics.Along with these conditions we will prove that, whichever logic that meetsthem, satisfies both theorems. Therefore, one could give an unifying proof forlogics with already known results. Moreover, one will be able to provecharacterization and definability results for logics that have not yet beeninvestigated. In both cases, it is only needed to check that a logic meets therequirements to automatically derive the desired results.



Autor: Facundo Carreiro

Fuente: https://arxiv.org/







Documentos relacionados