On Languages and a Strictly Positive Fragment of Linear Temporal Logic

Treballs Finals del Màster de Lògica Pura i Aplicada, Facultat de Filosofia, Universitat de Barcelona. Curs: 2023-2024. Tutor: Joost Johannes Joosten

Detalles Bibliográficos
Autor: Acevedo, Lucas Uzías
Tipo de recurso: tesis de maestría
Fecha de publicación:2024
País:España
Institución:Universidad de Barcelona
Repositorio:Dipòsit Digital de la UB
OAI Identifier:oai:diposit.ub.edu:2445/215189
Acceso en línea:https://hdl.handle.net/2445/215189
Access Level:acceso abierto
Palabra clave:Lògica
Temps (Lògica)
Tractament del llenguatge natural (Informàtica)
Treballs de fi de màster
Logic
Tense (Logic)
Natural language processing (Computer science)
Master's thesis
id ES_6d79cd2fe85d8cc9a4aebcf7586d9925
oai_identifier_str oai:diposit.ub.edu:2445/215189
network_acronym_str ES
network_name_str España
repository_id_str
spelling On Languages and a Strictly Positive Fragment of Linear Temporal LogicAcevedo, Lucas UzíasLògicaTemps (Lògica)Tractament del llenguatge natural (Informàtica)Treballs de fi de màsterLogicTense (Logic)Natural language processing (Computer science)Master's thesisTreballs Finals del Màster de Lògica Pura i Aplicada, Facultat de Filosofia, Universitat de Barcelona. Curs: 2023-2024. Tutor: Joost Johannes JoostenThis thesis explores various characterizations of regular and star-free languages and in troduces a novel syntactic fragment of Linear Temporal Logic (LTL), called Strictly Pos itive Linear Temporal Logic (SPLTL), inspired by the Reflection Calculus. The opening chapter provides a comprehensive survey of regular languages, characterized by regular expressions, regular grammars, finite automata, and Monadic Second-Order logic over words. We conclude the exposition with a detailed proof of Büchi’s Theorem, which bridges automata and logic. The discussion then shifts to star-free languages, emphasiz ing their representation using LTL. An exhaustive proof of the Completeness Theorem for LTL is also provided. The principal contribution of this thesis is the definition and analysis of SPLTL, which aims to achieve improved complexity compared to LTL. We establish several foundational results for SPLTL and show its soundness concerning the standard semantic framework of LTL. However, proving the completeness of SPLTL presents difficulties, primarily due to the absence of the disjunction operator in the SPLTL formalization. Despite these challenges, we think that this thesis introduces valuable insights and results that lay the groundwork for future research. It paves the way for a more in-depth investigation into the completeness of SPLTL and its potential applications.Joosten, Joost J.2024info:eu-repo/semantics/masterThesisapplication/pdfhttps://hdl.handle.net/2445/215189Màster Oficial - Pure and Applied Logic / Lògica Pura i aplicadareponame:Dipòsit Digital de la UBinstname:Universidad de BarcelonaIngléscc by-nc-nd (c) Acevedo, 2024http://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccessoai:diposit.ub.edu:2445/2151892026-05-27T06:46:51Z
dc.title.none.fl_str_mv On Languages and a Strictly Positive Fragment of Linear Temporal Logic
title On Languages and a Strictly Positive Fragment of Linear Temporal Logic
spellingShingle On Languages and a Strictly Positive Fragment of Linear Temporal Logic
Acevedo, Lucas Uzías
Lògica
Temps (Lògica)
Tractament del llenguatge natural (Informàtica)
Treballs de fi de màster
Logic
Tense (Logic)
Natural language processing (Computer science)
Master's thesis
title_short On Languages and a Strictly Positive Fragment of Linear Temporal Logic
title_full On Languages and a Strictly Positive Fragment of Linear Temporal Logic
title_fullStr On Languages and a Strictly Positive Fragment of Linear Temporal Logic
title_full_unstemmed On Languages and a Strictly Positive Fragment of Linear Temporal Logic
title_sort On Languages and a Strictly Positive Fragment of Linear Temporal Logic
dc.creator.none.fl_str_mv Acevedo, Lucas Uzías
author Acevedo, Lucas Uzías
author_facet Acevedo, Lucas Uzías
author_role author
dc.contributor.none.fl_str_mv Joosten, Joost J.
dc.subject.none.fl_str_mv Lògica
Temps (Lògica)
Tractament del llenguatge natural (Informàtica)
Treballs de fi de màster
Logic
Tense (Logic)
Natural language processing (Computer science)
Master's thesis
topic Lògica
Temps (Lògica)
Tractament del llenguatge natural (Informàtica)
Treballs de fi de màster
Logic
Tense (Logic)
Natural language processing (Computer science)
Master's thesis
description Treballs Finals del Màster de Lògica Pura i Aplicada, Facultat de Filosofia, Universitat de Barcelona. Curs: 2023-2024. Tutor: Joost Johannes Joosten
publishDate 2024
dc.date.none.fl_str_mv 2024
dc.type.none.fl_str_mv info:eu-repo/semantics/masterThesis
format masterThesis
dc.identifier.none.fl_str_mv https://hdl.handle.net/2445/215189
url https://hdl.handle.net/2445/215189
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.rights.none.fl_str_mv cc by-nc-nd (c) Acevedo, 2024
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv cc by-nc-nd (c) Acevedo, 2024
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv Màster Oficial - Pure and Applied Logic / Lògica Pura i aplicada
reponame:Dipòsit Digital de la UB
instname:Universidad de Barcelona
instname_str Universidad de Barcelona
reponame_str Dipòsit Digital de la UB
collection Dipòsit Digital de la UB
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869410355156877312
score 15,811543

Similares en LA Referencia