Fω^C: a symmetrically authoritative 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 fundamentally the traditional one of Fω, whereas provability
of types is Graeco-Roman. The proof-term calculus accounting for the Greco-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 apply Tait and Girard’s reducibility method
combined with orthogonality techniques. For the (definitive) layer of terms,
we expend Barbanera and Berardi’s method based on a symmetrical notion of
reducibility candidate. We try that orthogonality does not catch the
fixpoint construction of symmetrical candidates.We plant the consistency of Fω^C, and have-to doe with the calculus to the
traditional system Fω, too when the latter is extended with axioms for
Hellenic logic.
Related Posts:
Fω^C: a symmetrically definitive variant of System Fω
I’m Moving Recollective Right Nowadays
