Difference between revisions of "Universality"
Jump to navigation
Jump to search
| Line 6: | Line 6: | ||
Universal, [[Technical Term::Universality]] or [[Technical Term::Universal Property]] are technical terms defined in [[Technical Term::Mathematical Logic]] as a property that applies to all cases in a domain explicitly represented by a fixed, often finite set of symbols. A short statement about Universality can be found on page 131 of Davey and Priestly <ref> B. A. Davey, H. A. Priestley, Introduction to Lattices and Order, Second Edition, Cambridge University Press, May 6, 2002, P. 131</ref>. More over, [[Eugene Wigner]]'s talk on [[Paper/The Unreasonable Effectiveness of Mathematics in the Natural Sciences|The Unreasonable Effectiveness of Mathematics in the Natural Sciences]]<ref>{{:Paper/The Unreasonable Effectiveness of Mathematics in the Natural Sciences}}</ref>, is also a good place to get a sense of [[universality]]. | Universal, [[Technical Term::Universality]] or [[Technical Term::Universal Property]] are technical terms defined in [[Technical Term::Mathematical Logic]] as a property that applies to all cases in a domain explicitly represented by a fixed, often finite set of symbols. A short statement about Universality can be found on page 131 of Davey and Priestly <ref> B. A. Davey, H. A. Priestley, Introduction to Lattices and Order, Second Edition, Cambridge University Press, May 6, 2002, P. 131</ref>. More over, [[Eugene Wigner]]'s talk on [[Paper/The Unreasonable Effectiveness of Mathematics in the Natural Sciences|The Unreasonable Effectiveness of Mathematics in the Natural Sciences]]<ref>{{:Paper/The Unreasonable Effectiveness of Mathematics in the Natural Sciences}}</ref>, is also a good place to get a sense of [[universality]]. | ||
=Universal Constructs= | |||
There is a data type called: [[Partially ordered set]], or [[POSet]], being considered as the universal data type for all representables. | |||
Revision as of 15:18, 18 January 2022
| Universality | |
|---|---|
| Term | Universal |
| Knowledge Domain | Science, Mathematics, Mathematical Logic |
| Parent Domain | Cognitive Science |
Universal, Universality or Universal Property are technical terms defined in Mathematical Logic as a property that applies to all cases in a domain explicitly represented by a fixed, often finite set of symbols. A short statement about Universality can be found on page 131 of Davey and Priestly [1]. More over, Eugene Wigner's talk on The Unreasonable Effectiveness of Mathematics in the Natural Sciences[2], is also a good place to get a sense of universality.
Universal Constructs
There is a data type called: Partially ordered set, or POSet, being considered as the universal data type for all representables.
References
- ↑ B. A. Davey, H. A. Priestley, Introduction to Lattices and Order, Second Edition, Cambridge University Press, May 6, 2002, P. 131
- ↑ Wigner, E. P. (1960). "The unreasonable effectiveness of mathematics in the natural sciences. Richard Courant lecture in mathematical sciences delivered at New York University, May 11, 1959". Communications on Pure and Applied Mathematics. local page. 13: 1–14. Bibcode:1960CPAM...13....1W. doi:10.1002/cpa.3160130102. Archived from the original on 2020-02-12.