- syntactic equivalence
- мат. синтаксическая эквивалентность
Большой англо-русский и русско-английский словарь. 2001.
syntactic equivalence
Смотреть что такое "syntactic equivalence" в других словарях:
Syntactic monoid — In mathematics, the syntactic monoid M ( L ) of a formal language L is the smallest monoid that recognizes the language L .yntactic quotientGiven Ssubset M a subset of a monoid M , one may define sets that consist of formal left or right inverses … Wikipedia
linguistics — /ling gwis tiks/, n. (used with a sing. v.) the science of language, including phonetics, phonology, morphology, syntax, semantics, pragmatics, and historical linguistics. [1850 55; see LINGUISTIC, ICS] * * * Study of the nature and structure of… … Universalium
Concept programming — is a programming paradigm focusing on how concepts, that live in the programmer s head, translate into representations that are found in the code space. This approach was introduced in 2001 by Christophe de Dinechin with the XL Programming… … Wikipedia
PROSODY, HEBREW — This article is a survey of the history of Hebrew poetic forms from the Bible to the present time. The entry is arranged according to the following outline: introduction the variety of formal systems the specific nature of hebrew literary history … Encyclopedia of Judaism
metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… … Universalium
Metamath — Developer(s) Norman Megill Written in C Operating system … Wikipedia
Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… … Wikipedia
Dyck language — In the theory of formal languages of computer science, mathematics, and linguistics, the Dyck language is the language consisting of balanced strings of parentheses [ and ]. It is important in the parsing of expressions that must have a correctly … Wikipedia
Consistency — For other uses, see Consistency (disambiguation). In logic, a consistent theory is one that does not contain a contradiction.[1] The lack of contradiction can be defined in either semantic or syntactic terms. The semantic definition states that a … Wikipedia
Code-switching — This article is about the use of more than one language in speech. For the use of multiple languages in writing, see Macaronic language. Sociolinguistics Areas of study … Wikipedia
Common knowledge (logic) — For common knowledge in general, see Common knowledge. Common knowledge is a special kind of knowledge for a group of agents. There is common knowledge of p in a group of agents G when all the agents in G know p, they all know that they know p,… … Wikipedia
