Difference between revisions of "Realizational formula"
Jump to navigation
Jump to search
(repaired a link) |
(added a category) |
||
| Line 1: | Line 1: | ||
A '''realizational formula''' is the type of algebraic statement that is appropriate for the description of structural relationships according to [[stratificational grammar|stratificational]] theory. A realizational formula bears a superficial resemblance to a rewrite rule. But unlike rewrite or mutation rules in a process description, realization formulae are not necessarily ordered. For example, a pair of formulae may be allowed to operate simultaneously, or they may be allowed to operate in either of the two possible orders. | A '''realizational formula''' is the type of algebraic statement that is appropriate for the description of structural relationships according to [[stratificational grammar|stratificational]] theory. A realizational formula bears a superficial resemblance to a rewrite rule. But unlike rewrite or mutation rules in a process description, realization formulae are not necessarily ordered. For example, a pair of formulae may be allowed to operate simultaneously, or they may be allowed to operate in either of the two possible orders. | ||
| − | |||
===Source=== | ===Source=== | ||
| − | |||
* Lamb, Sydney M., [http://books.google.com/books/about/Language_and_Reality.html?id=vrlPUxB2_JwC Language and Reality: Selected Writings of Sydney Lamb], Continuum, 2004. | * Lamb, Sydney M., [http://books.google.com/books/about/Language_and_Reality.html?id=vrlPUxB2_JwC Language and Reality: Selected Writings of Sydney Lamb], Continuum, 2004. | ||
| − | |||
{{dc}}{{stub}} | {{dc}}{{stub}} | ||
Revision as of 06:21, 8 October 2017
A realizational formula is the type of algebraic statement that is appropriate for the description of structural relationships according to stratificational theory. A realizational formula bears a superficial resemblance to a rewrite rule. But unlike rewrite or mutation rules in a process description, realization formulae are not necessarily ordered. For example, a pair of formulae may be allowed to operate simultaneously, or they may be allowed to operate in either of the two possible orders.
Source
- Lamb, Sydney M., Language and Reality: Selected Writings of Sydney Lamb, Continuum, 2004.
| STUB |
