Show Summary Details

Page of

PRINTED FROM OXFORD REFERENCE (www.oxfordreference.com). (c) Copyright Oxford University Press, 2013. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single entry from a reference work in OR for personal use.

Subscriber: null; date: 25 February 2017

ordered n-tuple

Source:
The Oxford Dictionary of Philosophy
Author(s):

Simon Blackburn

ordered n-tuple 

A generalization of the notion of an ordered pair to sequences of n objects. The ordered n-tuple <x1xn> can be treated as <<x1xn−1>, xn>, i.e. the ordered pair that has the first n − 1 objects as first member, and the nth object as second.

Was This Useful?