A proof of the cut-elimination theorem in simple type theory

Journal of Symbolic Logic 38 (2):215-226 (1973)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Cut-elimination for simple type theory with an axiom of choice.G. Mints - 1999 - Journal of Symbolic Logic 64 (2):479-485.
Proof normalization modulo.Gilles Dowek & Benjamin Werner - 2003 - Journal of Symbolic Logic 68 (4):1289-1316.
A Simple Proof that Super-Consistency Implies Cut Elimination.Gilles Dowek & Olivier Hermant - 2012 - Notre Dame Journal of Formal Logic 53 (4):439-456.
The Hauptsatz for Stratified Comprehension: A Semantic Proof.Marcel Crabbé - 1994 - Mathematical Logic Quarterly 40 (4):481-489.
Simple cut elimination proof for hybrid logic.Andrezj Indrzejczak - 2016 - Logic and Logical Philosophy 25 (2):129-141.
Determinate logic and the Axiom of Choice.J. P. Aguilera - 2020 - Annals of Pure and Applied Logic 171 (2):102745.

Analytics

Added to PP
2009-01-28

Downloads
24 (#909,478)

6 months
3 (#1,470,638)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references