A generalization of the notion of an ordered pair to sequences of n objects. The ordered n-tuple <x1…xn > can be treated as <<x1…xn-1 >, xn >, i.e. the ordered pair that has the first n - 1 objects as first member, and the nth object as second.
ordered n-tuple
| Philosophy Dictionary: ordered n-tuple |
Learn More
 | logical function (philosophy) |
| recursive (philosophy) |
| Logical symbols (philosophy) |
Help us answer these
 | How do you order tuples in sql? |
| What is tuples in sql? |
| What are tuple seconds? |
Post a question - any question - to the WikiAnswers community:
Copyrights:
 |
 | Philosophy Dictionary. The Oxford Dictionary of Philosophy. Copyright © 1994, 1996, 2005 by Oxford University Press. All rights reserved. Read more |
Related answers
- What is spurious tuples?
- What is the firing order n a 1991 eagle premier 3.0?
- Write a c program to n numbers ascending order?
ADVERTISEMENT
Answer these
- What are n-tuples of numbers?
- Why are tuples in a relation not ordered?
- Why the tuples in a relation are not ordered?
- Order N by growth rate?
Mentioned in
- logical function (philosophy)
- recursive (philosophy)
- Logical symbols (philosophy)
- Cuthill–McKee algorithm
- Colexicographical order
- Braid theory
- Combinadic
- ISO 31-11
- Tuple
- Cardinal number
- Formal interpretation
- Formal grammar
- List of philosophy topics (I-Q)
