No label defined (Q4400799)

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 1182727
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1182727

      Statements

      0 references
      2 February 1999
      0 references
      syntax
      0 references
      first-order logic
      0 references
      semantics
      0 references
      proof theory
      0 references
      modal logics
      0 references
      Kripke-structures
      0 references
      temporal logic
      0 references
      formal foundations of logic programming and deductive databases
      0 references
      Herbrand model
      0 references
      fixpoint semantics
      0 references
      SLD-resolution
      0 references
      negation
      0 references
      This chapter is intended to provide the basic definitions of those logics which are used in several of the subsequent chapters of this volume. We have divided it into three main parts. First, we briefly introduce the syntax of first-order logic and define the standard (Tarskian) semantics for first-order logic. In addition, we sketch proof theory for first-order logic by presenting a Hilbert style and a natural deduction proof system. Then we turn to the basics of modal logics. The usual approach to give semantics to modal logics is by Kripke-structures. We briefly consider the axiomatization of several standard modal logics. We complete the section on modal logics by considering two special variants of modal logics for describing temporal evolution of systems: linear temporal logic and branching time logic. The third part of this logic primer deals with the formal foundations of logic programming and deductive databases. We define the notions of Herbrand model, fixpoint semantics, and SLD-resolution. Due to the fact that negation in logical rules causes a lot of problems we also consider different ways of defining semantics for logical programs with negation, in particular, we consider stratification, stable semantics, and well-founded semantics. For the entire collection see [Zbl 0889.00013].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references