A characterization of ML in many-sorted arithmetic with conditional application
Journal of Symbolic Logic 57 (3):924 - 953 (1992)
| 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 in ML, resulting in a characterization of strong Σ-elimination by an axiom of conditional choice | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,865 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesLennart Åqvist (2000). Three Characterizability Problems in Deontic Logic. Nordic Journal of Philosophical Logic 5 (2):65-82.
Lennart Åqvist (2000). Three Characterizability Problems in Deontic Logic. Nordic Journal of Philosophical Logic 5 (2):65-82.
Lennart Åqvist (2000). Three Characterizability Problems in Deontic Logic. Nordic Journal of Philosophical Logic 5 (2):65-82.
Robert C. Stalnaker (1970). Probability and Conditionals. Philosophy of Science 37 (1):64-80.
Richard Bradley (1999). Conditional Desirability. Theory and Decision 47 (1):23-55.
Jaap Van Oosten (1990). Lifschitz' Realizability. Journal of Symbolic Logic 55 (2):805 - 821.
M. D. G. Swaen (1991). The Logic of First Order Intuitionistic Type Theory with Weak Sigma- Elimination. Journal of Symbolic Logic 56 (2):467-483.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads2 ( #234,650 of 556,803 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
