Dissertations / Theses on the topic 'Modal'

This thesis is concerned with the epistemology of absolute alethic necessity. The thesis begins with a characterisation of absolute alethic necessity and its distinctive epistemology. The challenge of explaining the reliability of belief in necessity is identified as the primary goal of the thesis and four broad forms of response to that challenge are identified. Of the four strategies, two are dismissed as prima facie inapplicable to the case of necessity. The two remaining options are identified as Modal Anti-Realism and Non-Standard Realism. In chapter 2, it is suggested that the field can be narrowed further, in light of Anna Sherratt's (2010) Transparency Objection to Modal Anti-Realism. From chapter 3 onwards, the thesis aims to close in on a suitable variety of Non-Standard Realism by drawing upon a number of further, foundational, issues concerning modal thought. It is suggested that a type of normativity concerning content stability (or loss of content) offers the prospects of progress on these foundational questions. It is suggested that notions of normativity of this type are found in, both, the work of Christopher Peacocke (1999) and John Divers and Jose Edgar Gonzalez-Varela (2012). It is suggested that by combining elements of these two works we can make progress on the foundational questions. However, in order to develop the account into a response to the Reliability Challenge, the central remaining task is to articulate the nature and epistemology of the notion of content stability. In chapter 7, a specific notion of content stability is identified as 'proper deployment'. It is also suggested that in order to meet the Reliability Challenge, we require a notion of proper deployment that maintains a minimal degree of objectivity. In particular, there must be facts concerning the proper deployment of content. Chapter 7 also indicates the significant sceptical attack that threatens the required factuality of judgements of this type. It is suggested that the objectivity of proper deployment required for a response to the Reliability Challenge can be maintained on a non-reductive account of proper deployment. It is highlighted, however, that the non-reductive account still faces the task of explaining the epistemology of proper deployment. It is at this point, I suggest, that anti-realism has significant explanatory work to do in the epistemology of modality, but that such work directly concerns the nature and objectivity of content, not modality, itself. In chapters 8 and 9, a constitutive account of proper deployment is proposed and integrated with the responses to the foundational questions concerning modal thought and knowledge.

Model generation and minimal model generation are useful for tasks such as model checking, query answering and for debugging of logical specifications. Due to this variety of applications, several minimality criteria and model generation methods for classical logics have been studied. Minimal model generation for modal logics how ever did not receive the same attention from the research community. This thesis aims to fill this gap by investigating minimality criteria and designing minimal model generation procedures for all the sublogics of the multi-modal logic S5(m) and their extensions with universal modalities. All the procedures are minimal model sound and complete, in the sense that they generate all and only minimal models. The starting point of the investigation is the definition of a Herbrand semantics for modal logics on which a syntactic minimality criterion is devised. The syntactic nature of the minimality criterion allows for an efficient minimal model generation procedure, but, on the other hand, the resulting minimal models can be redundant or semantically non minimal with respect to each other. To overcome the syntactic limitations of the first minimality criterion, the thesis moves from minimal modal Herbrand models to semantic minimality criteria based on subset-simulation. At first, theoretical procedures for the generation of models minimal modulo subset-simulation are presented. These procedures for the generation of models minimal modulo subset-simulation are minimal model sound and complete, but they might not terminate. The minimality criterion and the procedures are then refined in such a way that termination can be ensured while preserving minimal model soundness and completeness.

Le concept de confiance est un concept sociocognitif qui adresse la question de l'interaction dans les systèmes concurrents. Quand la complexité d'un système informatique prohibe l'utilisation de solutions traditionnelles de sécurité informatique en amont du processus de développement (solutions dites de type dur), la confiance est un concept candidat, pour le développement de systèmes d'aide à l'interaction. Dans cette thèse, notre but majeur est de présenter une vue d'ensemble de la discipline de la modélisation de la confiance dans les systèmes informatiques, et de proposer quelques modèles logiques pour le développement de module de confiance. Nous adoptons comme contexte applicatif majeur, les applications basées sur les architectures orientées services, qui sont utilisées pour modéliser des systèmes ouverts telle que les applications web. Nous utiliserons pour cela une abstraction qui modélisera ce genre de systèmes comme des systèmes multi-agents. Notre travail est divisé en trois parties, la première propose une étude de la discipline, nous y présentons les pratiques utilisées par les chercheurs et les praticiens de la confiance pour modéliser et utiliser ce concept dans différents systèmes, cette analyse nous permet de définir un certain nombre de points critiques, que la discipline doit aborder pour se développer. La deuxième partie de notre travail présente notre premier modèle de confiance. Cette première solution basée sur un formalisme logique (logique dynamique épistémique), démarre d'une interprétation de la confiance comme une croyance sociocognitive, ce modèle présentera une première modélisation de la confiance. Apres avoir prouvé la décidabilité de notre formalisme. Nous proposons une méthodologie pour inférer la confiance en des actions complexes : à partir de notre confiance dans des actions atomiques, nous illustrons ensuite comment notre solution peut être mise en pratique dans un cas d'utilisation basée sur la combinaison de service dans les architectures orientées services. La dernière partie de notre travail consiste en un modèle de confiance, où cette notion sera perçue comme une spécialisation du raisonnement causal tel qu'implémenté dans le formalisme des règles de production. Après avoir adapté ce formalisme au cas épistémique, nous décrivons trois modèles basés sur l'idée d'associer la confiance au raisonnement non monotone. Ces trois modèles permettent respectivement d'étudier comment la confiance est générée, comment elle-même génère les croyances d'un agent et finalement, sa relation avec son contexte d'utilisation
The concept of trust is a socio-cognitive concept that plays an important role in representing interactions within concurrent systems. When the complexity of a computational system and its unpredictability makes standard security solutions (commonly called hard security solutions) inapplicable, computational trust is one of the most useful concepts to design protocols of interaction. In this work, our main objective is to present a prospective survey of the field of study of computational trust. We will also present two trust models, based on logical formalisms, and show how they can be studied and used. While trying to stay general in our study, we use service-oriented architecture paradigm as a context of study when examples are needed. Our work is subdivided into three chapters. The first chapter presents a general view of the computational trust studies. Our approach is to present trust studies in three main steps. Introducing trust theories as first attempts to grasp notions linked to the concept of trust, fields of application, that explicit the uses that are traditionally associated to computational trust, and finally trust models, as an instantiation of a trust theory, w.r.t. some formal framework. Our survey ends with a set of issues that we deem important to deal with in priority in order to help the advancement of the field. The next two chapters present two models of trust. Our first model is an instantiation of Castelfranchi & Falcone's socio-cognitive trust theory. Our model is implemented using a Dynamic Epistemic Logic that we propose. The main originality of our solution is the fact that our trust definition extends the original model to complex action (programs, composed services, etc.) and the use of authored assignment as a special kind of atomic actions. The use of our model is then illustrated in a case study related to service-oriented architecture. Our second model extends our socio-cognitive definition to an abductive framework that allows us to associate trust to explanations. Our framework is an adaptation of Bochman's production relations to the epistemic case. Since Bochman approach was initially proposed to study causality, our definition of trust in this second model presents trust as a special case of causal reasoning, applied to a social context. We end our manuscript with a conclusion that presents how we would like to extend our work

In Prior Analytics 1.1–22, Aristotle develops his proof system of non-modal and modal propositions. This system is given in the language of propositions, and Aristotle is concerned with establishing some properties and relations that the expressions of this language enjoy. However, modern scholarship has found some of his results inconsistent with positions defended elsewhere. The set of rules of inference of this system has also caused perplexity: there does not seem to be a single interpretation that validates all the rules which Aristotle is explicitly committed to using in his proofs. Some commentators have argued that these and other problems cannot be successfully addressed from the viewpoint of the traditional, ‘first-order’ interpretation of Aristotle’s syllogistic, whereby propositions are taken to involve quantification over individuals only. Accordingly, this interpretation not only is inadequate for formal analysis, but also stems from a misunderstanding of Aristotle’s ideas about quantification. On the contrary, in this study I purport to vindicate the adequacy and plausibility of the first-order interpretation. Together with some assumptions about the language of propositions and an appropriate regimentation, the first-order interpretation yields promising solutions to many of the problems raised by the modal syllogistic. Thus, I present a reconstruction of the language of propositions and a formal interpretation thereof which will prove respectful and responsive to most of the views endorsed by Aristotle in the ‘modal’ chapters of the Analytics.

L'objet de cette thèse est de proposer une position originale dans le débat sur le réalisme scientifique, l'empirisme modal, et d'en démontrer la fructuosité quand il s'agit de tirer des enseignements du contenu cognitif des théories scientifiques. L'empirisme modal est une position empiriste, suivant laquelle le but de la science n'est pas de produire des théories vraies, mais des théories empiriquement adéquate. Cependant, il propose d'adopter un cadre plus large que les versions traditionnelles d'empirisme pour penser l'expérience, en incorporant un engagement envers les modalités naturelles, ou l'idée qu'il y a du possible dans la nature, et des contraintes sur les possibles. Nos théories sont empiriquement adéquates si elles délimitent correctement l'étendue des expériences possibles. Cette position s'appuie sur une conception située et pragmatique des modalités naturelles et de la confrontation empirique. Nous prétendons qu'elle est à même de rendre justice au succès empirique des sciences, sans pour autant faire face au problème du changement théorique qui mine le réalisme scientifique. Nous expliquons comment les contraintes de nécessité sur les phénomènes peuvent être connues à l'issue d'une induction, et en quoi cette façon de voir s'accorde avec la pratique scientifique. Enfin, nous affirmons qu'un engagement envers les modalités naturelles offre une richesse interprétative à même de renouveler, dans un cadre pragmatiste, plus ouvert que le réalisme, certaines questions métaphysiques tout en les ramenant à l'expérience
The aim of this thesis dissertation is to propose a novel position in the debate on scientific realism, modal empiricism, and to show its fruitfulness when it comes to interpreting the cognitive content of scientific theories. Modal empiricism is an empiricist position, according to which the aim of science is to produce empirically adequate theories rather than true theories. However, it suggests adopting a broader comprehension of experience than traditional versions of empiricism, through a commitment to natural modalities. Following modal empiricism, there are possibilities in nature, and constraints on what is possible, and a theory is empirically adequate if it correctly delimits the range of possible experiences. The position rests on a situated and pragmatic conception of natural modalities and of empirical confrontation. We claim that it can do justice to the empirical success of science, while not falling prey to the problem of theory change that undermines scientific realism. We explain how constraints of necessity on phenomena can be known by induction, and how this modal epistemology fits with scientific practice. Finally, we claim that a commitment to natural modalities allows for a rich interpretation of the cognitive content of theories. Modal empiricism could renew some metaphysical debates within a pragmatist framework, by tying them to experience and not being constrained by realist prejudices

Heavy-duty diesel vehicle (HDDV) operations are a major source of pollutant emissions in major metropolitan areas. Accurate estimation of heavy-duty diesel vehicle emissions is essential in air quality planning efforts because highway and non-road heavy-duty diesel emissions account for a significant fraction of the oxides of nitrogen (NOx) and particulate matter (PM) emissions inventories. Yet, major modeling deficiencies in the current MOBILE6 modeling approach for heavy-duty diesel vehicles have been widely recognized for more than ten years. While the most recent MOBILE6.2 model integrates marginal improvements to various internal conversion and correction factors, fundamental flaws inherent in the modeling approach still remain. The major effort of this research is to develop a new heavy-duty vehicle load-based modal emission rate model that overcomes some of the limitations of existing models and emission rates prediction methods. This model is part of the proposed Heavy-Duty Diesel Vehicle Modal Emission Modeling (HDDV-MEM) which was developed by Georgia Institute of Technology. HDDV-MEM first predicts second-by-second engine power demand as a function of vehicle operating conditions and then applies brake-specific emission rates to these activity predictions. To provide better estimates of microscopic level, this modeling approach is designed to predict second-by-second emissions from onroad vehicle operations. This research statistically analyzes the database provided by EPA and yields a model for prediction emissions at microscopic level based on engine power demand and driving mode. Research results will enhance the explaining ability of engine power demand on emissions and the importance of simulating engine power in real world applications. The modeling approach provides a significant improvement in HDDV emissions modeling compared to the current average speed cycle-based emissions models.

Thesis (MScEng (Mechanical and Mechatronic Engineering))--University of Stellenbosch, 2010.
ENGLISH ABSTRACT: Numerical design optimisation is a powerful tool that can be used by engi- neers during any stage of the design process. Structural design optimisation is a specialised usage of numerical design optimisation that has been adapted to cater speci cally for structural design problems. A speci c application of structural design optimisation that will be discussed in the following report is experimental data matching. Data obtained from tests on a physical structure will be matched with data from a numerical model of that same structure. The data of interest will be the dynamic characteristics of an antenna structure, focusing on the mode shapes and modal frequencies. The structure used was a scaled, simpli ed model of the Karoo Array Telescope-7 (KAT-7) antenna structure. Experimental data matching is traditionally a di cult and time-consuming task. This report illustrates how optimisation can assist an engineer in the process of correlating a nite element model with vibration test data.
AFRIKAANSE OPSOMMING: Numeriese ontwerp-optimisering is 'n kragtige ingenieurshulpmiddel wat ty- dens enige stadium in die ontwerpsproses ingespan kan word. Strukturele ontwerp-optimisering is 'n gespesialiseerde gebruik van numeriese ontwerp- optimisering wat aangepas is om spesi ek van diens te wees by die oplos van strukturele ontwerpsprobleme. 'n Spesi eke toepassing van strukturele ontwerp-optimisering wat in hierdie verslag bespreek sal word, is eksperi- mentele datakorrelasie. Data afkomstig van toetse op 'n siese struktuur sal gekorreleer word met data afkomstig van 'n numeriese model van die selfde struktuur. Die data van belang is die dinamiese eienskappe van 'n anten- nastruktuur, spesi ek die modusvorme en modale frekwensies. Die betrokke struktuur wat gebruik is, is 'n vereenvoudigde skaalmodel van die Karoo Array Telescope-7 (KAT-7) antennastruktuur. Eksperimentele datakorrelasie is, tradisioneel gesproke, 'n moeilike en tydro- wende taak. Hierdie verslag sal illustreer op watter wyse optimisering 'n inge- nieur van hulp kan wees in die proses om 'n eindige elementmodel met vibrasietoetsdata te korreleer.

Modal Transition Systems (MTS) are an extension of Labelled Transition Systems (LTS) that have been shown to be useful to reason about system behaviour in the context of partial information. MTSs distinguish between required, proscribed and unknown behaviour and come equipped with a notion of refinement that supports incremental modelling where unknown behaviour is iteratively elaborated into required or proscribed behaviour. A particularly useful notion in the context of software and requirements engineering is that of “merge”. Merging two consistent models is a process that should result in a minimal common refinement of both models where consistency is defined as the existence of one common refinement. One of the current limitations of MTS merging is that a complete and correct algorithm for merging has not been developed. Hence, an engineer attempting to merge partial descriptions may be prevented to do so by overconstrained algorithms or algorithms that introduce behaviour that does not follow from the partial descriptions being merged. In this thesis we study the problems of consistency and merge for the existing MTSs semantics - strong and weak semantics - and provide a complete characterization of MTS consistency as well as a complete and correct algorithm for MTS merging using these semantics. Strong and weak semantics require MTS models to have the same communicating alphabet, the latter allowing the use of a distinguished unobservable action. In this work we show that the requirement of fixing the alphabet for MTS semantics and the treatment of observable actions are limiting if MTSs are to support incremental elaboration of partial behaviour models. We present a novel observational semantics for MTS, branching alphabet semantics, inspired by branching LTS equivalence, which supports the elaboration of model behaviour including the extension of the alphabet of the system to describe behaviour aspects that previously had not been taken into account. Furthermore, we show that some unintuitive refinements allowed by weak semantics are avoided, and prove a number of theorems that relate branching refinement with alphabet refinement and consistency. These theorems, which do not hold for other semantics, support the argument for considering branching alphabet as a sound semantics to support behaviour model elaboration.

ModaI logic is concerned with the logic of necessity and possibility. The central problem of modal ontology is summed up in the following question, "What are the ontological commitments of the user of modal terminology? " This thesis is primarily about the ontological commitments that Aristotle made when he employed modal terms. Aristotle’s modal ontology is h e r e analysed in conjunction with four modal problems. My primary objective, is to clarify some of the discussions of Aristotle's modal ontology that have been advanced by certain twentieth century philosophers. The first problem to be considered is the famous ' sea battle’ argument of De Interpretatione 9 . Here is a summary of the problem: If it is currently true that there will be a sea battle tomorrow, then in some sense it is inevitable that there will in fact be a sea battle; if predictions are true, is not a form of determinism being supported? One analysis in particular is studied at length, namely that of Jaakko Hintikka. Hintikka holds that the sea battle argument is best Interpreted if the metaphysical principle of plenitude is attributed to Aristotle. The principle of plenitude effectively merges modality with temporality; what is necessarily the case is always true, and vice versa. Hintikka also interprets Aristotle's stand on the ‘Master Argument’ of Diodorus in light of the attribution of the principle of plenitude to Aristotle. Diodorus' argument is the second of the four problems that this essay considers,. Unlike Aristotle, Diodorus appears to have favored a strong version of determinism. According to Hintikka, Diodorus actually strove to prove the principle of plenitude (as opposed to assuming it, as Aristotle presumably did). I am very sceptical regarding Hintikka's interpretations of these two problems. The sea battle argument is not adequately answered by the solution which Hintikka sees Aristotle adopting. Alternative answers are relatively easy to come by. The evidence cited by Hintikka for ascribing the principle of plenitude is, it is shown, somewhat inconclusive. As for the Master Argument, there is a great deal of paucity in regards to textual evidence. Hinikka himself virtually concedes this point. (Thus, whereas I feel it to be incumbent to offer an alternative interpretation of the sea battle argument, I do not share this attitude towards the Master Argument.) The third and fourth problems play a key role in twentieth century analytic philosophy. Both were first formulated by W.V. Quine in the forties. These problems are somewhat subtle and will not be explained further. Suffice it to say that an analysis of Aristotle's works by Alan Code reveals that the Stagirite had an answer to Quine's criticisms of modal logic.
Arts, Faculty of
Philosophy, Department of
Graduate

Mestrado em Matemática e Aplicações
O presente trabalho oferece uma alternativa para a semântica de Kripke dando ênfase ao valor de uma fórmula em lugar da original definição da semântica de Kripke. Desta forma o raciocínio desenvolve-se principalmente em torno de conceitos da teoria elementar de conjuntos, ao invés da lógica de 1ª ordem, o que nos parece ser uma abordagem mais natural e compacta do tema. São examinados os tópicos verdade e validade num modelo e numa estrutura, equivalência entre fórmulas de 1ª ordem e fórmulas proposicionais modais, aplicações da teoria de prova e lógicas normais, incluindo o modelo canónico para lógicas normais.
In this work we present some topics of modal logic, offering an alternative to the usual first order stile presentation of Kripke’s semantics, by means of the concept of value of a formula. In this way the reasoning takes place mainly in the context of elementary set theory, instead of straight first order logic. This appears to be a more natural and compact approach to the subject. The topics dealt with here are truth and validity in a model and in a frame, equivalence between some first order properties of binary relations and modal schemata, proof theory, and normal logics, including canonical models for normal logics.

Depuis l'antiquité jusqu'à aujourd'hui, le domaine de la logique a gagné une importance remarquable et contribue désormais à de nombreuses autres branches, telles que la philosophie, les mathématiques, la fabrication de matériel informatique, la linguistique, l'informatique, l'intelligence artificielle, etc. À chacun de ces scénarios correspondent des besoins spécifiques, qui vont d'exigences très concrètes, telles qu'une méthode d'inférence efficace, à des propriétés théoriques plus abstraites, telles qu'un système d'axiomes élégant. Étant donnée cette grande diversité d'utilisations, une palette hétéroclite de langages formels a été développée. Pendant de nombreuses années, les langages classiques (notamment la logique du premier ordre) étaient la seule alternative concevable, mais cet assortiment d'applications a rendu d'autres types de logiques également désirables dans de nombreuses situations. Imaginez que l'heure de choisir une logique pour une tâche spécifique arrive. Comment choisir la plus appropriée? Quelles propriétés devrions-nous rechercher? Comment "mesurer'' une logique par rapport aux autres? Ce sont des questions difficiles, et il n'existe pas de recette générale à suivre. Dans cette thèse, nous allons simplement restreindre ces questions à une famille particulière de logiques, et dans ce contexte, nous explorerons les aspects théoriques qui aideront à répondre à ces préoccupations. Beaucoup peut être découvert par une analyse attentive des cas les plus intéressants, et notre contribution sera développée selon cette philosophie. Les logiques modales propositionnelles offrent une alternative aux langages traditionnels. Elles peuvent être considérées comme un ensemble d'outils permettant de concevoir des logiques adaptées à des tâches précises, possédant un contrôle fin sur leur expressivité. De plus, il s'est avéré que les logiques modales possèdent un bon comportement computationnel, qui se trouve être robuste y compris malgré l'ajout d'extensions. Ces caractéristiques, parmi d'autres, ont élevé les logiques modales au rang d'alternatives désirables aux langages classiques. Dans ce thèse, nous allons présenter une nouvelle famille de logiques modales appelée logiques mémorielles. Les logiques modales traditionnelles permettent de décrire les structures relationnelles d'un point de vue local. Mais pourquoi ne pas changer cette structure? Nous voulons étudier l'ajout d'une structure de stockage explicite aux logiques modales, une mémoire, qui permet de modéliser un comportement dynamique à travers des opérateurs mémoriels explicites. Ces opérateurs sauvent ou restaurent de l'information vers et à partir de la mémoire. Naturellement, selon le type de structure de sauvegarde désiré et les opérateurs mémoriels disponibles, la logique résultante possèdera différentes propriétés qui valent la peine d'être étudiées. Cette thèse est organisée de la façon suivante. Dans le Chapitre 1, nous commençons par rappeler brièvement comment la logique modale est née, en montrant les différents points de vue historiques la concernant. Puis, nous présentons formellement la logique modale de base et un ensemble d'opérateurs étendus qui aident à capturer le ``goût'' modal de langages plus riches. Nous finissons ce chapitre en donnant un premier aperçu des logiques mémorielles, et montrons comment elles peuvent aider à modéliser l'état quand nous choisissons d'utiliser un ensemble comme une structure de sauvegarde. Le Chapitre 2 est dédié à la présentation détaillée des logiques mémorielles. Nous montrons quelques exemples qui peuvent être décrits en ajoutant un ensemble à des structures relationnelles usuelles, ainsi que les opérateurs ensemblistes usuels permettant l'ajout d'élément et le test d'appartenance. Puis, nous montrons que d'autres opérateurs mémoriels peuvent être envisagés, et nous discutons de la possibilité d'ajouter des contraintes à l'interaction entre la mémoire et les opérateurs modaux. Ces contraintes peuvent être vues comme une manière d'avoir un contrôle fin sur l'expressivité de la logique. Comme nous avons fait des changements aux logiques modales classiques, nous nous intéressons à l'analyse de l'impact de ces changements sur les logiques résultantes. Ainsi, le reste de ce chapitre présente une boite à outils logique basique avec laquelle nous pouvons analyser cette nouvelle famille de logiques. Cette boite à outils peut être vue comme un plan qui organise le reste de cette thèse et qui permet d'analyser les logiques mémorielles en termes d'expressivité, de complexité, d'interpolation et de théorie de la preuve. Le reste des chapitres consiste à étudier en détail chacun de ces aspects. Dans les Chapitres 3 et 4, nous explorons l'expressivité de plusieurs logiques mémorielles et nous étudions la décidabilité de leur problème de satisfiabilité. Dans les cas décidables, nous déterminons leur complexité. Nous analysons l'impact des différents opérateurs mémoriels considérés, et leur interaction. Nous étudions également d'autres conteneurs mémoriels, tels que la pile. Puis, dans le Chapitre 4, nous analysons l'interpolation de Craig et la définabilité de Beth pour certains fragments des logiques mémorielles. Nous étudions également les logiques mémorielles du point de vue de la théorie de la preuve. Dans les Chapitres 6 et 7, nous passons aux axiomatisations à la Hilbert et aux systèmes de tableaux, et nous caractérisons plusieurs fragments de la famille des logiques mémorielles, en utilisant principalement des techniques empruntées aux logiques hybrides. Nous concluons dans le Chapitre 8 avec quelques remarques, des problèmes ouverts et des directions pour de futures recherches
From ancient times to the present day, the field of logic has gained significant strength and now it actively contributes to many different areas, such as philos- ophy, mathematics, linguistic, computer science, artificial intelligence, hardware manufacture, etc. Each of these scenarios has specific needs, that range from very concrete requirements, like an efficient inference method, to more abstract theoretical properties, like a neat axiomatic system. Given this wide diversity of uses, a motley collection of formal languages has been developed. For many years, classical languages (mainly classical first order logic) were the alternative, but this assortment of applications made other types of logics also attractive in many situations. Imagine that the time for choosing a logic for some specific task arrives. How can we decide which is the one that fits best? Which properties should we look for? How can we “measure” a logic with respect to others? These are not easy questions, and there is not a general recipe one can follow. In this thesis we are just going to restrict these questions to a particular family of logics, and in that context we will investigate theoretical aspects that help to answer some of these concerns. Much can be discovered by carefully analyzing appealing cases, and our contribution will be developed having that philosophy in mind. Propositional modal logics offer an alternative to traditional languages. They can be regarded as a set of tools that allow to design logics specially tailored for specific tasks, having a fine-grained control on their expressivity. Additionally, modal logics turned out to have a good computational behavior, which proved to be quite robust under extensions. These characteristics, among others, placed modal logics as an attractive alternative to classical languages. In this dissertation we are going to present a new family of modal logics called memory logics. Traditional modal logics enables to describe relational structures from a local perspective. But what about changing the structure? We want to explore the addition of an explicit storage structure to modal logics, a mem- ory, that allows to model dynamic behavior through explicit memory operators. These operators store or retrieve information to and from the memory. Natu- rally, depending on which type of storage structure we want, and which memory operators are available, the resulting logic will enjoy different properties that are worth investigating. The thesis is organized as follows. In Chapter 1 we start by giving a brief recap of how modal logic was born, showing the different historical perspectives used to look at modal logic. Then we formally present the basic modal logic and a set of extended operators that helps grasp the modal “flavor” of some richer languages. We finish this chapter by giving a first glance of memory logics, and showing how they can help to model state when we choose to use a set as storage structure. Chapter 2 is devoted to present memory logics in detail. We show some examples that can be described by adding a set to standard relational structures, and the usual set operators to add elements and test membership. We then show some other memory operators that can be considered, and we discuss the possibility of adding constraints to the interplay between memory and modal operators. These constraints can be regarded as a way to have a finer-grained control on the logic expressivity. Since we have made changes to classical modal logics, we are interested in analyzing the impact those changes cause in the resulting logics. Therefore, the rest of this chapter presents a basic logic toolkit through which we can analyze this new family of logics. This toolkit can be seen as an outline that organizes the rest of the thesis and that allows to analyze memory logics in terms of expressivity, complexity, interpolation and proof theory. The rest of the chapters investigate each of these aspects in detail. In Chap- ters 3 and 4 we explore the expressive power of several memory logics and we study the decidability of their satisfiability problem. In the decidable cases, we determine their computational complexity. We analyze the impact of the differ- ent memory operators we consider, and how they interact. We also study other memory containers, such as a stack. Then, in Chapter 5, we analyze Craig inter- polation and Beth definability for some memory logic fragments. We also study memory logics from a proof theoretical perspective. In Chapter 6 and 7 we turn to Hilbert style axiomatizations and tableau systems, and we characterize several fragments of the memory logic family mostly using techniques borrowed from hy- brid logics. We close in Chapter 8 with some concluding remarks, open problems and directions for further research

Diese Arbeit geht der Frage nach, ob MPn im Schwedischen syntaktisch Satzadverbien sind. Es wird gezeigt, dass sie sich syntaktisch von Satzadverbien unterscheiden und sich ferner in zwei getrennte Typen von MPn unterteilen lassen. Hierzu wird eine syntaktische Analyse vorgestellt, die diese Unterscheidung in dem phrasalen Status der MPn widerspiegelt. Die syntaktische Analyse wird durch sechs Experimente empirisch bestätigen. Ferner wird gezeigt, dass, um die Linearisierung von Elementen im Mittelfeld, am Beispiel von MPn, DPn und Objektpronomen im Mittelfeld, erklären zu können, nicht nur syntaktische Argumente herangeführt werden können, sondern auch phonologische Aspekte berücksichtigt werden müssen.
This thesis answers the question whether the MPs in Swedish are different from sentence adverbs on the level of syntax. It shows that MPs do differ from sentence adverbs, and further, that the MPs must be divided into two types. I present a syntactic analysis of the MPs that accounts for the two types of MPs as elements of distinct phrasal statuses. The syntactic analysis is tested empirically in six experiments and the results verified the analysis. Further I show that in order to account for the linearisation of MPs and object pronouns in the middle field, not only syntactic but also phonological properties of all elements must be taken into consideration.

CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
Com base nas equações de Donnell para cascas abatidas, estudam-se as vibrações não-lineares e a instabilidade dinâmica de cascas cilíndricas carregadas axialmente, considerando o efeito simultâneo de cargas estáticas e harmônicas. Para isto, o problema é primeiro reduzido a um sistema finito de graus de liberdade usando o método de Galerkin. O sistema de equações diferenciais de movimento não-lineares é resolvido através do método de Runge-Kutta. Na análise do fenômeno de acoplamento modal foi usado um modelo com dois graus de liberdade, que reflete de maneira consistente o comportamento pós-crítico inicial da casca. Os resultados obtidos com esse modelo simplificado foram comparados com diversas modelagens encontradas na literatura, permitindo assim aferir o modelo utilizado. Para o estudo da interação modal, escolheram-se três modelos distintos com freqüências e cargas críticas próximas ou semelhantes. Para estudar o comportamento não- linear da casca, diversas estratégias numéricas foram usadas para se obter os mapas de Poincaré, expoentes de Lyapunov, pontos fixos estáveis e instáveis, diagramas de bifurcação e bacias de atração. Particular atenção foi dada a dois fenômenos de instabilidade dinâmica que podem ocorrer sob estas condições de carregamento, a saber: excitação paramétrica dos modos de flexão e escape da bacia de atração pré-flambagem. Os cálculos foram realizados nas regiões principal e secundária de instabilidade paramétrica associadas com a menor freqüência natural da casca. Mostra-se de forma detalhada a determinação dos limites de instabilidade no espaço de controle e a identificação dos mecanismos de escape relacionados com estes limites. Os resultados mostram a importância do acoplamento e da interação modal na solução pós-crítica e no comportamento dinâmico não-linear de cascas cilíndricas.
Based on Donnell shallow shell equations, the nonlinear vibrations and dynamic instability of axially loaded circular cylindrical shells under both static and harmonic forces are analyzed. For this, the problem is first reduced to that of a finite degree-of-freedom system by the Galerkin method. The resulting set of coupled non-linear ordinary differential equations of motion is, in turn, solved by the Runge-Kutta method. For the study of modal coupling, a 2 DOF model was used that describes consistently the initial post-buckling behavior of the shell. This model was compared favorably with others found in literature. For the analysis of modal interaction three different models were used considering shells with close or equal frequencies and critical loads. To study the non-linear behavior of the shell several numerical strategies were used to obtain Poincaré maps, Lyapunov exponents, stable and unstable fixed points, bifurcation diagrams and basins of attraction. Particular attention is paid to two dynamic instability phenomena that may arise under these loading conditions:parametric excitation of flexural modes and escape from the pre-buckling potential well.Calculations are carried out for the principal and secondary instability regions associated with the lowest natural frequency of the shell. Special attention is given to the determination of the instability boundaries in control space and the identification of the bifurcational events connected with these boundaries. The results also clarify the importance of modal coupling and modal interaction to the post-buckling solution and non-linear dynamic behavior of cylindrical shells.

This thesis addresses the problem of identifying the modal properties of a system based only on measurements of the system responses. This situation is frequently encountered in structural dynamics and is particularly relevant for systems where the in-service excitation is not artificially reproducible. The inherent non-linearities in these systems mean that the modal properties estimated using traditional input/output techniques will be different to those exhibited in operation. A common example from the literature is an aircraft in flight where the modal properties are heavily influenced by the operating point, i.e. the combination of load, speed, altitude etc., at which the aircraft is travelling. The process of identifying the modal properties of systems in-service is called Operational Modal Analysis (OMA). Not knowing the input complicates the analysis. Most of the techniques in the literature overcome the lack of knowledge about the unmeasured excitations by assuming they are both spatially and frequentially white, i.e. of equal magnitude and with a flat autospectrum. This thesis presents a new technique for OMA which relaxes these constraints, requiring only that the system is excited by a so called cyclostationary input with a unique cyclic frequency, and that the log spectrum of the second order component of this input is frequentially smooth, as will be explained. Such systems include vehicles with internal combustion engines as the vibration from such an engine exhibits cyclostationary statistics. In this thesis, the technique is applied to a laboratory test rig and a passenger train both using an artificial input, and to a race car using the engine as the excitation. By combining cyclostationary signal processing and the concept of the cepstrum, the technique identifies the resonances and anti-resonances in the transfer functions between each response and the cyclostationary source. These resonances and antiresonances can be used to regenerate Frequency Response Functions (FRFs) and it is shown how the unknown scaling of the system can be recovered by employing finite element model updating in conjunction with this regeneration. In addition, the contribution made to model updating by the anti-resonances is also investigated. Finally, the potential of OMA to inform a model updating process is demonstrated using an experimental case study on a diesel railcar.

O presente trabalho tem como objetivo proporcionar aos estudantes que precisem da lógica modal como ferramenta um texto conciso mas suficientemente completo. Embora seja um texto de cunho matemático, procura-se manter o equilíbrio entre os conceitos matemáticos e suas motivações filosóficas, pela crença de que tal equilíbrio é essencial para situar o pensamento em um texto introdutório. O primeiro capítulo começa com um breve histórico filosófico e trabalha os conceitos fundamentais de um ponto de vista sintático. O segundo capítulo retoma os conceitos do primeiro capítulo de um ponto de vista semântico e faz a conexão entre sintaxe e semântica. O terceiro capítulo trabalha o conceito de bissimulação e apresenta ferrametas que abrirão caminho para aplicações.
The goal of this work is to provide the studens who need to deal with modal logic as a tool with a text which might be concise but complete enough at the same time. Although this is a rather mathematical text, an effort is made in order to maintain the equilibrium between mathematical concepts and their philosophical origins for believing this equilibium is of great importance for clarifing the ideas in a work for beginners. The first chapter starts with a brief historical approach of logic and then discusses some fundamental concepts from a syntactical point of view. The second chapter discusses the same concepts from a semantical point of view and links syntact and semantics. The third chapter presents the concept of bisimulation and paves the way for working with applications.

La detección de peatones continua siendo un problema muy difícil en escenarios reales, donde diferentes situaciones como cambios en iluminación, imágenes ruidosas, objetos inesperados, escenarios sin control y la variabilidad en la apariencia de los objetos ocurren constantemente. Todos estos problemas fuerzan el desarrollo de detectores más robustos para aplicaciones relevantes como lo son los vehículos autónomos basados en visión, vigilancia inteligente y el seguimiento de peatones para el análisis del comportamiento. Los detectores de peatones basados en visión más confiables deciden basándose en descriptores extraídos usando un único sensor y capturando características complementarias, e.g., apariencia y textura. Estas características son extraídas de una única imagen, ignorando la información temporal, o incluyendo esta información en un paso de post procesamiento e.g., seguimiento o coherencia temporal. Teniendo en cuenta estos hechos, nos formulamos la siguiente pregunta: ¿Podemos generar detectores de peatones más robustos mediante la introducción de nuevas fuentes de información en el paso de extracción de características? Para responder a esta pregunta desarrollamos diferentes propuestas para introducir nuevas fuentes de información a detectores de peatones bien conocidos. Empezamos por la inclusión de información temporal siguiendo el paradigma del aprendizaje secuencial apilado (SSL siglas en inglés), el cual sugiere que la información extraída de las muestras vecinas en una secuencia pueden mejorar la exactitud de un clasificador base. Después nos enfocamos en la inclusión de información complementaria proveniente de sensores diferentes como nubes de puntos 3D (LIDAR - profundidad), imágenes infrarrojas (FIR) o mapas de disparidad (par estéreo de cámaras). Para tal fin desarrollamos un marco multimodal en el cual información proveniente de diferentes sensores es usada para incrementar la exactitud en la detección (aumentando la redundancia de la información). Finalmente proponemos un detector multi-vista, esta propuesta multi-vista divide el problema de detección en n sub-problemas. Cada uno de estos sub-problemas detectara objetos en una vista específica dada, reduciendo así el problema de la variabilidad que se tiene cuando un único detector es usado para todo el problema. Demostramos que estas propuestas obtienen resultados competitivos con otros métodos en el estado del arte, pero envés de diseñar nuevas características, reutilizamos las existentes para mejorar el desempeño.
Pedestrian detection continues to be an extremely challenging problem in real scenarios, in which situations like illumination changes, noisy images, unexpected objects, uncontrolled scenarios and variant appearance of objects occur constantly. All these problems force the development of more robust detectors for relevant applications like vision-based autonomous vehicles, intelligent surveillance, and pedestrian tracking for behavior analysis. Most reliable vision-based pedestrian detectors base their decision on features extracted using a single sensor capturing complementary features, e.g., appearance, and texture. These features usually are extracted from the current frame, ignoring temporal information, or including it in a post process step e.g., tracking or temporal coherence. Taking into account these issues we formulate the following question: can we generate more robust pedestrian detectors by introducing new information sources in the feature extraction step? In order to answer this question we develop different approaches for introducing new information sources to well-known pedestrian detectors. We start by the inclusion of temporal information following the Stacked Sequential Learning (SSL) paradigm which suggests that information extracted from the neighboring samples in a sequence can improve the accuracy of a base classifier. We then focus on the inclusion of complementary information from different sensors like 3D point clouds (LIDAR - depth), far infrared images (FIR), or disparity maps (stereo pair cameras). For this end we develop a multi-modal framework in which information from different sensors is used for increasing detection accuracy (by increasing information redundancy). Finally we propose a multi-view pedestrian detector, this multi-view approach splits the detection problem in n sub-problems. Each sub-problem will detect objects in a given specific view reducing in that way the variability problem faced when a single detectors is used for the whole problem. We show that these approaches obtain competitive results with other state-of-the-art methods but instead of design new features, we reuse existing ones boosting their performance.

The aim of this thesis is to describe and analyze modal concord in Mandarin Chinese. Modal concord is a semantic phenomenon in which multiple modal words in a sentence are interpreted semantically as if there was only a single modal expression. The thesis provides a description of the Mandarin modal system (especially the necessity modals), following the formal analysis of Kratzer (1991) and von Fintel & Iatridou (2008). The generalization is established that a concord reading is available only when the modals agree in their modal type, ordering sources and quantificational force. This generalization cannot be accounted for by the current modal concord analyses: the modal logic approach and the type-shifting analysis from Huitink (2008). Inspired by global theories of negative concord such as de Swart & Sag (2002), a fusion analysis is proposed to account for modal concord, which treats the multiple modals in a concord reading as equal to each other in the sense that their combination is semantically equivalent to each modal alone, leading to a single modality interpretation.
Arts, Faculty of
Linguistics, Department of
Graduate

Research into the usability of multi-modal systems has tended to be device-led, with a resulting lack of theory about multi-modal interaction and how it might differ from more conventional interaction. This is compounded by a confusion over the precise definition of modality between the various disciplines within the HCI community, how modalities can be effectively classified, and their usability properties. There is a consequent lack of appropriate methodologies and notations to model such interactions and assess the usability implications of these interfaces. The role of expertise and craft skill in using HCI techniques is also poorly understood. This thesis proposes a new definition of modality, and goes on to identify issues of importance to multi-modal usability, culminating in the development of a new methodology to support the identification of such usability issues. It additionally explores the role of expertise and craft skill in using usability modelling techniques to assess usability issues. By analysing the problems inherent in current definitions and approaches, as well as issues relevant to cognitive science, a clear understanding of both the requirements for a suitable definition of modality and the salient usability issues are obtained. A novel definition of modality, based on the three elements of sense, information form and temporal nature is proposed. Further, an associated taxonomy is produced, which categorises modalities within the sensory dimension as visual, acoustic and haptic. This taxonomy classifies modalities within the information form dimension as lexical, symbolic or concrete, and classifies the temporal form dimension modalities as discrete, continuous, or dynamic. This results in a twenty-seven cell taxonomy, with each cell representing one taxon, indicating one particular type of modality. This is a faceted classification system, with the modality named after the intersection of the categories, building the category names into a compound modality name. The issues surrounding modality are examined and refined into the concepts of modality types, properties and clashes. Modalities are identified as belonging to either the system or the user, and being expressive or receptive in type. Various properties are described based on issues of granularity and redundancy. The five different types of clashes are described. Problems relating to the modelling of multi-modal interaction are examined by means of a motivating case study based on a portion of an interface for a robotic arm. The effectiveness of five modelling techniques, STN, CW, CPM-GOMS, PUM and Z, in representing multi-modal issues are assessed. From this, and using the collated definition, taxonomy and theory, a new methodology, Evaluating Multi-modal Usability (EMU), is developed. This is applied to a previous case study of the robotic arm to assess its application and coverage. Both the definition and EMU are used by students in a case study to test the definition and methodology's effectiveness, and to examine the leverage such an approach may give. The results shows that modalities can be successfully identified within an interactive context, and that usability issues can be described. Empirical video data of the robotic arm in use is used to confirm the issues identified by the previous analyses, and to identify new issues. A rational re-analysis of the six approaches (STN, CW, CPM-GOMS, PUM, Z and EMU) is conducted in order to distinguish between issues identified through craft skill, based on general HCI expertise and familiarity with the problem, and issues identified due to the core of the method for each approach. This is to gain a realistic understanding of the validity of claims made by each method, and to identify how else issues might be identified, and the consequent implications. Craft skill is found to have a wider role than anticipated, and the importance of expertise in using such approaches emphasised. From the case study and the re-analyses the implications for EMU are examined, and suggestions made for future refinement. The main contributions of this thesis are the new definition, taxonomy and theory, which significantly contribute to the theoretical understanding of multi-modal usability, helping to resolve existing confusion in this area. The new methodology, EMU, is a useful technique for examining interfaces for multi-modal usability issues, although some refinement is required. The importance of craft skill in the identification of usability issues has been explicitly explored, with implications for future work on usability modelling and the training of practitioners in such techniques.

Orientador: Jose Alexandre Durry Guerzoni
Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas
Made available in DSpace on 2018-07-19T12:28:05Z (GMT). No. of bitstreams: 1 Magossi_JoseCarlos_M.pdf: 10085958 bytes, checksum: 78f696d242fe4880bc35c9334cf34e9c (MD5) Previous issue date: 1994
Resumo: Não informado
Abstract: Not informed.
Mestrado
Mestre em Lógica e Filosofia da Ciência

Made available in DSpace on 2015-03-03T15:47:48Z (GMT). No. of bitstreams: 1 AdrianoAD_DISSERT.pdf: 771338 bytes, checksum: 06adea5feab9914c5a48eb146511b556 (MD5) Previous issue date: 2013-11-19
Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior
I thank to my advisor, Jo?o Marcos, for the intellectual support and patience that devoted me along graduate years. With his friendship, his ability to see problems of the better point of view and his love in to make Logic, he became a great inspiration for me. I thank to my committee members: Claudia Nalon, Elaine Pimentel and Benjamin Bedregal. These make a rigorous lecture of my work and give me valuable suggestions to make it better. I am grateful to the Post-Graduate Program in Systems and Computation that accepted me as student and provided to me the propitious environment to develop my research. I thank also to the CAPES for a 21 months fellowship. Thanks to my research group, LoLITA (Logic, Language, Information, Theory and Applications). In this group I have the opportunity to make some friends. Someone of them I knew in my early classes, they are: Sanderson, Haniel and Carol Blasio. Others I knew during the course, among them I?d like to cite: Patrick, Claudio, Flaulles and Ronildo. I thank to Severino Linhares and Maria Linhares who gently hosted me at your home in my first months in Natal. This couple jointly with my colleagues of student flat Fernado, Don?tila and Aline are my nuclear family in Natal. I thank my fianc?e Lucl?cia for her precious a ective support and to understand my absence at home during my master. I thank also my parents Manoel and Zenilda, my siblings Alexandre, Paulo and Paula.Without their confidence and encouragement I wouldn?t achieve success in this journey. If you want the hits, be prepared for the misses Carl Yastrzemski
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

We formalise the notion of enriched coalgebraic modal logic, and determine conditions on the category V (over which we enrich), that allow an enriched logical connection to be extended to a framework for enriched coalgebraic modal logic. Our framework uses V-functors L: A → A and T: X → X, where L determines the modalities of the resulting modal logics, and T determines the coalgebras that provide the semantics. We introduce the V-category Mod(A, α) of models for an L-algebra (A, α), and show that the forgetful V-functor from Mod(A, α) to X creates conical colimits. The concepts of bisimulation, simulation, and behavioural metrics (behavioural approximations),are generalised to a notion of behavioural questions that can be asked of pairs of states in a model. These behavioural questions are shown to arise through choosing the category V to be constructed through enrichment over a commutative unital quantale (Q, Ⓧ, I) in the style of Lawvere (1973). Corresponding generalisations of logical equivalence and expressivity are also introduced,and expressivity of an L-algebra (A, α) is shown to have an abstract category theoretic characterisation in terms of the existence of a so-called behavioural skeleton in the category Mod(A, α). In the resulting framework every model carries the means to compare the behaviour of its states, and we argue that this implies a class of systems is not fully defined until it is specified how states are to be compared or related.

Considerando el estado de la ciudad y su relación con el transporte y el territorio mayor, el proyecto se define como Estación de Transferencia Modal, haciendo referencia a las relaciones entre el edificio propuesto, su funcionamiento interno y el sector de la ciudad en que se emplaza.

Gödel proved his Incompleteness theorems for any theory 'strong' enough to represent recursive functions. In the process he showed that the provability predicate can be represented in such theories. Modal logics of provability are modal logics which attempt to express the concept of 'provability' and 'consistency' using the modal operators '[]' and '<>' respectively. This is achieved by forcing '[]' to behave like the provability predicate. GL is a modal logic which has been shown to be complete and sound with respect to arithmetic theories (theories which can represent all recursive functions), hence results about concepts such as 'consistency,' 'provability' and 'decidability' in arithmetic theories can be stated and proved in GL. It has also been proved that GL is complete with respect to the class of finite, transitive, reversely well-founded models. This essentially means that the set of theorems of GL is recursive and hence there exists an effective procedure to determine whether a given wff is a theorem of GL or not. We investigate a weaker version of GL called GH and show that GH is not complete with respect to arithmetic theories. We show this by first showing that GH is a proper subset of GL and then showing that the theorems missing from GH are properties of the provability predicate. We finally, show that GH is not complete with respect to the class of transitive, reversely well-founded models and hence not sound and complete with respect to any frame.

Master of Science

Mestrado em Matemática e Aplicações
O objectivo deste trabalho é desenvolver algumas ferramentas categoriais para provar teoremas de dualidades para categorias de álgebras relevantes na lógica (modal). O primeiro capítulo engloba os conceitos mais elementares de teoria das categorias. No segundo, analisamos adjunções, mónadas e algumas construções associadas, no sentido de determinar uma relação entre as meta-categorias das mónadas definidas numa categoria e das adjunções de Kleisli sobre a mesma categoria. Álem disso, mostramos que a construção de Vietoris é uma componente de uma mónada de Kock-Zöberlein. No terceiro capítulo provamos teoremas de dualidades para álgebras Booleanas com operador e reticulados distributivos com operador, como consequência de dualidades mais gerais de categorias de espaços e relações. Para finalizar, mostramos que a operação nas categorias de álgebras e “hemimorfismos” que corresponde ao produto cartesiano nas categorias de espaços e relações é o produto tensorial.
The aim of this work is to develop some categorial tools for proving dualities for categories of algebras relevant in (modal) logic. The first chapter covers the most basic concepts of category theory. In the second, we analyze adjunctions, monads and some associated constructions, in order to determine a relationship between the meta-categories of monads defined on a category and of the Kleisli adjunctions on the same category. Moreover, we prove that the Vietoris construction is part of a Kock-Zöberlein monad. In the third chapter we prove duality theorems for Boolean algebras with operator and distributive lattices with operator as a consequence of more general dualities of categories of spaces and relations. Finally, we show that the operation in the categories of algebras and “ hemimorfismos” that corresponds to the cartesian product on the categories of spaces and relations is the tensor product.

Thesis (Ph.D.)--Indiana University, Dept. of Philosophy, 2005.
Title from PDF t.p. (viewed Dec. 2, 2008). Source: Dissertation Abstracts International, Volume: 66-02, Section: A, page: 0620. Chairs: Lawrence Moss; Michael Dunn.

Submitted by Aline Mendes (alinemendes.ufc@gmail.com) on 2014-10-30T16:41:14Z No. of bitstreams: 1 2013_dis_aadodó.pdf: 766766 bytes, checksum: fe9ca34054b8f516e6a8b7c29863d627 (MD5)
Approved for entry into archive by Aline Mendes(alinemendes.ufc@gmail.com) on 2014-10-30T16:43:23Z (GMT) No. of bitstreams: 1 2013_dis_aadodó.pdf: 766766 bytes, checksum: fe9ca34054b8f516e6a8b7c29863d627 (MD5)
Made available in DSpace on 2014-10-30T16:43:23Z (GMT). No. of bitstreams: 1 2013_dis_aadodó.pdf: 766766 bytes, checksum: fe9ca34054b8f516e6a8b7c29863d627 (MD5) Previous issue date: 2013
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.
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.

Impact hammer is the current modal testing way in Dynapac testing department. Due to highly damped characteristic of big construction machines, there are a few weaknesses for modal testing when using hammer, such as short response time, limited frequency resolution, poor quality of frequency response functions. Therefore, a more advanced excitation equipment is needed to improve the measurement quality. The object for this study is to compare two different measuring methods. The thesis will show a comparison between the hammer testing and the shaker MIMO testing compared with analytical model in a highly damped system. It will also give a reference for further highly damped modal analysis and budgetary assessment to decide the budget expenditure. Result from shaker testing shows a little better correlation than hammer testing compared with FEM model. While the correlation between FEM model and measurement is bad due to many reasons, such as many local modes that can not excited, lack of excitation points, unexpected noise and error from the measurement. While considering the compared results obtained from this machine for now, a simpler structure experiment is suggested to be carried on in the future. Shorter length of stinger can be used to enable higher amplitude of force to excite the property on this machine.

Thesis (M.S.)--West Virginia University, 2006.
Title from document title page. Document formatted into pages; contains vi, 76 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 60-61).

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
Includes bibliographical references (p. 131-145).
by Ganesh Nachiappa Ramaswamy.
Ph.D.

L’objectif de cette thèse est de comprendre l’usage et les pratiques modales des individus et saisir les conséquences globales d’un nouveau mode alternatif « tramway » au sein de l’agglomération Rabat- Salé sur une société donnée (marocaine). Cette étude doctorale met en exergue les variables, les logiques individuelles qui interagissent dans un report modal et qui peuvent parfois être la cause des freins et de comportements résistants face au changement et à l’innovation. Les choix modaux se trouvent au cœur d’un processus complexe autour d’une multitude de facteurs et de variables. Un des éléments clés résultant de notre enquête sociologique pour accepter le changement consiste à acquérir de nouvelles compétences en termes de mobilité. Notre travail a été réalisé à l’échelle micro- individuelle qui correspond le mieux à notre problématique pour mieux analyser les pratiques des individus, les émotions, les normes sociales incorporées. La méthode qualitative retenue permet de se concentrer sur les propos des individus, la construction de leurs choix modaux, les représentations et les significations que donnent chaque personne à son choix. Le cadrage méthodologique s’est construit en se concentrant sur la focale « dimension culturelle et symbolique » de la société marocaine interrogée pour mieux saisir les processus de changement dans leur dynamique contextuelle et temporelle. En mêlant recherches bibliographiques épistémologiques, théoriques, enquêtes de terrain et analyse sociologique, cette thèse tente d’apporter des éléments de compréhension pour appréhender l’appropriation et l’adoption de ce nouveau concept de mobilité durable au sein de la société marocaine et contribue donc aussi à mener une réflexion sur le changement vers une mobilité plus durable et viable
The objective of this thesis is to understand the use and the modal practices of individuals and to seize the global consequences of a means of transport « tramway » within the agglomeration of Rabat-Salé and also the consequence in Moroccan society. This doctoral study highlights the variables, the individual logics which interact in a modal transfer and witch can sometimes be the cause of brakes and resistant behavior to change and innovation. The modal choices are at the heart of a complex process around a multitude of factors and variables. One of the key elements resulting from a sociological analysis of mobility to accept the change consists in acquiring new skills in terms of mobility. Our work was realized at the micro-individual scale which corresponds to the best in order to analyze better the practices of individuals, the feeling and the incorporated social standards. The chosen qualitative method allows to concentrate on the words of people, The construction of their modal choices, the representations and meanings that every person gives to its choice. The methodological framework is built by focusing on the focal length « cultural and symbolic dimension » of the Moroccan society questioned to better understand the process of change in their contextual and temporal dynamics. By combining epistemological literature, theoretical bibliographical researches, inquiries of ground and sociological analysis, this thesis tries to bring elements of understanding to include the appropriation and the adoption of this new concept of sustainable mobility within the Moroccan society and contributes also reflect of the change to a more sustainable mobility

This thesis provides adaptations of the algebraic and relational semantics of modal logic to model J.-Y. Girard's linear logic extended with general modalities. This work extends the work of M. D'Agostino, D. Gabbay, and A. Russo on modalities in implication systems, which include a fragment of linear logic, and the work of J.-Y. Girard on phase semantics for linear logic. We develop deductive systems based on the Gentzen-style sequent calculi of Ohnishi and Matsumoto and the indexed sequents of Mints, and prove cut-elimination properties. We show that semantics and deductive systems that are equivalent for classical modal logic become nonequivalent when adapted to linear logic. We also provide a semantics based on Girard's phase semantics for the fixpoint operators of the modal mu-calculus, developed by D. Kozen, E. A. Emerson, E. Clarke, and others, in linear logic, and consider the translation of Y. Lafont's exponentials with the Free Storage rule into linear logic with fixpoint operators.

Modal logics have found applications in many diferent contexts. For example, epistemic modal logics can be used to reason about security protocols, temporal modal logics can be used to reason about the correctness of distributed systems and propositional dynamic logic can reason about the correctness of programs. However, pure modal logic is expressively weak and cannot represent many interesting secondorder properties that are expressible, for example, in the μ-calculus. Here we investigate the extension of modal logics with propositional quantification modulo bisimulation (bisimulation quantification). We extend existing work on bisimulation quantified modal logic by considering the variety of logics that result by restricting the structures over which they are interpreted. We show this can be a natural extension of modal logic preserving the intuitions of both modal logic and propositional quantification. However, we also find cases where such intuitions are not preserved. We examine cases where the axioms of pure modal logic and propositional quantification are preserved and where bisimulation quantifiers preserve the decidability of modal logic. We translate a number of recent decidability results for monadic second-order logics into the context of bisimulation quantified modal logics, and show how these results can be used to generate a number of interesting bisimulation quantified modal logics.