- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
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 choiceOther Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
The logic of first order intuitionistic type theory with weak sigma- elimination.M. D. G. Swaen - 1991 - Journal of Symbolic Logic 56 (2):467-483.
Intuitionistic Choice and Restricted Classical Logic.Ulrich Kohlenbach - 2001 - Mathematical Logic Quarterly 47 (4):455-460.
Type Theory with Opposite Types: A Paraconsistent Type Theory.Juan C. Agudelo-Agudelo & Andrés Sicard-Ramírez - 2022 - Logic Journal of the IGPL 30 (5):777-806.
Partially Undetermined Many-Valued Events and Their Conditional Probability.Franco Montagna - 2012 - Journal of Philosophical Logic 41 (3):563-593.
Substitutions of Σ10-sentences: explorations between intuitionistic propositional logic and intuitionistic arithmetic.Albert Visser - 2002 - Annals of Pure and Applied Logic 114 (1-3):227-271.
Three characterizability problems in deontic logic.Lennart Åqvist - 2000 - Nordic Journal of Philosophical Logic 5 (2):65-82.
Coinductive formulas and a many-sorted interpolation theorem.Ursula Gropp - 1988 - Journal of Symbolic Logic 53 (3):937-960.
Prenex normal form theorems in semi-classical arithmetic.Makoto Fujiwara & Taishi Kurahashi - 2021 - Journal of Symbolic Logic 86 (3):1124-1153.
An Intuitionistically Complete System of Basic Intuitionistic Conditional Logic.Grigory Olkhovikov - 2024 - Journal of Philosophical Logic 53 (5).
Analytics
Added to PP
2009-01-28
Downloads
62 (#346,348)
6 months
17 (#179,757)
2009-01-28
Downloads
62 (#346,348)
6 months
17 (#179,757)
Historical graph of downloads
References found in this work
Per Martin-Löf. Intuitionistic type theory. Studies in proof theory. Bibliopolis, Naples1984, ix + 91 pp. [REVIEW]W. A. Howard - 1986 - Journal of Symbolic Logic 51 (4):1075-1076.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-648784bb4d-72rpk uwo