Cut-Elimination for Simple Type Theory with an Axiom of Choice

Journal of Symbolic Logic 64 (2):479-485 (1999)
  Copy   BIBTEX

Abstract

We present a cut-elimination proof for simple type theory with an axiom of choice formulated in the language with an epsilon-symbol. The proof is modeled after Takahashi's proof of cut-elimination for simple type theory with extensionality. The same proof works when types are restricted, for example for second-order classical logic with an axiom of choice.

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,532

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

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.
A Simple Proof that Super-Consistency Implies Cut Elimination.Gilles Dowek & Olivier Hermant - 2012 - Notre Dame Journal of Formal Logic 53 (4):439-456.
EM + Ext− + ACint is equivalent to ACext.Jesper Carlström - 2004 - Mathematical Logic Quarterly 50 (3):236-240.
Characterizing the interpretation of set theory in Martin-Löf type theory.Michael Rathjen & Sergei Tupailo - 2006 - Annals of Pure and Applied Logic 141 (3):442-471.
Cut elimination for a simple formulation of epsilon calculus.Grigori Mints - 2008 - Annals of Pure and Applied Logic 152 (1):148-160.
EM + Ext_ + AC~i~n~t is equivalent to AC~e~x~t.Jesper Carlström - 2004 - Mathematical Logic Quarterly 50 (3):236.
Some restricted lindenbaum theorems equivalent to the axiom of choice.David W. Miller - 2007 - Logica Universalis 1 (1):183-199.
Proof normalization modulo.Gilles Dowek & Benjamin Werner - 2003 - Journal of Symbolic Logic 68 (4):1289-1316.
The axiom of choice and the law of excluded middle in weak set theories.John L. Bell - 2008 - Mathematical Logic Quarterly 54 (2):194-201.
A proof of the cut-elimination theorem in simple type theory.Satoko Titani - 1973 - Journal of Symbolic Logic 38 (2):215-226.
The Hauptsatz for Stratified Comprehension: A Semantic Proof.Marcel Crabbé - 1994 - Mathematical Logic Quarterly 40 (4):481-489.
A geometric form of the axiom of choice.J. L. Bell - unknown
The rigid relation principle, a new weak choice principle.Joel David Hamkins & Justin Palumbo - 2012 - Mathematical Logic Quarterly 58 (6):394-398.
On generic extensions without the axiom of choice.G. P. Monro - 1983 - Journal of Symbolic Logic 48 (1):39-52.
Cut‐Elimination Theorem for the Logic of Constant Domains.Ryo Kashima & Tatsuya Shimura - 1994 - Mathematical Logic Quarterly 40 (2):153-172.

Analytics

Added to PP
2017-02-21

Downloads
2 (#1,799,720)

6 months
2 (#1,193,798)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

The Higher-Order Prover LEO-II.Christoph Benzmüller, Nik Sultana, Lawrence C. Paulson & Frank Theiß - 2015 - Journal of Automated Reasoning 55 (4):389-404.
Cut-Elimination for Quantified Conditional Logic.Christoph Benzmüller - 2017 - Journal of Philosophical Logic 46 (3):333-353.

Add more citations

References found in this work

No references found.

Add more references