## 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
β¦ LIBER β¦
Intuitionistic theory of functionals of a high type
β Scribed by F. R. Kashapova
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1989
- Tongue
- English
- Weight
- 710 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Decidability in Intuitionistic Type Theo
β
Silvio Valentini
π
Article
π
1996
π
John Wiley and Sons
π
English
β 255 KB
Toposes and intuitionistic theories of t
β
R. Lavendhomme; Th. Lucas
π
Article
π
1989
π
Elsevier Science
π
English
β 977 KB
Systems of Transfinite Type Theory Based
β
Kenneth A. Bowen
π
Article
π
1974
π
John Wiley and Sons
π
English
β 953 KB
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
Denotational semantics for intuitionisti
β
Geir WaagbΓΈ
π
Article
π
1999
π
Springer
π
English
β 252 KB
Saturated models of intuitionistic theor
β
Carsten Butz
π
Article
π
2004
π
Elsevier Science
π
English
β 411 KB
Axiomatic theory of intuitionistic fuzzy
β
Mustafa Demirci
π
Article
π
2000
π
Elsevier Science
π
English
β 128 KB