• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 6
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 9
  • 9
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Completeness in tense logic

Ndabarasa, Emmanuel. January 1980 (has links)
No description available.
2

Completeness in tense logic

Ndabarasa, Emmanuel. January 1980 (has links)
No description available.
3

Tensed change and instantaneous events /

Sweeney, Paul, January 2002 (has links)
Thesis (M.A.)--Memorial University of Newfoundland, 2003. / Bibliography: leaves 159-162.
4

Nominal tense logic and other sorted intensional frameworks

Blackburn, Patrick Rowan January 1990 (has links)
This thesis introduces of a system of tense logic called nominal tense logic (NTL), and several extensions. Its primary aim is to establish that these systems are logically interesting, and can provide useful models of natural language tense, temporal reference, and their interaction. Languages of nominal tense logic are a simple augmentation of Priorean tense logic. They add to the familiar Priorean languages a new sort of atomic symbol, nominals. Like propositional variables, nominals are atomic sentences and may be freely combined with other wffs using the usual connectives. When interpreting these languages we handle the Priorean components standardly, but insist that nominals must be true at one and only one time. We can think of nominals as naming this time. Logically, the change increases the expressive power of tensed languages. There are certain intuitions about the flow of time, such as irreflexivity, that cannot be expressed in Priorean languages; with nominals they can. The effects of this increase in expressive power on the usual model theoretic results for tensed languages discussed, and completeness and decidability results for several temporally interesting classes of frames are given. Various extensions of the basic system are also investigated and similar results are proved. In the final chapter a brief treatment of similarly referential interval based logics is presented. As far as natural language semantics is concerned, the change is an important one. A familiar criticism of Priorean tense logic is that as it lacks any mechanism for temporal reference, it cannot provide realistic models of natural language temporal usage. Natural language tense is at least partly about referring to times, and nowadays the deictic and anaphoric properties of tense are a focus of research. The thesis presents a uniform treatment of certain temporally referring expressions such as indexicals, and simple discourse phenomena.
5

German temporal semantics three-dimensional tense logic and a GPSG fragment /

Nerbonne, John A., January 1985 (has links)
Thesis (Ph. D.)--Ohio State University, 1983. / Includes bibliographical references (p. 290-295).
6

German temporal semantics three-dimensional tense logic and a GPSG fragment /

Nerbonne, John A., January 1985 (has links)
Thesis (Ph. D.)--Ohio State University, 1983. / Includes bibliographical references (p. 290-295).
7

On logics with coimplication

Wolter, Frank 11 October 2018 (has links)
This paper investigates (modal) extensions of Heyting–Brouwer logic, i.e., the logic which results when the dual of implication (alias coimplication) is added to the language of intuitionistic logic. We first develop matrix as well as Kripke style semantics for those logics. Then, by extending the Gödel-embedding of intuitionistic logic into S4 , it is shown that all (modal) extensions of Heyting–Brouwer logic can be embedded into tense logics (with additional modal operators). An extension of the Blok–Esakia-Theorem is proved for this embedding.
8

Advanced Modal Logic

Zakharyaschev, Michael, Wolter, Frank, Chagrov, Alexander 12 October 2018 (has links)
This chapter is a continuation of the preceding one, and we begin it at the place where the authors of Basic Modal Logic left us about fifteen years ago. Concluding his historical overview, Krister Segerberg wrote: “Where we stand today is difficult to say. Is the picture beginning to break up, or is it just the contemporary observer’s perennial problem of putting his own time into perspective?” So, where did modal logic of the 1970s stand? Where does it stand now? Modal logicians working in philosophy, computer science, artificial intelligence, linguistics or some other fields would probably give different answers to these questions. Our interpretation of the history of modal logic and view on its future is based upon understanding it as part of mathematical logic.
9

Enforcement à l'éxécution de propriétés temporisées / Runtime enforcement of timed properties

Pinisetty, Srinivas 23 January 2015 (has links)
L'enforcement à l'exécution est une technique efficace de vérification et de validation dont le but est de corriger les exécutions incorrectes d'un système, par rapport à un ensemble de propriétés désirées. En utilisant un moniteur d'enforcement, une exécution (possiblement incorrecte), vue comme une séquence d'événements, est passée en entrée du moniteur, puis corrigée en sortie par rapport à la propriété. Durant les dix dernières années, l'enforcement à l'exécution a été étudiée pour des propriétés non temporisées. Dans cette thèse, nous considérons l'enforcement à l'exécution pour des systèmes où le temps entre les actions du système influence les propriétés à valider. Les exécutions sont donc modélisées par des séquences d'événements composées d'actions avec leurs dates d'occurence (des mots temporisés). Nous considérons l'enforcement à l'exécution pour des spécifications régulières modélisées par des automates temporisés. Les moniteurs d'enforcement peuvent, soit retarder les actions, soit les supprimer lorsque retarder les actions ne permet pas de satisfaire la spécification, permettant ainsi à l'exécution de continuer. Pour faciliter leur conception et la preuve de leur correction, les mécanismes d'enforcement sont modélisés à différents niveaux d'abstraction : les fonctions d'enforcement qui spécifient le comportement attendu des mécanismes en termes d'entrées-sorties, les contraintes qui doivent être satisfaites par ces fonctions, les moniteurs d'enforcement qui décrivent les mécanismes de manière opérationnelle, et les algorithmes d'enforcement qui fournissent une implémentation des moniteurs d'enforcement. La faisabilité de l'enforcement à l'exécution pour des propriétés temporisées est validée en prototypant la synthèse des moniteurs d'enforcement à partir d'automates temporisés. Nous montrons également l'utilité de l'enforcement à l'exécution de spécifications temporisées pour plusieurs domaines d'application. / Runtime enforcement is a verification/validation technique aiming at correcting possibly incorrect executions of a system of interest. It is a powerful technique to ensure that a running system satisfies some desired properties. Using an enforcement monitor, an (untrustworthy) input execution (in the form of a sequence of events) is modified into an output sequence that complies with a property. Over the last decade, runtime enforcement has been mainly studied in the context of untimed properties. In this thesis, we consider enforcement monitoring for systems where the physical time elapsing between actions matters. Executions are thus modeled as sequences of events composed of actions with dates (called timed words). We consider runtime enforcement for timed specifications modeled as timed automata, in the general case of regular timed properties. The proposed enforcement mechanism has the power of both delaying events to match timing constraints, and suppressing events when no delaying is appropriate, thus allowing the enforcement mechanisms and systems to continue executing. To ease their design and correctness-proof, enforcement mechanisms are described at several levels: enforcement functions that specify the input-output behavior in terms of transformations of timed words, constraints that should be satisfied by such functions, enforcement monitors that describe the operational behavior of enforcement functions, and enforcement algorithms that describe the implementation of enforcement monitors. The feasibility of enforcement monitoring for timed properties is validated by prototyping the synthesis of enforcement monitors from timed automata. We also show the usefulness of enforcement monitoring of timed specifications for several application-domains.

Page generated in 0.0809 seconds