02057nam a2200205 a 450000100080000000500110000800800410001910000230006024500460008326000400012930000100016950000200017952015370019965300200173665300180175665300210177465300270179565300140182265300150183610872662007-12-12       1990    bl uuuu  m   00u1 u    #d1 aCOSTA, M. M. do C.  aCharacterization of modal [action] logic.  aLondres: University of Londonc1990  a257p.  aTese Doutorado.  aThe purpose of this thesis is to provide adequate conditions of provability- the so called characterization problem- for the modal [action] logic (M[A]L). M[A]L is a formal system to support formal requirements specification of real time/embedded systems designed and used by the FOREST project of the alvey software engineering directorate. The characterization problem is to be dealt with using two basic approaches: possible world structures on the semantics level and the semantic tableaux on the proof level.The development of the work follows the paradigm of starting with a more simple logic, the propositional M[A]L, and gradually adding components such as quantification, deontic operators, sorts and others. The use of formal systems is the central idea for  the support of mechanized deduction in computer science. Modal and temporal logics may have a considerable role, but different areas of application use various combinations of quantification and modalities, and can lead to a generation of new logics (such as M[A]L). The result of this enterprise will depend heavily on the existence of suitable methods for providing adequate and efficient proof procedures for these formalisms. Traditionally, the semantic tableau method is considered to be very intuitive: so that one could start reasoning in terms of tableau and then extend  the results to another system with different characteristics. In this thesis we affirm this tradition and we formulate evidences for its efficiency as well. This thesis constitutes...  aData processing  aLógica Modal  aLógica Temporal  aProcessamento de Dados  aReal time  aTempo Real