Fω^C: a symmetrically Hellenic variant of System Fω
November 11th, 2008 by kerrysoft and tagged SQL, workflow system
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 classic
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 expend 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 demonstrate that orthogonality does not catch the
fixpoint construction of symmetrical candidates.We shew the consistency of Fω^C, and link up the calculus to the
traditional system Fω, likewise when the latter is extended with axioms for
Greco-Roman logic.
Related Posts:
A Authoritative Post on Public Hedge Funds
Two stories
The Bailout: The Myth, The Legend, The BestSeller
Posted in Technology | Comments Off
