This page is part of the HL7 Terminology (v5.2.0: Release) based on FHIR R4. This is the current published version in its permanent home (it will always be available at this URL). For a full list of available versions, see the Directory of published versions
Active as of 2019-03-20 |
<CodeSystem xmlns="http://hl7.org/fhir">
<id value="v3-RelationshipConjunction"/>
<language value="en"/>
<text>
<status value="generated"/>
<div xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en"><p><b>Properties</b></p><p><b>This code system defines the following properties for its concepts</b></p><table class="grid"><tr><td><b>Code</b></td><td><b>URI</b></td><td><b>Type</b></td><td><b>Description</b></td></tr><tr><td>Specializes</td><td/><td>Coding</td><td>The child code is a more narrow version of the concept represented by the parent code. I.e. Every child concept is also a valid parent concept. Used to allow determination of subsumption. Must be transitive, irreflexive, antisymmetric.</td></tr><tr><td>Generalizes</td><td/><td>Coding</td><td>Inverse of Specializes. Only included as a derived relationship.</td></tr><tr><td>internalId</td><td>http://terminology.hl7.org/CodeSystem/utg-concept-properties#v3-internal-id</td><td>code</td><td>The internal identifier for the concept in the HL7 Access database repository.</td></tr><tr><td>status</td><td>http://hl7.org/fhir/concept-properties#status</td><td>code</td><td>Designation of a concept's state. Normally is not populated unless the state is retired.</td></tr></table><p><b>Concepts</b></p><p>This code system <code>http://terminology.hl7.org/CodeSystem/v3-RelationshipConjunction</code> defines the following codes:</p><table class="codes"><tr><td style="white-space:nowrap"><b>Code</b></td><td><b>Display</b></td><td><b>Definition</b></td><td><b>internalId</b></td><td><b>status</b></td></tr><tr><td style="white-space:nowrap">AND<a name="v3-RelationshipConjunction-AND"> </a></td><td>and</td><td>This condition must be true.</td><td>10366</td><td>active</td></tr><tr><td style="white-space:nowrap">OR<a name="v3-RelationshipConjunction-OR"> </a></td><td>or</td><td>At least one of the condition among all OR conditions must be true.</td><td>10367</td><td>active</td></tr><tr><td style="white-space:nowrap">XOR<a name="v3-RelationshipConjunction-XOR"> </a></td><td>exclusive or</td><td>One and only one of the XOR conditions must be true.</td><td>10368</td><td>active</td></tr></table></div>
</text>
<url
value="http://terminology.hl7.org/CodeSystem/v3-RelationshipConjunction"/>
<identifier>
<system value="urn:ietf:rfc:3986"/>
<value value="urn:oid:2.16.840.1.113883.5.106"/>
</identifier>
<version value="2.1.1"/>
<name value="RelationshipConjunction"/>
<title value="RelationshipConjunction"/>
<status value="active"/>
<experimental value="false"/>
<date value="2019-03-20"/>
<publisher value="Health Level 7"/>
<contact>
<name value="Health Level Seven"/>
</contact>
<description
value="A code specifying the logical conjunction of the criteria among all the condition-links of Acts (e.g., and, or, exclusive-or.)
*Constraints:* All AND criteria must be true. If OR and AND criteria occur together, one criterion out of the OR-group must be true and all AND criteria must be true also. If XOR criteria occur together with OR and AND criteria, exactly one of the XOR criteria must be true, and at least one of the OR criteria and all AND criteria must be true. In other words, the sets of AND, OR, and XOR criteria are in turn combined by a logical AND operator (all AND criteria and at least one OR criterion and exactly one XOR criterion.) To overcome this ordering, Act criteria can be nested in any way necessary."/>
<caseSensitive value="true"/>
<hierarchyMeaning value="is-a"/>
<content value="complete"/>
<property>
<extension
url="http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-symmetry">
<valueCode value="antisymmetric"/>
</extension>
<extension
url="http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-transitivity">
<valueCode value="transitive"/>
</extension>
<extension
url="http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-reflexivity">
<valueCode value="irreflexive"/>
</extension>
<extension
url="http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-isNavigable">
<valueBoolean value="true"/>
</extension>
<extension
url="http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-relationshipKind">
<valueCode value="Specializes"/>
</extension>
<extension
url="http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-inverseName">
<valueString value="Generalizes"/>
</extension>
<code value="Specializes"/>
<description
value="The child code is a more narrow version of the concept represented by the parent code. I.e. Every child concept is also a valid parent concept. Used to allow determination of subsumption. Must be transitive, irreflexive, antisymmetric."/>
<type value="Coding"/>
</property>
<property>
<extension
url="http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-symmetry">
<valueCode value="antisymmetric"/>
</extension>
<extension
url="http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-transitivity">
<valueCode value="transitive"/>
</extension>
<extension
url="http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-reflexivity">
<valueCode value="irreflexive"/>
</extension>
<extension
url="http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-isNavigable">
<valueBoolean value="true"/>
</extension>
<extension
url="http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-relationshipKind">
<valueCode value="Generalizes"/>
</extension>
<extension
url="http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-inverseName">
<valueString value="Specializes"/>
</extension>
<code value="Generalizes"/>
<description
value="Inverse of Specializes. Only included as a derived relationship."/>
<type value="Coding"/>
</property>
<property>
<code value="internalId"/>
<uri
value="http://terminology.hl7.org/CodeSystem/utg-concept-properties#v3-internal-id"/>
<description
value="The internal identifier for the concept in the HL7 Access database repository."/>
<type value="code"/>
</property>
<property>
<code value="status"/>
<uri value="http://hl7.org/fhir/concept-properties#status"/>
<description
value="Designation of a concept's state. Normally is not populated unless the state is retired."/>
<type value="code"/>
</property>
<concept>
<code value="AND"/>
<display value="and"/>
<definition value="This condition must be true."/>
<property>
<code value="status"/>
<valueCode value="active"/>
</property>
<property>
<code value="internalId"/>
<valueCode value="10366"/>
</property>
</concept>
<concept>
<code value="OR"/>
<display value="or"/>
<definition
value="At least one of the condition among all OR conditions must be true."/>
<property>
<code value="status"/>
<valueCode value="active"/>
</property>
<property>
<code value="internalId"/>
<valueCode value="10367"/>
</property>
</concept>
<concept>
<code value="XOR"/>
<display value="exclusive or"/>
<definition value="One and only one of the XOR conditions must be true."/>
<property>
<code value="status"/>
<valueCode value="active"/>
</property>
<property>
<code value="internalId"/>
<valueCode value="10368"/>
</property>
</concept>
</CodeSystem>
IG © 2020+ HL7 International - Vocabulary Work Group. Package hl7.terminology#5.2.0 based on FHIR 4.0.1. Generated 2023-07-17
Links: Table of Contents |
QA Report
| Version History |
|
Propose a change