[sc34wg3] RM: built-in arc, built-in assertion, built-in node, built-in subject

[Patrick Durusau]

REF: parid2124

TXT: built-in arc

FIX: A priori arc
 
COM: The term "a priori" is used to clarify when such arcs will be 
declared. The term "built-in" does not limit its presence to a TM 
Application. The usage here accords with that reported in *Dictionary of 
Philosophy* by Dagobert Runes, 1983, page 31 "...In Kant's doctrine, all 
the necessary conditions of experience (i.e., forms and categories) are 
a priori. Whatever is a priori must possess universal and necessary 
validity..." A priori arcs, nodes, assertions, are required to be 
present in a TM Application as machinery that supports the arcs, nodes 
and assertions found in topic maps.
 
END:



REF: parid2124

TXT: An arc (a connectedness of two nodes) that is one of the arcs that 
comprises a built-in assertion.

FIX: An arc in an a priori assertion.
 
COM: Removed connectedness, a priori assertion and assertion are defined 
elsewhere.
 
END:


REF: parid2127

TXT: built-in assertion

FIX: a priori assertion
 
COM: The term "a priori" is used to clarify when such assertions will be 
made. The term "built-in" does not limit its presence to a TM 
Application. The usage here accords with that reported in *Dictionary of 
Philosophy* by Dagobert Runes, 1983, page 31 "...In Kant's doctrine, all 
the necessary conditions of experience (i.e., forms and categories) are 
a priori. Whatever is a priori must possess universal and necessary 
validity..." A priori arcs, nodes, assertions, are required to be 
present in a TM Application as machinery that supports the arcs, nodes 
and assertions found in topic maps.
 
END:


REF: parid2128

TXT: An assertion that is defined by the TM Application as being present 
in every topic map graph that conforms to that TM Application. TM 
Applications generally define built-in assertions for bootstrapping 
purposes and/or for allowing the topic maps that conform to them to 
incorporate the subjects defined in the TM Application definition, thus 
allowing such topic maps to be self-describing. The nodes that 
participate in built-in assertions have built-in property values that 
correspond to their arcs, and built-in values for their subject identity 
discrimination properties (SIDPs) such that the merging of the built-in 
assertions in conformance with the assertion merging rules specified in 
[parid0374] 5.2.8.2 will occur.

FIX: An assertion that is defined by a TM Application.
 
COM: The reasons for a term should not be covered in a glossary entry. 
One assumes the reader is reading about the term elsewhere and is 
seeking a definition, not further discussion.
 
END:


REF: parid2130

TXT: built-in node

FIX: a priori node
 
COM: see comment to parid2124
 
END:


REF: parid2131

TXT: A node that is defined by a TM Application as being present in 
every topic map graph that conforms to the TM Application. Every 
built-in node must be defined as having a built-in value for at least 
one SIDP.

FIX: A node that is defined by a TM Application.
 
COM: The reasons for a term should not be covered in a glossary entry. 
One assumes the reader is reading about the term elsewhere and is 
seeking a definition, not further discussion.
 
END:


REF: parid2133

TXT: built-in subject

FIX: a priori subject
 
COM: see comment to parid2124
 
END:


REF: parid2134

TXT: The subject of a built-in node

FIX: The subject of an a priori node.
 
COM: Conformance to "a priori" terminology.
 
END:

-- 
Patrick Durusau
Director of Research and Development
Society of Biblical Literature
pdurusau@emory.edu
Co-Editor, ISO Reference Model for Topic Maps