Second-order propositional logic

A second-order propositional logic is a propositional logic extended with quantification over propositions. A special case are the logics that allow second-order Boolean propositions, where quantifiers may range either just over the Boolean truth values, or over the Boolean-valued truth functions.

The most widely known formalism is the intuitionistic logic with impredicative quantification, system F. Parigot (1997) showed how this calculus can be extended to admit classical logic.

See also

References

Parigot, Michel (1997). Proofs of strong normalisation for second order classical natural deduction. Journal of Symbolic Logic 62(4):14611479.

This article is issued from Wikipedia - version of the Tuesday, August 12, 2014. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.