Fω^C: a symmetrically Hellenic variant of System Fω
Lengrand & Miquel (2008). Classic 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 classic. The proof-term calculus accounting for the Graeco-Roman
reasoning is a variant of Barbanera and Berardi’s symmetrical λ-calculus.
We bear witness that the hale calculus is powerfully normalising. For the
layer of type constructors, we employ Tait and Girard’s reducibility method
combined with orthogonality techniques. For the (Hellenic) layer of terms,
we expend Barbanera and Berardi’s method based on a symmetrical notion of
reducibility candidate. We demonstrate that orthogonality does not catch the
fixpoint construction of symmetrical candidates.We make the consistency of Fω^C, and connect the calculus to the
traditional system Fω, besides when the latter is extended with axioms for
Graeco-Roman logic.
Related Posts:
Fω^C: a symmetrically Greco-Roman variant of System Fω
I’m Moving Retentive Right Today
I’m Nonetheless Going away Prospicient and Skiping the Markets Go away Down
