-
1 рекурсивная грамматика
Русско-английский словарь по вычислительной технике и программированию > рекурсивная грамматика
-
2 рекурсивная грамматика
Русско-английский большой базовый словарь > рекурсивная грамматика
-
3 леворекурсивная грамматика
1) Computers: left-recursive grammar2) Information technology: left recursive grammar, life-recursive grammarУниверсальный русско-английский словарь > леворекурсивная грамматика
-
4 рекурсивный
1. recursive2. recursivelyРусско-английский новый политехнический словарь > рекурсивный
-
5 праворекурсивная грамматика
1) Computers: right-recursive grammar2) Information technology: right recursive grammarУниверсальный русско-английский словарь > праворекурсивная грамматика
-
6 леворекурсивная грамматика
Русско-английский большой базовый словарь > леворекурсивная грамматика
-
7 праворекурсивная грамматика
Русско-английский большой базовый словарь > праворекурсивная грамматика
-
8 рекурсивная грамматика
Information technology: recursive grammarУниверсальный русско-английский словарь > рекурсивная грамматика
-
9 левокурсивная грамматика
Русско-английский словарь по электронике > левокурсивная грамматика
-
10 левокурсивная грамматика
Русско-английский словарь по радиоэлектронике > левокурсивная грамматика
-
11 леворекурсивная грамматика
Русско-английский словарь по вычислительной технике и программированию > леворекурсивная грамматика
-
12 праворекурсивная грамматика
Русско-английский словарь по вычислительной технике и программированию > праворекурсивная грамматика
-
13 gramatyka lewostronnie rekurencyjna
• left-recursive grammarSłownik polsko-angielski dla inżynierów > gramatyka lewostronnie rekurencyjna
-
14 Logic
My initial step... was to attempt to reduce the concept of ordering in a sequence to that of logical consequence, so as to proceed from there to the concept of number. To prevent anything intuitive from penetrating here unnoticed, I had to bend every effort to keep the chain of inference free of gaps. In attempting to comply with this requirement in the strictest possible way, I found the inadequacy of language to be an obstacle. (Frege, 1972, p. 104)I believe I can make the relation of my 'conceptual notation' to ordinary language clearest if I compare it to the relation of the microscope to the eye. The latter, because of the range of its applicability and because of the ease with which it can adapt itself to the most varied circumstances, has a great superiority over the microscope. Of course, viewed as an optical instrument it reveals many imperfections, which usually remain unnoticed only because of its intimate connection with mental life. But as soon as scientific purposes place strong requirements upon sharpness of resolution, the eye proves to be inadequate.... Similarly, this 'conceptual notation' is devised for particular scientific purposes; and therefore one may not condemn it because it is useless for other purposes. (Frege, 1972, pp. 104-105)To sum up briefly, it is the business of the logician to conduct an unceasing struggle against psychology and those parts of language and grammar which fail to give untrammeled expression to what is logical. He does not have to answer the question: How does thinking normally take place in human beings? What course does it naturally follow in the human mind? What is natural to one person may well be unnatural to another. (Frege, 1979, pp. 6-7)We are very dependent on external aids in our thinking, and there is no doubt that the language of everyday life-so far, at least, as a certain area of discourse is concerned-had first to be replaced by a more sophisticated instrument, before certain distinctions could be noticed. But so far the academic world has, for the most part, disdained to master this instrument. (Frege, 1979, pp. 6-7)There is no reproach the logician need fear less than the reproach that his way of formulating things is unnatural.... If we were to heed those who object that logic is unnatural, we would run the risk of becoming embroiled in interminable disputes about what is natural, disputes which are quite incapable of being resolved within the province of logic. (Frege, 1979, p. 128)[L]inguists will be forced, internally as it were, to come to grips with the results of modern logic. Indeed, this is apparently already happening to some extent. By "logic" is not meant here recursive function-theory, California model-theory, constructive proof-theory, or even axiomatic settheory. Such areas may or may not be useful for linguistics. Rather under "logic" are included our good old friends, the homely locutions "and," "or," "if-then," "if and only if," "not," "for all x," "for some x," and "is identical with," plus the calculus of individuals, event-logic, syntax, denotational semantics, and... various parts of pragmatics.... It is to these that the linguist can most profitably turn for help. These are his tools. And they are "clean tools," to borrow a phrase of the late J. L. Austin in another context, in fact, the only really clean ones we have, so that we might as well use them as much as we can. But they constitute only what may be called "baby logic." Baby logic is to the linguist what "baby mathematics" (in the phrase of Murray Gell-Mann) is to the theoretical physicist-very elementary but indispensable domains of theory in both cases. (Martin, 1969, pp. 261-262)There appears to be no branch of deductive inference that requires us to assume the existence of a mental logic in order to do justice to the psychological phenomena. To be logical, an individual requires, not formal rules of inference, but a tacit knowledge of the fundamental semantic principle governing any inference; a deduction is valid provided that there is no way of interpreting the premises correctly that is inconsistent with the conclusion. Logic provides a systematic method for searching for such counter-examples. The empirical evidence suggests that ordinary individuals possess no such methods. (Johnson-Laird, quoted in Mehler, Walker & Garrett, 1982, p. 130)The fundamental paradox of logic [that "there is no class (as a totality) of those classes which, each taken as a totality, do not belong to themselves" (Russell to Frege, 16 June 1902, in van Heijenoort, 1967, p. 125)] is with us still, bequeathed by Russell-by way of philosophy, mathematics, and even computer science-to the whole of twentieth-century thought. Twentieth-century philosophy would begin not with a foundation for logic, as Russell had hoped in 1900, but with the discovery in 1901 that no such foundation can be laid. (Everdell, 1997, p. 184)Historical dictionary of quotations in cognitive science > Logic
См. также в других словарях:
Recursive categorical syntax — Recursive categorical syntax, also sometimes called algebraic syntax, is an algebraic theory of syntax developed by Michael Brame as an alternative to transformational generative grammar. It is a type of dependency grammar, and is related to link … Wikipedia
Recursive descent parser — A recursive descent parser is a top down parser built from a set of mutually recursive procedures (or a non recursive equivalent) where each such procedure usually implements one of the production rules of the grammar. Thus the structure of the… … Wikipedia
Recursive language — This article is about a class of formal languages as they are studied in mathematics and theoretical computer science. For computer languages that allow a function to call itself recursively, see Recursion (computer science). In mathematics,… … Wikipedia
Recursive languages and sets — This article is a temporary experiment to see whether it is feasible and desirable to merge the articles Recursive set, Recursive language, Decidable language, Decidable problem and Undecidable problem. Input on how best to do this is very much… … Wikipedia
Recursive transition network — A recursive transition network ( RTN ) is a graph theoretical schematic used to represent the rules of a context free grammar. RTNs have application to programming languages, natural language and lexical analysis. Any sentence that is constructed … Wikipedia
recursive — adjective Date: 1934 1. of, relating to, or involving recursion < a recursive function in a computer program > 2. of, relating to, or constituting a procedure that can repeat itself indefinitely < a recursive rule in a grammar > • recursively… … New Collegiate Dictionary
recursive — /rəˈkɜsɪv / (say ruh kersiv) adjective 1. of or relating to recursion. 2. permitting or relating to an operation that may be repeated indefinitely, as a rule in generative grammar …
Parsing expression grammar — A parsing expression grammar, or PEG, is a type of analytic formal grammar that describes a formal language in terms of a set of rules for recognizing strings in the language. A parsing expression grammar essentially represents a recursive… … Wikipedia
Adaptive grammar — An adaptive grammar is a formal grammar that explicitly provides mechanisms within the formalism to allow its own production rules to be manipulated. Contents 1 Overview 1.1 Early history 1.2 Collaborative efforts … Wikipedia
Controlled grammar — Controlled grammars[1] are a class of grammars that extend, usually, the context free grammars with additional controls on the derivations of a sentence in the language. A number of different kinds of controlled grammars exist, the four main… … Wikipedia
HEBREW GRAMMAR — The following entry is divided into two sections: an Introduction for the non specialist and (II) a detailed survey. [i] HEBREW GRAMMAR: AN INTRODUCTION There are four main phases in the history of the Hebrew language: the biblical or classical,… … Encyclopedia of Judaism