Difference between revisions of "Universality"
Jump to navigation
Jump to search
m (1 revision imported) |
|||
| Line 5: | Line 5: | ||
}} | }} | ||
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. | 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> | ||
=References= | |||
[[Category:Technical Term]] | [[Category:Technical Term]] | ||
Revision as of 09:24, 16 May 2021
| 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]
References
- ↑ B. A. Davey, H. A. Priestley, Introduction to Lattices and Order, Second Edition, Cambridge University Press, May 6, 2002, P. 131