Explicit Modal Logic

Abstract

In 1933 Godel introduced a modal logic of provability (S4) and left open the problem of a formal provability semantics for this logic. Since then numerous attempts have been made to give an adequate provability semantics to Godel's provability logic with only partial success. In this paper we give the complete solution to this problem in the Logic of Proofs.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1998
Accession Number
ADA365120

Entities

People

  • Sergei N. Artemov

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Arithmetic
  • Calculus
  • Decoding
  • Information Operations
  • Intelligent Systems
  • Language
  • Linguistics
  • Mathematics
  • Military Research
  • Notation
  • Polynomials
  • Recursive Functions
  • Semantics
  • Social Sciences
  • Specifications
  • Standards
  • Universities

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.