Proof Polynomials: A Unified Semantics for Modality and lambda-terms

Abstract

In this paper we present a finite axiomatization of the Logic of Proofs in Hilbert, Gentzen and natural deductions systems and prove normalization theorems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 31, 1998
Accession Number
ADA348904

Entities

People

  • S. N. Artemov

Organizations

  • Cornell University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Arithmetic
  • Calculus
  • Computer Programming
  • Computer Science
  • Computers
  • Construction
  • Language
  • Logic
  • Mathematical Logic
  • Mathematics
  • Polynomials
  • Self Assembly
  • Semantics
  • Theorems
  • Theoretical Computer Science