Complexidade descritiva das lógicas de ordem superior com menor ponto fixo e análise de expressividade de algumas lógicas modais

• Ano de defesa: 2010
• Autor(a) principal: Freire, Cibele Matos
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Palavras-chave em Português: Logigas e semantica de programas; Complexidade descritiva; Logica modal; Logicas de ordem superior; Hierarquia determinística de tempo exponencial; Operadores de ponto fixo; Descriptive complexity; Modal logic; Higher-order logics; Deterministic exponential time hierarchy; Fixed-point operators; Modalidade (Lógica); Lógica de computador; Teoria do ponto fixo; Complexidade computacional
• Link de acesso: http://www.repositorio.ufc.br/handle/riufc/17668

In Descriptive Complexity, we investigate the use of logics to characterize computational classes os problems through complexity. Since 1974, when Fagin proved that the class NP is captured by existential second-order logic, considered the rst result in this area, other relations between logics and complexity classes have been established. Wellknown results usually involve rst-order logic and its extensions, and complexity classes in polynomial time or space. Some examples are that the rst-order logic extended by the least xed-point operator captures the class P and the second-order logic extended by the transitive closure operator captures the class PSPACE. In this dissertation, we will initially analyze the expressive power of some modal logics with respect to the decision problem REACH and see that is possible to express it with temporal logics CTL and CTL . We will also analyze the combined use of higher-order logics extended by the least xed-point operator and obtain as result that each level of this hierarchy captures each level of the deterministic exponential time hierarchy. As a corollary, we will prove that the hierarchy of HOi(LFP), for i 2, does not collapse, that is, HOi(LFP) HOi+1(LFP)