Fω^C: a symmetrically Greco-Roman variant of System Fω
Lengrand & Miquel (2008). Hellenic Fω, orthogonality and symmetrical candidates. Annals of Pure and Put on Logic 153:3-20.
We portray a version of system Fω, bade Fω^C, in which the layer of type
constructors is basically the traditional one of Fω, whereas provability
of types is Hellenic. The proof-term calculus accounting for the Graeco-Roman
reasoning is a variant of Barbanera and Berardi’s symmetrical λ-calculus.
We show that the hale calculus is powerfully normalising. For the
layer of type constructors, we utilise Tait and Girard’s reducibility method
combined with orthogonality techniques. For the (classic) layer of terms,
we expend Barbanera and Berardi’s method based on a symmetrical notion of
reducibility candidate. We show that orthogonality does not catch the
fixpoint construction of symmetrical candidates.We lay down the consistency of Fω^C, and colligate the calculus to the
traditional system Fω, too when the latter is extended with axioms for
classic logic.
Related Posts:
My BailOut Solution - I’m In For At Least $50mm
