On Proof Realization of Intuitionistic Logic

Abstract

In 1933 Godel Introduced an axiomatic system, currently known as S4, for a logic of an absolute provability. The problem of finding a fair probability model for S4 was left open. In the current paper we demonstrate how the Intuitionistic propositional logic Int can be directly realized by proof polynomials. It is shown that Int is complete with respect to this proof realizability.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1997
Accession Number
ADA344305

Entities

People

  • S. N. Artemov

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Arithmetic
  • Artificial Intelligence
  • Calculus
  • Embedding
  • Information Operations
  • Intelligent Systems
  • Language
  • Mathematics
  • Military Research
  • Polynomials
  • Recursive Functions
  • Semantics
  • Specifications
  • Standards
  • Translations

Fields of Study

  • Computer science

Readers

  • Computer Engineering
  • Mathematical Modeling and Probability Theory.