Enjoyable Blog of Possibilities

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 classic. 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 employ Tait and Girard’s reducibility method
combined with orthogonality techniques. For the (classic) layer of terms,
we use Barbanera and Berardi’s method based on a symmetrical notion of
reducibility candidate. We test that orthogonality does not catch the
fixpoint construction of symmetrical candidates.

We institute the consistency of Fω^C, and pertain the calculus to the
traditional system Fω, too when the latter is extended with axioms for
classic logic.

Related Posts:
The Botox Bailout Q&A