On Rich Modal Logics
Autor(a) principal: | |
---|---|
Data de Publicação: | 2013 |
Tipo de documento: | Dissertação |
Idioma: | eng |
Título da fonte: | Repositório Institucional da Universidade Federal do Ceará (UFC) |
Texto Completo: | http://www.repositorio.ufc.br/handle/riufc/9589 |
Resumo: | This thesis is about the enrichment of modal logics. We use the term enrichment in two distinct ways. In the first of them, it is a semantical enrichment. We propose a fuzzy semantics to di erent normal modal logics and we prove a completeness result for a generous class of this logics enriched with multiple instances of the axiom of confluence. A curious fact about this semantics is that it behaves just like the usual boolean-based Kripke semantics for modal logics. The other enrichment is about the expressibility of the logic and it occurs by means of the addition of new connectives, essentially modal negations. In this sense, firstly we study the positive fragment of classical logic extended with a paraconsistent modal negation and we show that this language is su ciently strong to express the normal modal logics. It is also possible to define a paracomplete modal negation and restoration connectives that internalize at the level object-language the notions of consistency and determinedness. This logic constitutes a Logic of Formal Inconsistency and a Logic of Formal Undeterminedness.In such logics, with the objective of recovering lost inferences of classical logic, Derivability Adjustment Theorems are proved. In the case of the logic with one paraconsistent negation, if we remove the implication we still have a rich language, with both paranormal negations and its respective connectives of restoration. In this logic we study the minimal normal modal logic defined by means of a Gentzen calculus, differently of the others modal systems studied, which are presented by means of Hilbert calculus. Next, after we prove a ompleteness result of the deductive system associated to this calculus, we present some extensions of this system and we look for appropriate Derivability Adjustment Theorems. |
id |
UFC-7_f444a36352a63d7d94bc95ecf1578029 |
---|---|
oai_identifier_str |
oai:repositorio.ufc.br:riufc/9589 |
network_acronym_str |
UFC-7 |
network_name_str |
Repositório Institucional da Universidade Federal do Ceará (UFC) |
repository_id_str |
|
spelling |
On Rich Modal LogicsLógica ModalLógica ParanormalLógica DifusaThis thesis is about the enrichment of modal logics. We use the term enrichment in two distinct ways. In the first of them, it is a semantical enrichment. We propose a fuzzy semantics to di erent normal modal logics and we prove a completeness result for a generous class of this logics enriched with multiple instances of the axiom of confluence. A curious fact about this semantics is that it behaves just like the usual boolean-based Kripke semantics for modal logics. The other enrichment is about the expressibility of the logic and it occurs by means of the addition of new connectives, essentially modal negations. In this sense, firstly we study the positive fragment of classical logic extended with a paraconsistent modal negation and we show that this language is su ciently strong to express the normal modal logics. It is also possible to define a paracomplete modal negation and restoration connectives that internalize at the level object-language the notions of consistency and determinedness. This logic constitutes a Logic of Formal Inconsistency and a Logic of Formal Undeterminedness.In such logics, with the objective of recovering lost inferences of classical logic, Derivability Adjustment Theorems are proved. In the case of the logic with one paraconsistent negation, if we remove the implication we still have a rich language, with both paranormal negations and its respective connectives of restoration. In this logic we study the minimal normal modal logic defined by means of a Gentzen calculus, differently of the others modal systems studied, which are presented by means of Hilbert calculus. Next, after we prove a ompleteness result of the deductive system associated to this calculus, we present some extensions of this system and we look for appropriate Derivability Adjustment Theorems.Esta dissertação trata do enriquecimento de lógicas modais. O termo enriquecimento é usado em dois sentidos distintos. No primeiro deles, de fundo semântico, propomos uma semântica difusa para diversas lógicas modais normais e demonstramos um resultado de completude para uma extensa classe dessas lógicas enriquecidas com múltiplas instâncias do axioma da confluência. Um fato curioso a respeito dessa semântica é que ela se comporta como as semânticas de Kripke usuais. O outro enriquecimento diz respeito à expressividade da lógica e se dá por meio da adição de novos conectivos, especialmente de negações modais. Neste sentido, estudamos inicialmente o fragmento da lógica clássica positiva estendido com uma negação modal paraconsistente e mostramos que essa linguagem é forte o suficiente para expressar as linguagens modais normais. Vemos que também é possível definir uma negação modal paracompleta e conectivos de restauração que internalizam as noções de consistência e determinação a nível da linguagem-objeto. Esta lógica constitui-se em uma Lógica da Inconsistência Formal e em uma Lógica da Indeterminação Formal. Em tais lógicas, com o objetivo de recuperar inferências clássicas perdidas, demonstram-se Teoremas de Ajuste de Derivabilidade. No caso da lógica estendida com uma negação paraconsistente, se removermos a implicação ainda lidaremos com uma linguagem bastante rica, com ambas negações paranormais e seus respectivos conectivos de restauração. Sobre esta linguagem estudamos a lógica modal normal minimal definida por meio de um cálculo de Gentzen apropriado, à diferença dos demais sistemas estudados até então, que são apresentados via cálculo de Hilbert. Em seguida após demonstrarmos a completude do sistema dedutivo associado a este cálculo, introduzimos algumas extensões desse sistema e buscamos Teoremas de Ajuste de Derivabilidade adequados.Almeida, João MarcosDodó, Adriano Alves2014-10-30T16:43:23Z2014-10-30T16:43:23Z2013info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisapplication/pdfDODÓ, A. A.http://www.repositorio.ufc.br/handle/riufc/9589engreponame:Repositório Institucional da Universidade Federal do Ceará (UFC)instname:Universidade Federal do Ceará (UFC)instacron:UFCinfo:eu-repo/semantics/openAccess2014-11-03T17:37:28Zoai:repositorio.ufc.br:riufc/9589Repositório InstitucionalPUBhttp://www.repositorio.ufc.br/ri-oai/requestbu@ufc.br || repositorio@ufc.bropendoar:2024-09-11T18:35:17.726358Repositório Institucional da Universidade Federal do Ceará (UFC) - Universidade Federal do Ceará (UFC)false |
dc.title.none.fl_str_mv |
On Rich Modal Logics |
title |
On Rich Modal Logics |
spellingShingle |
On Rich Modal Logics Dodó, Adriano Alves Lógica Modal Lógica Paranormal Lógica Difusa |
title_short |
On Rich Modal Logics |
title_full |
On Rich Modal Logics |
title_fullStr |
On Rich Modal Logics |
title_full_unstemmed |
On Rich Modal Logics |
title_sort |
On Rich Modal Logics |
author |
Dodó, Adriano Alves |
author_facet |
Dodó, Adriano Alves |
author_role |
author |
dc.contributor.none.fl_str_mv |
Almeida, João Marcos |
dc.contributor.author.fl_str_mv |
Dodó, Adriano Alves |
dc.subject.por.fl_str_mv |
Lógica Modal Lógica Paranormal Lógica Difusa |
topic |
Lógica Modal Lógica Paranormal Lógica Difusa |
description |
This thesis is about the enrichment of modal logics. We use the term enrichment in two distinct ways. In the first of them, it is a semantical enrichment. We propose a fuzzy semantics to di erent normal modal logics and we prove a completeness result for a generous class of this logics enriched with multiple instances of the axiom of confluence. A curious fact about this semantics is that it behaves just like the usual boolean-based Kripke semantics for modal logics. The other enrichment is about the expressibility of the logic and it occurs by means of the addition of new connectives, essentially modal negations. In this sense, firstly we study the positive fragment of classical logic extended with a paraconsistent modal negation and we show that this language is su ciently strong to express the normal modal logics. It is also possible to define a paracomplete modal negation and restoration connectives that internalize at the level object-language the notions of consistency and determinedness. This logic constitutes a Logic of Formal Inconsistency and a Logic of Formal Undeterminedness.In such logics, with the objective of recovering lost inferences of classical logic, Derivability Adjustment Theorems are proved. In the case of the logic with one paraconsistent negation, if we remove the implication we still have a rich language, with both paranormal negations and its respective connectives of restoration. In this logic we study the minimal normal modal logic defined by means of a Gentzen calculus, differently of the others modal systems studied, which are presented by means of Hilbert calculus. Next, after we prove a ompleteness result of the deductive system associated to this calculus, we present some extensions of this system and we look for appropriate Derivability Adjustment Theorems. |
publishDate |
2013 |
dc.date.none.fl_str_mv |
2013 2014-10-30T16:43:23Z 2014-10-30T16:43:23Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/masterThesis |
format |
masterThesis |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
DODÓ, A. A. http://www.repositorio.ufc.br/handle/riufc/9589 |
identifier_str_mv |
DODÓ, A. A. |
url |
http://www.repositorio.ufc.br/handle/riufc/9589 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da Universidade Federal do Ceará (UFC) instname:Universidade Federal do Ceará (UFC) instacron:UFC |
instname_str |
Universidade Federal do Ceará (UFC) |
instacron_str |
UFC |
institution |
UFC |
reponame_str |
Repositório Institucional da Universidade Federal do Ceará (UFC) |
collection |
Repositório Institucional da Universidade Federal do Ceará (UFC) |
repository.name.fl_str_mv |
Repositório Institucional da Universidade Federal do Ceará (UFC) - Universidade Federal do Ceará (UFC) |
repository.mail.fl_str_mv |
bu@ufc.br || repositorio@ufc.br |
_version_ |
1813028866618294272 |