语法和语义 毕业论文外文翻译.doc

外文文献译文syntax and semanticsa formal language usually requires a set of formation rulesi.e., a complete specification of the kinds of expressions that shall count as well-formed formulas (sentences or meaningful expressions), applicable mechanically, in the sense that a machine could check whether a candidate satisfies the requirements. this specification usually contains three parts: (1) a list of primitive symbols (basic units) given mechanically, (2) certain combinations of these symbols, singled out mechanically as forming the simple (atomic) sentences, and (3) a set of inductive clauses inductive inasmuch as they stipulate that natural combinations of given sentences formed by such logical connectives as the disjunction “or,” which is symbolized “”; “not,” symbolized “”; and “for all ,” symbolized “(),” are again sentences. “()” is called a quantifier, as is also “there is some ,” symbolized “()”. since these specifications are concerned only with symbols and their combinations and not with meanings, they involve only the syntax of the language.an interpretation of a formal language is determined by formulating an interpretation of the atomic sentences of the language with regard to a domain of objects., by stipulating which objects of the domain are denoted by which constants of the language and which relations and functions are denoted by which predicate letters and function symbols. the truth-value (whether “true” or “false”) of every sentence is thus determined according to the standard interpretation of logical connectives. for example, p q is true if and only if p and q are true. (here, the dot means the conjunction “and,” not the multiplication operation “times.”) thus, given any interpretation of a formal language, a formal concept of truth is obtained. truth, meaning, and denotation are semantic concepts.if, in addition, a formal system in a formal language is introduced, certain syntactic concepts arise namely, axioms, rules of inference, and theorems. certain sentences are singled out as axioms. these are (the basic) theorems. each rule of inference is an inductive clause, stating that, if certain sentences are the orems, then another sentence related to them in a suitable way is also atheorem. if p and “either not-p or q” (p q) are theorems, for example, then q is a theorem. in general, a theorem is either an axiom or the conclusion of a rule of inference whose premises are theorems.in 1931 gdel made the fundamental discovery that, in most of the interesting (or significant) formal systems, not all true sentences are theorems. it follows from this finding that semantics cannot be reduced to syntax; thus syntax, which is closely related to proof theory, must often be distinguished from semantics, which is closely related to model theory. roughly speaking, syntax，as conceived in the philosophy of mathematics，is a branch of number theory, and semantics is a branch of set theory, which deals with the nature and relations of aggregates.historically, as logic and axiomatic systems became more and more exact, there emerged, in response to a desire for greater lucidity, a tendency to pay greater attention to the syntactic features of the languages employed rather than to concentrate exclusively on intuitive meanings. in this way, logic, the axiomatic method (such as that employed in geometry), and semiotic (the general science of signs) converged toward metalogic.truth definition of the given languagethe formal system n admits of different interpretations, according to findings of gdel (from 1931) and of the norwegian mathematician thoralf skolem, a pioneer in metalogic (from 1933). the originally intended, or standard, interpretation takes the ordinary nonnegativeintegers 0, 1, 2, . . . as the domain, the symbols 0 and 1 as denoting zero and one, and the symbols + and as standing for ordinary addition and multiplication. relative to this interpretation, itis possible to give a truth definition of the language of n.it is necessary first to distinguish between open and closed sentences. an open sentence, such as x = 1, is one that may be either true or false depending on the value of x, but a closed sentence, such as 0 = 1 and (x) (x = 0) or “all xs are zero,” is one that has a definite truth-valuein this case, false (in the intended interpretation).1. a closed atomic sentence is true if and only if it is true in the intuitive sense; for example, 0 = 0 istrue, 0 + 1 = 0 is false.this specification as it stands is not syntactic, but, with some care, it is possible to give an explicit and mechanical specification of those closed atomic sentences that are true in the intuitive sense.2. a closed sentence a is true if and only if a is not true.3. a closed sentence a b is true if and only if either a or b is true.4. a closed sentence ()a() is true if and only if a() is true for every value of i.e., if a(0), a(1), a(1 + 1), . . . are all true.the above definition of truth is not an explicit definition; it is an inductive one. using concepts fromset theory, however, it is possible to obtain an explicit definition that yields a set of sentences that consists of all the true ones and only them. if gdels method of representing symbols and sentences by numbers is employed, it is then possible to obtain in set theory a set of natural numbers that are just the gdel numbers of the true sentences of n.there is a definite sense in which it is impossible to define the concept of truth within a language itself. this is proved by the liar paradox: if the sentence “i am lying,” or alternatively(1) this sentence is not true.is considered, it is clearsince (1) is “this sentence”that if (1) is true, then (1) is false; on the other hand, if (1) is false, then (1) is true. in the case of the system n, if the concept of truth were definable in the system itself, then (using a device invented by gdel) it would be possible to obtain in“ n ”a sentence that amounts to (1) and that thereby yields a contradiction.外文文献原文语法和语义一份正式的语言通常需要一套形成,齐全的规格的种类中,作为规范的表达方式,要计算公式(句子或有意义的表达),适用的机械,在这个意义上说,机器就会检查是否满足要求的候选人。本规格书通常包含三个部分:(1)一个列表的原始的符号(基本单元)给机械,(2)特定的组合,这些符号,特别强调了机械成形(原子)的简单句子,以及(3)一组感应条款-感应鉴于二者规定自然的组合形成的语态句这样的逻辑篇章脱节.因为这些规格是只关心与符号及其组合,而不是与意义,他们仅仅包括语法的语言。语言的一个解释是由一个正式制定的解释语言的原子句关于某个领域的objects.,通过规定哪些物体的领域得到用这常数之语言与这关系和功能是通过引入,谓词的字母和功能的符号。(是否的应着重于“对”或“否”)的每一个句子是按照这样的标准解释逻辑篇章。例如,p问是真的,当且仅当p和q是真实的。(在这里,点手段的结合”,“不是一个令人讨厌的乘法运算”的时代。)因此,给出任何解释一套正式的语言,一种是真理的形式概念设计提供了依据。真理、意义以及外延是语义的概念。此外,如果一个正式的制度形式语言的概念,介绍了某种特定的句法规则,公理,即产生的推论,和定理。某些句子都是选作公理系统。这些都是(基本)定理。每一个规则的推理是一种感应条款,说明,如果某些句子相似定理,然后另一个句子与他们相关的是在一种合适的方式也atheorem。如果p和q”或“要么not-pp(q)是定理,举个例子,然后问是一个定理。一般来说,一个定理要么是一个公理或结论法治的推理的前提定理。1931年哥德尔做出了基本的发现,在大部分的有趣(或重要)正规制度,并不是所有真正的句子都是定理。有发现,不可能被简化到句法语义语法,这是,因此密切相关理论,常常需要证明,这是区别于语义模型理论密切相关。大致来说,语法,作为孕育于哲学的一个分支,是数学数论、和语义集合论的一个分支,这涉及到自然及两者的关系蕴。从历史上看,逻辑和公理系统变得越来越精确,出现了,这是为了回应明朗了,想要更多地倾向于更加关注人的句法特点的语言雇佣而不是专注于直观的意义。通过这种方式,逻辑,在公理化方法(如,雇用了几何),和符号(一般科学向元逻辑)聚合的迹象。给定语言的真理定义正式制度n承认的不同的解释,根据调查结果,从1931年拍摄)和哥德尔(挪威数学家thoralf先驱、斯柯林元逻辑(从1933年