Computability, complexity, logic /

The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems. Th...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: B�orger, E. (Egon), 1946-
Formato: Electrónico eBook
Idioma:Inglés
Alemán
Publicado: Amsterdam ; New York : New York, N.Y., U.S.A. North-Holland ; Distributors for the U.S.A. and Canada : Elsevier Science Pub. Co., 1989.
Colección:Studies in logic and the foundations of mathematics ; v. 128.
Temas:
Computable functions.
Computational complexity.
Logic, Symbolic and mathematical.
Fonctions calculables.
Complexit�e de calcul (Informatique)
Logique symbolique et math�ematique.
MATHEMATICS > Infinity.
MATHEMATICS > Logic.
Computable functions
Computational complexity
Logic, Symbolic and mathematical
Acceso en línea:Texto completo
Texto completo
Texto completo

MARC

LEADER 00000cam a2200000 a 4500
001 SCIDIR_ocn316571944
003 OCoLC
005 20231117015257.0
006 m o d
007 cr cn|||||||||
008 090320s1989 ne a ob 001 0 eng d
010 |z  89033636  
040 |a OPELS  |b eng  |e pn  |c OPELS  |d OPELS  |d OCLCQ  |d OCLCF  |d OCLCO  |d DEBBG  |d N$T  |d IDEBK  |d E7B  |d MERUC  |d YDXCP  |d OCLCQ  |d COO  |d OCLCQ  |d DEBSZ  |d OCLCQ  |d LEAUB  |d INARC  |d S2H  |d OCLCO  |d OCLCQ  |d COA  |d OCLCO 
019 |a 309296358  |a 646775824  |a 742293103  |a 815691226  |a 823118351  |a 823839012  |a 823907388  |a 824096684  |a 824149473  |a 1148586052  |a 1340055923 
020 |a 9780444874061 
020 |a 0444874062 
020 |a 9780080887043  |q (electronic bk.) 
020 |a 008088704X  |q (electronic bk.) 
020 |a 128179063X 
020 |a 9781281790637 
024 8 |a (WaSeSS)ssj0000127527 
035 |a (OCoLC)316571944  |z (OCoLC)309296358  |z (OCoLC)646775824  |z (OCoLC)742293103  |z (OCoLC)815691226  |z (OCoLC)823118351  |z (OCoLC)823839012  |z (OCoLC)823907388  |z (OCoLC)824096684  |z (OCoLC)824149473  |z (OCoLC)1148586052  |z (OCoLC)1340055923 
041 0 |a eng  |a ger 
050 4 |a QA9.59  |b .B6713 1989eb 
072 7 |a MAT  |x 016000  |2 bisacsh 
072 7 |a MAT  |x 018000  |2 bisacsh 
072 7 |a PBC  |2 bicssc 
082 0 4 |a 511.3  |2 22 
100 1 |a B�orger, E.  |q (Egon),  |d 1946- 
240 1 0 |a Berechenbarkeit, Komplexit�at, Logik.  |l English 
245 1 0 |a Computability, complexity, logic /  |c E. B�orger. 
260 |a Amsterdam ;  |a New York :  |b North-Holland ;  |a New York, N.Y., U.S.A.  |b Distributors for the U.S.A. and Canada :  |b Elsevier Science Pub. Co.,  |c 1989. 
300 |a 1 online resource (xx, 592 pages) :  |b illustrations 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |2 rdaft  |0 http://rdaregistry.info/termList/fileType/1002. 
490 1 |a Studies in logic and the foundations of mathematics ;  |v v. 128 
520 |a The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems. The book is a unified introduction to the modern theory of these concepts, to the way in which they developed first in mathematical logic and computability theory and later in automata theory, and to the theory of formal languages and complexity theory. Apart from considering the fundamental themes and classical aspects of these areas, the subject matter has been selected to give priority throughout to the new aspects of traditional questions, results and methods which have developed from the needs or knowledge of computer science and particularly of complexity theory. It is both a textbook for introductory courses in the above-mentioned disciplines as well as a monograph in which further results of new research are systematically presented and where an attempt is made to make explicit the connections and analogies between a variety of concepts and constructions. 
500 |a Translation of: Berechenbarkeit, Komplexit�at, Logik. 
504 |a Includes bibliographical references (pages 529-573) and index. 
588 0 |a Print version record. 
505 0 |a Front Cover; Computability, Complexity, Logic; Copyright Page; Contents; Graph of dependencies; Introduction; Terminology and prerequisites; SECTION I: BOOK ONE ELEMENTARY THEORY OF COMPUTATION; SECTION II: BOOK TWO ELEMENTARY PREDICATE LOGIC; Bibliography; Index; List of symbols. 
650 0 |a Computable functions. 
650 0 |a Computational complexity. 
650 0 |a Logic, Symbolic and mathematical. 
650 6 |a Fonctions calculables.  |0 (CaQQLa)201-0078765 
650 6 |a Complexit�e de calcul (Informatique)  |0 (CaQQLa)201-0068287 
650 6 |a Logique symbolique et math�ematique.  |0 (CaQQLa)201-0001166 
650 7 |a MATHEMATICS  |x Infinity.  |2 bisacsh 
650 7 |a MATHEMATICS  |x Logic.  |2 bisacsh 
650 7 |a Computable functions  |2 fast  |0 (OCoLC)fst00871985 
650 7 |a Computational complexity  |2 fast  |0 (OCoLC)fst00871991 
650 7 |a Logic, Symbolic and mathematical  |2 fast  |0 (OCoLC)fst01002068 
650 7 |a Fonctions calculables.  |2 ram 
650 7 |a Complexit�e de calcul (Informatique)  |2 ram 
650 7 |a Logique symbolique et math�ematique.  |2 ram 
776 0 8 |i Print version:  |a B�orger, E. (Egon), 1946-  |s Berechenbarkeit, Komplexit�at, Logik. English.  |t Computability, complexity, logic.  |d Amsterdam ; New York : North-Holland ; New York, N.Y., U.S.A. Distributors for the U.S.A. and Canada : Elsevier Science Pub. Co., 1989  |z 0444874062  |z 9780444874061  |w (DLC) 89033636  |w (OCoLC)19722785 
830 0 |a Studies in logic and the foundations of mathematics ;  |v v. 128. 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/book/9780444874061  |z Texto completo 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/publication?issn=0049237X&volume=128  |z Texto completo 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/bookseries/0049237X/128  |z Texto completo 

Ejemplares similares