Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
A Course in Mathematical Logic / Yu. I. Manin ; Translated from the Russian by Neal Koblitz
| A Course in Mathematical Logic / Yu. I. Manin ; Translated from the Russian by Neal Koblitz |
| Autore | Manin, Yuri I. |
| Pubbl/distr/stampa | New York, : Springer, 1977 |
| Descrizione fisica | xiii, 288 p. : ill. ; 24 cm |
| Soggetto topico |
03-XX - Mathematical logic and foundations [MSC 2020]
03B10 - Classical first-order logic [MSC 2020] 03D20 - Recursive functions and relations, subrecursive hierarchies [MSC 2020] 03D80 - Applications of computability and recursion theory [MSC 2020] 03E50 - Continuum hypothesis and Martin's axiom [MSC 2020] 03Fxx - Proof theory and constructive mathematics [MSC 2020] 03G12 - Quantum logic [MSC 2020] 11Uxx - Connections of number theory and logic [MSC 2020] 20A15 - Applications of logic to group theory [MSC 2020] |
| Soggetto non controllato |
Boundary Element Methods
Computability Forcing Formal Languages Forms Functions Language Logic Mathematical logic Mathematics Presentations Theory of complexity |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. This book is above all addressed to mathematicians. It is intended to be a textbook of mathematical logic on a sophisticated level, presenting the reader with several of the most significant discoveries of the last ten or fifteen years. These include: the independence of the continuum hypothe sis, the Diophantine nature of enumerable sets, the impossibility of finding an algorithmic solution for one or two old problems. All the necessary preliminary material, including predicate logic and the fundamentals of recursive function theory, is presented systematically and with complete proofs. We only assume that the reader is familiar with "naive" set theoretic arguments. In this book mathematical logic is presented both as a part of mathe matics and as the result of its self-perception. Thus, the substance of the book consists of difficult proofs of subtle theorems, and the spirit of the book consists of attempts to explain what these theorems say about the mathematical way of thought. Foundational problems are for the most part passed over in silence. Most likely, logic is capable of justifying mathematics to no greater extent than biology is capable of justifying life. 2. The first two chapters are devoted to predicate logic. The presenta tion here is fairly standard, except that semantics occupies a very domi nant position, truth is introduced before deducibility, and models of speech in formal languages precede the systematic study of syntax. |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00268046 |
Manin, Yuri I.
|
||
| New York, : Springer, 1977 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
A Programming Approach to Computability / A. J. Kfoury, Robert N. Moll, Michael A. Arbib
| A Programming Approach to Computability / A. J. Kfoury, Robert N. Moll, Michael A. Arbib |
| Autore | Kfoury, Assaf J. |
| Pubbl/distr/stampa | New York, : Springer-Verlag, 1982 |
| Descrizione fisica | viii, 251 p. : ill. ; 24 cm |
| Altri autori (Persone) |
Arbib, Michael A.
Moll, Robert N. |
| Soggetto topico |
68-XX - Computer science [MSC 2020]
03-XX - Mathematical logic and foundations [MSC 2020] 03D80 - Applications of computability and recursion theory [MSC 2020] 68N01 - General topics in the theory of software [MSC 2020] 03D60 - Computability and recursion theory on ordinals, admissible sets, etc. [MSC 2020] |
| Soggetto non controllato |
Algorithms
Classification Computability theory Formal languages Predictability Programming |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0268469 |
|
Kfoury, Assaf J.
|
||
| New York, : Springer-Verlag, 1982 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
A Programming Approach to Computability / A. J. Kfoury, Robert N. Moll, Michael A. Arbib
| A Programming Approach to Computability / A. J. Kfoury, Robert N. Moll, Michael A. Arbib |
| Autore | Kfoury, Assaf J. |
| Pubbl/distr/stampa | New York, : Springer-Verlag, 1982 |
| Descrizione fisica | viii, 251 p. : ill. ; 24 cm |
| Altri autori (Persone) |
Arbib, Michael A.
Moll, Robert N. |
| Soggetto topico |
03-XX - Mathematical logic and foundations [MSC 2020]
03D60 - Computability and recursion theory on ordinals, admissible sets, etc. [MSC 2020] 03D80 - Applications of computability and recursion theory [MSC 2020] 68-XX - Computer science [MSC 2020] 68N01 - General topics in the theory of software [MSC 2020] |
| Soggetto non controllato |
Algorithms
Classification Computability Theory Formal Languages Predictability Programming |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computability theory is at the heart of theoretical computer science. Yet, ironically, many of its basic results were discovered by mathematical logicians prior to the development of the first stored-program computer. As a result, many texts on computability theory strike today's computer science students as far removed from their concerns. To remedy this, we base our approach to computability on the language of while-programs, a lean subset of PASCAL, and postpone consideration of such classic models as Turing machines, string-rewriting systems, and p. -recursive functions till the final chapter. Moreover, we balance the presentation of un solvability results such as the unsolvability of the Halting Problem with a presentation of the positive results of modern programming methodology, including the use of proof rules, and the denotational semantics of programs. Computer science seeks to provide a scientific basis for the study of information processing, the solution of problems by algorithms, and the design and programming of computers. The last 40 years have seen increasing sophistication in the science, in the microelectronics which has made machines of staggering complexity economically feasible, in the advances in programming methodology which allow immense programs to be designed with increasing speed and reduced error, and in the develop ment of mathematical techniques to allow the rigorous specification of program, process, and machine. |
| Record Nr. | UNICAMPANIA-VAN00268469 |
|
Kfoury, Assaf J.
|
||
| New York, : Springer-Verlag, 1982 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Computability in analysis and physics / Marian B. Pour-El, J. Ian Richards
| Computability in analysis and physics / Marian B. Pour-El, J. Ian Richards |
| Autore | Pour-El, Marian B. |
| Pubbl/distr/stampa | Berlin, : Springer-Verlag, 1989 |
| Descrizione fisica | X, 206 p. : ill. ; 25 cm. |
| Altri autori (Persone) | Richards, Jonathan I. |
| Soggetto topico |
03D80 - Applications of computability and recursion theory [MSC 2020]
03F60 - Constructive and recursive analysis [MSC 2020] |
| ISBN |
35-405-0035-9
978-03-87500-35-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-SUN0022181 |
|
Pour-El, Marian B.
|
||
| Berlin, : Springer-Verlag, 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Computability in analysis and physics / Marian B. Pour-El, J. Ian Richards
| Computability in analysis and physics / Marian B. Pour-El, J. Ian Richards |
| Autore | Pour-El, Marian B. |
| Pubbl/distr/stampa | Berlin, : Springer-Verlag, 1989 |
| Descrizione fisica | X, 206 p. : ill. ; 25 cm |
| Altri autori (Persone) | Richards, Jonathan I. |
| Soggetto topico |
03D80 - Applications of computability and recursion theory [MSC 2020]
03F60 - Constructive and recursive analysis [MSC 2020] |
| ISBN |
35-405-0035-9
978-03-87500-35-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0022181 |
|
Pour-El, Marian B.
|
||
| Berlin, : Springer-Verlag, 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Computability in analysis and physics / Marian B. Pour-El, J. Ian Richards
| Computability in analysis and physics / Marian B. Pour-El, J. Ian Richards |
| Autore | Pour-El, Marian B. |
| Pubbl/distr/stampa | Berlin, : Springer, 1989 |
| Descrizione fisica | X, 206 p. : ill. ; 25 cm |
| Altri autori (Persone) | Richards, J. Ian |
| Soggetto topico |
03D80 - Applications of computability and recursion theory [MSC 2020]
03F60 - Constructive and recursive analysis [MSC 2020] |
| ISBN |
35-405-0035-9
978-03-87500-35-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00022181 |
|
Pour-El, Marian B.
|
||
| Berlin, : Springer, 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Existentially closed Groups / Graham Higman, Elizabeth Scott
| Existentially closed Groups / Graham Higman, Elizabeth Scott |
| Autore | Higman, Graham |
| Pubbl/distr/stampa | New York, : Clarendon ; Oxford university, 1988 |
| Descrizione fisica | XIV, 156 p. ; 24 cm. |
| Altri autori (Persone) | Scott, Elizabeth |
| Soggetto topico |
20-XX - Group theory and generalizations [MSC 2020]
20F10 - Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) [MSC 2020] 20F05 - Generators, relations, and presentations of groups [MSC 2020] 03C60 - Model-theoretic algebra [MSC 2020] 20E34 - General structure theorems of groups [MSC 2020] 03D80 - Applications of computability and recursion theory [MSC 2020] 20A15 - Applications of logic to group theory [MSC 2020] |
| ISBN |
01-985354-3-0
978-01-985354-3-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-SUN0056280 |
|
Higman, Graham
|
||
| New York, : Clarendon ; Oxford university, 1988 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Existentially closed Groups / Graham Higman, Elizabeth Scott
| Existentially closed Groups / Graham Higman, Elizabeth Scott |
| Autore | Higman, Graham |
| Pubbl/distr/stampa | New York, : Clarendon ; Oxford university, 1988 |
| Descrizione fisica | XIV, 156 p. ; 24 cm |
| Altri autori (Persone) | Scott, Elizabeth |
| Soggetto topico |
20-XX - Group theory and generalizations [MSC 2020]
20F10 - Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) [MSC 2020] 20F05 - Generators, relations, and presentations of groups [MSC 2020] 03C60 - Model-theoretic algebra [MSC 2020] 20E34 - General structure theorems of groups [MSC 2020] 03D80 - Applications of computability and recursion theory [MSC 2020] 20A15 - Applications of logic to group theory [MSC 2020] |
| ISBN |
01-985354-3-0
978-01-985354-3-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0056280 |
|
Higman, Graham
|
||
| New York, : Clarendon ; Oxford university, 1988 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Existentially closed Groups / Graham Higman, Elizabeth Scott
| Existentially closed Groups / Graham Higman, Elizabeth Scott |
| Autore | Higman, Graham |
| Pubbl/distr/stampa | New York, : Clarendon ; Oxford university, 1988 |
| Descrizione fisica | XIV, 156 p. ; 24 cm |
| Altri autori (Persone) | Scott, Elizabeth |
| Soggetto topico |
03C60 - Model-theoretic algebra [MSC 2020]
03D80 - Applications of computability and recursion theory [MSC 2020] 20-XX - Group theory and generalizations [MSC 2020] 20A15 - Applications of logic to group theory [MSC 2020] 20E34 - General structure theorems of groups [MSC 2020] 20F05 - Generators, relations, and presentations of groups [MSC 2020] 20F10 - Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) [MSC 2020] |
| ISBN |
01-985354-3-0
978-01-985354-3-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00056280 |
|
Higman, Graham
|
||
| New York, : Clarendon ; Oxford university, 1988 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Forcing, Arithmetic, Division Rings / Joram Hirschfeld, William H. Wheeler
| Forcing, Arithmetic, Division Rings / Joram Hirschfeld, William H. Wheeler |
| Autore | Hirschfeld, Joram |
| Pubbl/distr/stampa | Berlin, : Springer, 1975 |
| Descrizione fisica | vii, 266 p. ; 24 cm |
| Altri autori (Persone) | Wheeler, William Hollis |
| Soggetto topico |
16-XX - Associative rings and algebras [MSC 2020]
03-XX - Mathematical logic and foundations [MSC 2020] 03E35 - Consistency and independence results [MSC 2020] 16Kxx - Division rings and semisimple Artin rings [MSC 2020] 16S10 - Associative rings determined by universal properties (free algebras, coproducts, adjunction of inverses, etc.) [MSC 2020] 14Axx - Foundations of algebraic geometry [MSC 2020] 03C60 - Model-theoretic algebra [MSC 2020] 03D80 - Applications of computability and recursion theory [MSC 2020] 03C68 - Other classical first-order model theory [MSC 2020] |
| Soggetto non controllato |
Algebra
Arithmetic Finite Forcing Models Recursion |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0256330 |
|
Hirschfeld, Joram
|
||
| Berlin, : Springer, 1975 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||