𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cut Elimination in Transfinite Type Theory

✍ Scribed by Kenneth A. Bowen

Publisher
John Wiley and Sons
Year
1973
Tongue
English
Weight
953 KB
Volume
19
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cut Elimination in Ξ΅-Calculi
Cut Elimination in Ξ΅-Calculi
✍ Mitsuru Yasuhara πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 410 KB

WESSELS considered in [8] cut elimination in a Gentzen-style &-calculus without equality. But MINC pointed out in [6] that the proof in [8] is defective and mentions that the cut elimination theorem in a modified system can be proved model-theoretically. The work in 3 1, perhaps, carries out exactly

Systems of Transfinite Type Theory Based
Systems of Transfinite Type Theory Based on Intuitionistic and Modal Logics
✍ 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

Transfinite Recursion in a Theory of Pro
Transfinite Recursion in a Theory of Properties
✍ Stephen Pollard πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 496 KB

As SCOTT has shown, the Replacement. scheme of Z F derives a large part, of its strength from the Extensionality axiom. For in the absence of the latter, the supply of demonstrably functional formula matrices is relatively ineagei..l) I n this situation, u-e can restore some of Replacemmt's vigor by