No label defined (Q4733438)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4119663
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4119663

      Statements

      0 references
      1987
      0 references
      logic of occurrence
      0 references
      event logic
      0 references
      tense logic
      0 references
      Minimal Event Logic
      0 references
      MEL
      0 references
      Punctual Event Logic
      0 references
      PEL
      0 references
      Once-only Event Logic
      0 references
      OEL
      0 references
      Durative Event Logic
      0 references
      DEL
      0 references
      [For the entire collection see Zbl 0683.68003.] The paper discusses the formalization of event logic within the modal framework of A. N. Prior's tense logic. This framework allows two kinds of tensed propositions, prefixed by the weak tense-operators \b{P}(ast) and \b{F}(uture), or strong tense-operators \b{H} and \b{G}. E.g. if A=`John is happy', then \b{P}A=`John has been happy', \b{F}A=`John will be happy', \b{H}A=`John has always been happy', \b{G}A=`John will always be happy'. There are introduced the \underbar{event-radicals}, understood as \underbar{event-types} (i.e. generic occurrences), while a specific event, or \underbar{event-token}, shall be an \underbar{occurrence}. propositions are constructed from event-radicals to which are applied three \underbar{aspect operators}: \underbar{Perf}(ect), \underbar{Prog}(ressive), and \underbar{Pros}(pective). Their informal meanings are as follows: If E is an event-radical, then \underbar{Perf}(E) is true if some occurrence of the event E is wholly in the past, \underbar{Pros}(E) is true if some occurrence of E is wholly in the future. Amonge the interpretations for \underbar{Prog}(E), the simplest is that an occurrence of E is partly in the past, partly present, and partly future. Thus the author's logic is not a logic of events but a \underbar{logic of occurrence}, i.e. the logic of the operators \underbar{Perf}, \underbar{Prog}, and \underbar{Pros} which express the occurrence of events in time. In Section 2 there are defined and discussed the languages and their model-theoretic semantics for the following classes of models: \underbar{all}, \underbar{punctual}, \underbar{once-only}, and \underbar{durative event-logical models}. The relationship between \underbar{event logic} and \underbar{tense logic} is model-theoretically established. In Section 3 the axiom system for the class of linear tense- logical models is introduced. There is considered for the Linear Tense Logic (LTL) an axiom system consisting of \underbar{ten axioms} dealing with the tense operators \b{P}, \b{F}, \b{G}, \b{H}, together with the Modus Ponens inference rules. If to this axiom system are added the \underbar{nine axioms} specifying the behaviour of the \underbar{Perf}, \underbar{Prog}, and \underbar{Pros} operators as \underbar{occurences of events} in time, we obtain the Minimal Event Logic (MEL) axiom system. Extensions of MEL towards the Punctual Event Logic (PEL), Once-only Event Logic (OEL), and Durative Event Logic (DEL) are specified. Section 4 contains the \underbar{soundness proofs} for the MEl, PEl, OEL, DEL systems, on the base of the LTL soundness. Section 5 is devoted to \underbar{completeness proofs} of the same systems. Section 6 discusses the question of the mechanisms to be incorporated in MEl in order to obtain explicitly referring to individual times: operators `while', `simul' (for simultaneity), `since', and `until' are added. Section 7 overcomes another limitation of event logic, namely that of not having specific internal structure of events. Constructs such as \underbar{inception}, \underbar{cessetion}, immediate and delayed \underbar{succession} are considered. The paper represents a thorough discussion basis for further elaboration of event logics.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references