User:Daniel/Sandbox: Difference between revisions

From MaRDI portal
Line 22: Line 22:
* [[:wikidata:Q5508975|fundamental theorem of linear algebra (Q5508975)]]
* [[:wikidata:Q5508975|fundamental theorem of linear algebra (Q5508975)]]
* [[:wikidata:Q17015004|fundamental theorem of algebraic K-theory (Q17015004)]]
* [[:wikidata:Q17015004|fundamental theorem of algebraic K-theory (Q17015004)]]
=== To Wikipedia ===
* [[:wikipedia:pt:Wikipédia:GLAM/CEPID_NeuroMat]]
** [[:wikipedia:pt:Wikipédia:GLAM/CEPID NeuroMat/Participantes/Atividade1|author disambiguation page]]


=== To Wikiversity ===
=== To Wikiversity ===

Revision as of 19:38, 29 November 2022

This page is for test edits and unsorted notes.

NFDI interactions

Interwiki links

To Wikidata

Properties

Existing properties
Proposed properties

Items

To Wikipedia

To Wikiversity

Math-related lexemes

Lexeme challenges

  • Numbers (5/n): mathematics (Q395), algebra (Q3968), arithmetic (Q11205), 19 (Q39850), 20 (Q40292), 30 (Q42817), 40 (Q42317)
  • Numbers (4/n): equation (Q11345), square (Q111124), square root (Q134237), 14 (Q38582), 16 (Q40254), 17 (Q40118), 18 (Q38712)
  • Numbers (3/n): multiplication (Q40276), division (Q1226939), 10 (Q23806), 11 (Q37136), 12 (Q36977), 13 (Q37141), 15 (Q38701)
  • Numbers (2/n): addition (Q32043), subtraction (Q40754), 5 (Q203), 6 (Q23488), 7 (Q23350), 8 (Q23355), 9 (Q19108)
  • Numbers (1/n): number (Q11563), numerical digit (Q82990), zero (Q204), 1 (Q199), 2 (Q200), 3 (Q201), 4 (Q202)

Math videos

Math & biology

  • RCC-5 classification
Merging taxonomies under RCC-5 algebraic articulations (Q114740027): "CLEANTAX uses the RCC-5 [Randell et al. 1992] topological algebra as the basis for representing articulations. This algebra describes relationships between sets, and supports the expression of incomplete knowledge when stating articulations. The RCC-5 algebra uses the same five basic relations (B5) as several biological taxonomic alignments and taxonomic reasoning systems [Berendsohn 2003; Koperski et al. 2000; Franz et al. 2007]. Given any two non-empty sets N and M, exactly one of the B5 relations holds (cf. Figure 5) between them: (i) congruence (N ≡ M), (ii) proper inclusion (N # M), (iii) proper inverse inclusion (N ! M), (iv) partial overlap (N ⊕ M), or (v) exclusion (disjointness) (N ! M)."

Math & politics