A characterization of ML in many-sorted arithmetic with conditional application

Journal of Symbolic Logic 57 (3):924-953 (1992)
  Copy   BIBTEX

Abstract

In this paper we discuss an interpretation of intuitionistic type theory in many-sorted arithmetic with so-called conditional application. Via the formulas-as-types correspondence the arithmetical system in turn can be embedded inML, resulting in a characterization of strong Σ-elimination by an axiom of conditional choice.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,931

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

Interpreting true arithmetic in the [image] degrees.Thomas F. Kent - 2010 - Journal of Symbolic Logic 75 (2):522 - 550.
A model-theoretic characterization of the weak pigeonhole principle.Neil Thapen - 2002 - Annals of Pure and Applied Logic 118 (1-2):175-195.
Multi-sorted version of second order arithmetic.Farida Kachapova - 2016 - Australasian Journal of Logic 13 (5).
Lifschitz' realizability.Jaap van Oosten - 1990 - Journal of Symbolic Logic 55 (2):805-821.
Conditional Desirability.Richard Bradley - 1999 - Theory and Decision 47 (1):23-55.
Probability and conditionals.Robert C. Stalnaker - 1970 - Philosophy of Science 37 (1):64-80.
Intuitionistic Choice and Restricted Classical Logic.Ulrich Kohlenbach - 2001 - Mathematical Logic Quarterly 47 (4):455-460.
Lewis-Style Semantics for Conditional Logic of Obligation.Timothy Bowen Patrick - 1992 - Dissertation, University of Missouri - Columbia

Analytics

Added to PP
2017-02-21

Downloads
1 (#1,911,041)

6 months
1 (#1,512,999)

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

No citations found.

Add more citations

References found in this work

No references found.

Add more references