Proofs and Computations

Β·
Β· Cambridge University Press
ЭлСктронная ΠΊΠ½ΠΈΠ³Π°
480
ΠšΠΎΠ»ΠΈΡ‡Π΅ΡΡ‚Π²ΠΎ страниц
ΠžΡ†Π΅Π½ΠΊΠΈ ΠΈ ΠΎΡ‚Π·Ρ‹Π²Ρ‹ Π½Π΅ ΠΏΡ€ΠΎΠ²Π΅Ρ€Π΅Π½Ρ‹. ΠŸΠΎΠ΄Ρ€ΠΎΠ±Π½Π΅Π΅β€¦

Об элСктронной ΠΊΠ½ΠΈΠ³Π΅

Driven by the question, 'What is the computational content of a (formal) proof?', this book studies fundamental interactions between proof theory and computability. It provides a unique self-contained text for advanced students and researchers in mathematical logic and computer science. Part I covers basic proof theory, computability and GΓΆdel's theorems. Part II studies and classifies provable recursion in classical systems, from fragments of Peano arithmetic up to Ξ 11–CA0. Ordinal analysis and the (Schwichtenberg–Wainer) subrecursive hierarchies play a central role and are used in proving the 'modified finite Ramsey' and 'extended Kruskal' independence results for PA and Ξ 11–CA0. Part III develops the theoretical underpinnings of the first author's proof assistant MINLOG. Three chapters cover higher-type computability via information systems, a constructive theory TCF of computable functionals, realizability, Dialectica interpretation, computationally significant quantifiers and connectives and polytime complexity in a two-sorted, higher-type arithmetic with linear logic.

Об Π°Π²Ρ‚ΠΎΡ€Π΅

Helmut Schwichtenberg is an Emeritus Professor of Mathematics at Ludwig-Maximilians-UniversitΓ€t MΓΌnchen. He has recently developed the 'proof-assistant' MINLOG, a computer-implemented logic system for proof/program development and extraction of computational content.

Stanley S. Wainer is an Emeritus Professor of Mathematics at the University of Leeds and a past-President of the British Logic Colloquium.

ΠžΡ†Π΅Π½ΠΈΡ‚Π΅ ΡΠ»Π΅ΠΊΡ‚Ρ€ΠΎΠ½Π½ΡƒΡŽ ΠΊΠ½ΠΈΠ³Ρƒ

ΠŸΠΎΠ΄Π΅Π»ΠΈΡ‚Π΅ΡΡŒ с Π½Π°ΠΌΠΈ своим ΠΌΠ½Π΅Π½ΠΈΠ΅ΠΌ.

Π“Π΄Π΅ Ρ‡ΠΈΡ‚Π°Ρ‚ΡŒ ΠΊΠ½ΠΈΠ³ΠΈ

Π‘ΠΌΠ°Ρ€Ρ‚Ρ„ΠΎΠ½Ρ‹ ΠΈ ΠΏΠ»Π°Π½ΡˆΠ΅Ρ‚Ρ‹
УстановитС ΠΏΡ€ΠΈΠ»ΠΎΠΆΠ΅Π½ΠΈΠ΅ Google Play Книги для Android ΠΈΠ»ΠΈ iPad/iPhone. Оно синхронизируСтся с вашим Π°ΠΊΠΊΠ°ΡƒΠ½Ρ‚ΠΎΠΌ автоматичСски, ΠΈ Π²Ρ‹ смоТСтС Ρ‡ΠΈΡ‚Π°Ρ‚ΡŒ Π»ΡŽΠ±ΠΈΠΌΡ‹Π΅ ΠΊΠ½ΠΈΠ³ΠΈ ΠΎΠ½Π»Π°ΠΉΠ½ ΠΈ ΠΎΡ„Π»Π°ΠΉΠ½ Π³Π΄Π΅ ΡƒΠ³ΠΎΠ΄Π½ΠΎ.
Ноутбуки ΠΈ Π½Π°ΡΡ‚ΠΎΠ»ΡŒΠ½Ρ‹Π΅ ΠΊΠΎΠΌΠΏΡŒΡŽΡ‚Π΅Ρ€Ρ‹
Π‘Π»ΡƒΡˆΠ°ΠΉΡ‚Π΅ Π°ΡƒΠ΄ΠΈΠΎΠΊΠ½ΠΈΠ³ΠΈ ΠΈΠ· Google Play Π² Π²Π΅Π±-Π±Ρ€Π°ΡƒΠ·Π΅Ρ€Π΅ Π½Π° ΠΊΠΎΠΌΠΏΡŒΡŽΡ‚Π΅Ρ€Π΅.
Устройства для чтСния ΠΊΠ½ΠΈΠ³
Π§Ρ‚ΠΎΠ±Ρ‹ ΠΎΡ‚ΠΊΡ€Ρ‹Ρ‚ΡŒ ΠΊΠ½ΠΈΠ³Ρƒ Π½Π° Ρ‚Π°ΠΊΠΎΠΌ устройствС для чтСния, ΠΊΠ°ΠΊ Kobo, скачайтС Ρ„Π°ΠΉΠ» ΠΈ Π΄ΠΎΠ±Π°Π²ΡŒΡ‚Π΅ Π΅Π³ΠΎ Π½Π° устройство. ΠŸΠΎΠ΄Ρ€ΠΎΠ±Π½Ρ‹Π΅ инструкции ΠΌΠΎΠΆΠ½ΠΎ Π½Π°ΠΉΡ‚ΠΈ Π² Π‘ΠΏΡ€Π°Π²ΠΎΡ‡Π½ΠΎΠΌ Ρ†Π΅Π½Ρ‚Ρ€Π΅.

Π”Ρ€ΡƒΠ³ΠΈΠ΅ ΠΊΠ½ΠΈΠ³ΠΈ Π°Π²Ρ‚ΠΎΡ€Π° Helmut Schwichtenberg

ΠŸΠΎΡ…ΠΎΠΆΠΈΠ΅ элСктронныС ΠΊΠ½ΠΈΠ³ΠΈ