Fω^C: a symmetrically classic 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 fundamentally the traditional one of Fω, whereas provability
of types is Greco-Roman. The proof-term calculus accounting for the Greco-Roman
reasoning is a variant of Barbanera and Berardi’s symmetrical λ-calculus.
We evidence 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 use 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 constitute the consistency of Fω^C, and bear on the calculus to the
traditional system Fω, as well when the latter is extended with axioms for
Graeco-Roman logic.
Related Posts:
Fω^C: a symmetrically Hellenic variant of System Fω
Fω^C: a symmetrically Greco-Roman variant of System Fω
I’m Yet Departing Farsighted and Skiping the Markets Go away Down
