Toposes and intuitionistic theories of types
β Scribed by R. Lavendhomme; Th. Lucas
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 977 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0022-4049
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract In this paper we show that the usual intuitionistic characterization of the decidability of the propositional function __B(x) prop__ [__x : A__], i. e. to require that the predicate (β__x__ β __A__) (__B(x)__ β¨ Β¬ __B(x)__) is provable, is equivalent, when working within the framework of
## Abstract We investigate Hilbert's Ο΅βcalculus in the context of intuitionistic type theories, that is, within certain systems of intuitionistic higherβorder logic. We determine the additional deductive strength conferred on an intuitionistic type theory by the adjunction of closed Ο΅βterms. We ext
I n an earlier paper [2], using ZERMELO-FRAENXEL set theory (ZF) as metalanguage, for each ordinal 6 2 1, I introduced a system TTo of transfinite type theory formulated in GENTZEN'S sequentzen style [3]. The notion of sequent and the rules of inference were straightforward generalizations of those