Difference between revisions of "Semantics"
| (4 intermediate revisions by the same user not shown) | |||
| Line 2: | Line 2: | ||
=Software Engineering and Semantics= | =Software Engineering and Semantics= | ||
To relate [[semantics]] with software engineering, we can start from [[Dana Scott]]'s work on [[mathematical semantics]]. He wrote a famous | To relate [[semantics]] with software engineering, we can start from [[Dana Scott]]'s work on [[mathematical semantics]]. He wrote a famous paper<ref>{{:Paper/Outline of a Mathematical Theory of Computation}}</ref>, that outlined the nature of computation into a [[scale-free]] mathematical object called [[lattice]]. He also axiomatically claimed that all computable structures of any scale must be representable using [[lattice]]s, which are [[time-like]] structures. | ||
<noinclude> | <noinclude> | ||
| Line 9: | Line 9: | ||
<references/> | <references/> | ||
==Related Pages== | ==Related Pages== | ||
*[[Category:Meta physics]] | *[[Definition::Knowledge Representation]] | ||
[[Category:Meta physics]] | |||
[[Category:Category Theory]] | |||
[[Category:Mathematical semantics]] | |||
[[Category:Data Science]] | |||
[[Category:Digital Twin]] | |||
[[Category:Poset]] | |||
[[Category:Lattice]] | |||
[[Category:Namespace]] | |||
</noinclude> | </noinclude> | ||
Latest revision as of 10:25, 23 February 2022
Semantics of data can be visualized using Semantic Result Formats. This presents a conduit to represent any spatial-temporal events or data content in a semantically represented framework. The hint is that semantics of any data don't need to be bound to a given scale. The nature of semantics is scale-free. This simply means that we can reuse the functionality of Semantic Result Formats for a wide range of applications.
Software Engineering and Semantics
To relate semantics with software engineering, we can start from Dana Scott's work on mathematical semantics. He wrote a famous paper[1], that outlined the nature of computation into a scale-free mathematical object called lattice. He also axiomatically claimed that all computable structures of any scale must be representable using lattices, which are time-like structures.
References
- ↑ Scott, Dana (January 1, 1970). "Outline of a Mathematical Theory of Computation". local page: Oxford University Computing Laboratory Programming Research Group.