Reversedragon: Usage notes

2025-06-24T12:10:24Z

Usage notes

← Older revision		Revision as of 12:10, 24 June 2025
Line 7:		Line 7:
	<dl class="wikitable hue">		<dl class="wikitable hue">
	{{HueClaim\|P=item type\| {{Template:Z0}} }}		{{HueClaim\|P=item type\| {{Template:Z0}} }}
	{{HueRoster\|P={{Ontology:PPPA/L}}\| {{Ontology:~~Q26~~}} }}		{{HueRoster\|P={{Ontology:PPPA/L}}\| {{Ontology:Q28}} }}
	{{HueRoster\|P={{Ontology:PPPA}}\| signifier containing arrangement of signifiers \| signifiers arranged into mathematical equation with operators }}		{{HueRoster\|P={{Ontology:PPPA}}\| signifier containing arrangement of signifiers \| signifiers arranged into mathematical equation with operators }}
	{{HueRoster\|P={{Ontology:P42}}\| -- }} <!-- en: QID references -->		{{HueRoster\|P={{Ontology:P42}}\| -- }} <!-- en: QID references -->
Line 18:		Line 18:

	<dl class="wikitable hue data_motifs">		<dl class="wikitable hue data_motifs">
	{{HueClaim\|P=appears in work\| -- \|OP=with context\| definition }}		{{HueClaim\|P=appears in work\| [[Philosophical Research:MDem/4.3/6951 plus\|MDem 4.3/6951 plus]] \|OP=with context\| definition }}
	</dl>		</dl>

Line 27:		Line 27:
	</dl>		</dl>

			== Usage notes ==

	[[Category:Structuralist linguistics ontology]]		A signifier equation is a sign expressed in the form of "A = B + C", or such an equation containing any number of signifier terms and operators which combine them together. For any given declarative proposition, such as "An apple is a red fruit", the proposition can be rearranged as "apple = fruit + red" or "<span aria-label="apple = set of fruit, red">apple = {fruit, red}</span>". More than this, signifier equations can be nested into other signifier equations: "<span aria-label="apple = set of two sets: set of tree, branch, flower, set of cranberry, ripe, color">apple = { {tree,branch,flower}, {cranberry,ripe,color} }</span>".

			The basic purpose of signifier equations is to formalize the notion of defining a signifier so that it can be used by ordinary computer programs which are not neural networks, as with [[:Category:Wavebuilder ontology\|Wavebuilder]]. In turn, this allows for the possibility of thinking of signifiers as something other than language <i>per se</i> — if we pick our signifiers very carefully, we can effectively use them as very simple scientific models of real-world processes, or some other kind of restricted model of physics-based systems, such as an ontology which is capable of representing interactions between the rules of a card game. The difference between language and mathematics is much smaller than it would appear; if the concepts of language are used precisely enough for the purposes of some particular application, sentences themselves effectively become capable of certain kinds of propositional logic where the words or claims inside the sentences can be [[Philosophical Research:MDem/5.1r/1101 differentiate\|interacted with each other to reveal possible contradictions or pieces of the conclusion]].

			[[:Category:Wavebuilder ontology\|Wavebuilder]] implements signifier equations mostly in a classic form of "<span aria-label="A = set of B, C">A = {B, C}</span>", in order to turn them into [[Philosophical Research:MDem/5.1r/1101 differentiate\|wave machine]] tables and focus on the simple concept of finding the most "obvious" result of two components or propositions. Dictionary files can be constructed different ways or from different pieces, allowing for different ontologies of what elements or Items combine to produce what. (On Litho<em>graph</em>ica, where there is only one set of Items, the strategy is simply to create parallel sets of Items that stack up into different conceptual models.) No result is truly canonical; the purpose of combinations is to test the strength of previous combinations as much as it is to discover new results. This allows Wavebuilder combinations to function effectively as a tool for creativity and [[Ontology:Q99\|meta-ontological]] reasoning.


			[[Category:Structuralist linguistics ontology]] [[Category:Wavebuilder mechanics ontology]]

Reversedragon: copy or update fake Item from Q25

2025-06-24T07:02:15Z

copy or update fake Item from Q25

New page

{{HueCSS}}<ol class="hue clean compound"><li>
<onlyinclude><dfn class="field_geo manual" data-dimension="Z0" data-qid="28" data-numbersign="404" data-field="" data-work="" data-chapter="" data-tale="" data-object="" data-note="" data-lexeme="">{{IZ0}}{{#if: {{{1|}}} | [[Ontology:Q28|{{{1}}}]] | [[Ontology:Q28|signifier equation]] }}<ins class="field"></ins>{{WaveScore|sum=1|quilt=1|ply=1}}</dfn></onlyinclude> <seo title="signifier equation - Z0 / Q'28" />
</li></ol> __NOTOC__

== Core characteristics ==

<dl class="wikitable hue">
{{HueClaim|P=item type| {{Template:Z0}} }}
{{HueRoster|P={{Ontology:PPPA/L}}| {{Ontology:Q26}} }}
{{HueRoster|P={{Ontology:PPPA}}| signifier containing arrangement of signifiers | signifiers arranged into mathematical equation with operators }}
{{HueRoster|P={{Ontology:P42}}| -- }} 
{{HueRoster|P={{Ontology:P56}}| mathematical operator }} 
{{HueRoster|P={{Ontology:P4}}| -- }} 
{{HueRoster|P={{Ontology:P5}}| ontological model }} 
</dl>

=== Use in thesis portals ===

<dl class="wikitable hue data_motifs">
{{HueClaim|P=appears in work| -- |OP=with context| definition }}
</dl>

== Wavebuilder combinations ==

<dl class="wikitable hue data_wavebuild three">
{{WaveBuild| -- | -- | -- }} 
</dl>

[[Category:Structuralist linguistics ontology]]

Ontology:Q28 - Revision history

Reversedragon: Usage notes

Reversedragon: copy or update fake Item from Q25