e/Tuple relational calculus

Information
has gloss	eng: The tuple calculus is a calculus that was introduced by Edgar F. Codd as part of the relational model in order to give a declarative database query language for this data model. It formed the inspiration for the database query languages QUEL and SQL of which the latter, although far less faithful to the original relational model and calculus, is now used in almost all relational database management systems as the ad-hoc query language. Lacroix and Pirotte proposed domain calculus, which is closer to first-order logic and showed that these two calculi (and the relational algebra) are equivalent in expressive power. Subsequently query languages for the relational model were called relationally complete if they could express at least all these queries.
lexicalization	eng: Tuple Relational Calculus
instance of	c/Logical calculi

Meaning
Italian
has gloss	ita: In informatica, in particolare nella teoria delle basi di dati, una tupla è un generico elemento di una relazione con attributi in un database relazionale. Essa rappresenta l'entità base che deve essere memorizzata nella base di dati.
lexicalization	ita: tupla
Russian
has gloss	rus: Исчисление кортежей — направление реляционного исчисления, где областями определения переменных являются тела отношений базы данных, то есть допустимым значением каждой переменной является кортеж тела некоторого отношения.
lexicalization	rus: Исчисление кортежей
Chinese
has gloss	zho: 元组演算是埃德加·科德做为关系模型的一部分而介入的演算，目的是给予这个数据模型一种声明性数据库查询语言。它给予数据库查询语言 QUEL 和后来的 SQL 以灵感，尽管 SQL 很少忠实于最初的关系模型和演算，它现在被用于几乎所有的关系数据库管理系统中作为事实标准查询语言。与元组演算一起，Codd 还介入了更接近于一阶逻辑的域演算，并证明了这两种演算(和关系代数)在表达能力上是等价的。后来的关系数据库的查询语言被称为“关系完备性”的，如果它们可以表达至少其中一种查询。
lexicalization	zho: 元组关系演算