Atjaunināt sīkdatņu piekrišanu

Advances in Proof Theory 1st ed. 2016 [Hardback]

Edited by , Edited by , Edited by
  • Formāts: Hardback, 425 pages, height x width: 235x155 mm, weight: 7804 g, 10 Illustrations, black and white; XII, 425 p. 10 illus., 1 Hardback
  • Sērija : Progress in Computer Science and Applied Logic 28
  • Izdošanas datums: 12-May-2016
  • Izdevniecība: Birkhauser Verlag AG
  • ISBN-10: 3319291963
  • ISBN-13: 9783319291963
Citas grāmatas par šo tēmu:
  • Hardback
  • Cena: 91,53 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 107,69 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Hardback, 425 pages, height x width: 235x155 mm, weight: 7804 g, 10 Illustrations, black and white; XII, 425 p. 10 illus., 1 Hardback
  • Sērija : Progress in Computer Science and Applied Logic 28
  • Izdošanas datums: 12-May-2016
  • Izdevniecība: Birkhauser Verlag AG
  • ISBN-10: 3319291963
  • ISBN-13: 9783319291963
Citas grāmatas par šo tēmu:
The aim of this volume is to collect original contributions by the best specialists from the area of proof theory, constructivity, and computation and discuss recent trends and results in these areas. Some emphasis will be put on ordinal analysis, reductive proof theory, explicit mathematics and type-theoretic formalisms, and abstract computations. The volume is dedicated to the 60th birthday of Professor Gerhard Jäger, who has been instrumental in shaping and promoting logic in Switzerland for the last 25 years. It comprises contributions from the symposium "Advances in Proof Theory", which was held in Bern in December 2013._Proof theory came into being in the twenties of the last century, when it was inaugurated by David Hilbert in order to secure the foundations of mathematics. It was substantially influenced by Gödel"s famous incompleteness theorems of 1930 and Gentzen"s new consistency proof for the axiom system of first order number theory in 1936. Today, proof theory is a

well-established branch of mathematical and philosophical logic and one of the pillars of the foundations of mathematics. Proof theory explores constructive and computational aspects of mathematical reasoning; it is particularly suitable for dealing with various questions in computer science.

W. Buchholz: A survey on ordinal notations around the Bachmann-Howard ordinal.- A. Cantini: About truth and types.- R. Dyckhoff: Intuitionistic decision procedures since Gentzen.- S. Feferman: The operational perspective.- R. Gore: Formally verified proof-theory using Isabelle/HOL.- P. Minari: Analytic equational proof systems for combinatory logic and lambda calculus.- W. Pohlers: From subsystems of classical analysis to subsystems of set theory - a personal account.- M. Rathjen: Ordinal analysis and witness extraction.- P. Schuster: Logic completeness via open induction.- H. Schwichtenberg: On the computational content of Higman"s lemma.- P. Schroeder-Heister: TBA.- A. Setzer: TBA.- S. Wainer: On weak "pointwise" induction, and a miniaturized predicativity.
A Survey on Ordinal Notations Around the Bachmann-Howard Ordinal
1(30)
Wilfried Buchholz
About Truth and Types
31(34)
Andrea Cantini
Lindenbaum's Lemma via Open Induction
65(14)
Francesco Ciraulo
Davide Rinaldi
Peter Schuster
Ordinal Analysis of Intuitionistic Power and Exponentiation Kripke Platek Set Theory
79(94)
Jacob Cook
Michael Rathjen
Machine-Checked Proof-Theory for Propositional Modal Logics
173(72)
Jeremy E. Dawson
Rajeev Gore
Jesse Wu
Intuitionistic Decision Procedures Since Gentzen
245(24)
Roy Dyckhoff
The Operational Perspective: Three Routes
269(22)
Solomon Feferman
Some Remarks on the Proof-Theory and the Semantics of Infinitary Modal Logic
291(28)
Pierluigi Minari
From Subsystems of Analysis to Subsystems of Set Theory
319(20)
Wolfram Pohlers
Restricting Initial Sequents: The Trade-Offs Between Identity, Contraction and Cut
339(14)
Peter Schroeder-Heister
Higman's Lemma and Its Computational Content
353(24)
Helmut Schwichtenberg
Monika Seisenberger
Franziskus Wiesnet
How to Reason Coinductively Informally
377(32)
Anton Setzer
Pointwise Transfinite Induction and a Miniaturized Predicativity
409
Stanley S. Wainer