Narrow your search

Library

KU Leuven (5)

UAntwerpen (5)

UGent (5)

ULiège (4)

UCLouvain (3)

EhB (2)

LUCA School of Arts (2)

Odisee (2)

Thomas More Kempen (2)

Thomas More Mechelen (2)

More...

Resource type

book (7)

digital (4)


Language

English (7)

German (3)


Year
From To Submit

2020 (1)

2016 (3)

2013 (1)

2009 (2)

2008 (1)

More...
Listing 1 - 10 of 10
Sort by
Proof theory: an introduction
Author:
ISBN: 3540518428 0387518428 3540468250 9783540518426 Year: 1989 Volume: 1407 Publisher: Berlin: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Proof theory : the first step into impredicativity
Author:
ISBN: 3540693181 354069319X 9783540693185 Year: 2008 Publisher: New York: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book verifies with compelling evidence the author’s inclination to "write a book on proof theory which needs no previous knowledge of proof theory". Avoiding the cryptic terminology of proof as far as possible, the book starts at an elementary level and displays the connections between infinitary proof theory and generalized recursion theory, especially the theory of inductive definitions. As a "warm up" the classical analysis of Gentzen is presented in a more modern terminology to proceed with explaining and proving the famous result by Feferman and Schütte on the limits of predicativity. The author, too, provides an introduction to ordinal arithmetic, introduces the Veblen hierarchy and employs these functions to design an ordinal notation system for the ordinals below Epsilon 0 and Gamma 0, while emphasizing the first step into impredicativity, i.e., the first step beyond Gamma 0. An earlier version of this book was originally published in 1989 as volume 1407 of the Springer series "Lecture Notes in Mathematics".


Multi
Proof Theory : The First Step into Impredicativity
Author:
ISBN: 9783540693192 Year: 2009 Publisher: Berlin, Heidelberg Springer-Verlag Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book verifies with compelling evidence the author's intent to "write a book on proof theory that needs no previous knowledge of proof theory". Avoiding the cryptic terminology of proof theory as far as possible, the book starts at an elementary level and displays the connections between infinitary proof theory and generalized recursion theory, especially the theory of inductive definitions. As a "warm up" Gentzen's classical analysis of pure number theory is presented in a more modern terminology, followed by an explanation and proof of the famous result of Feferman and Schütte on the limits of predicativity. The author also provides an introduction to ordinal arithmetic, introduces the Veblen hierarchy and employs these functions to design an ordinal notation system for the ordinals below Epsilon 0 and Gamma 0, while emphasizing the first step into impredicativity, that is, the first step beyond Gamma 0. This is first done by an analysis of the theory of non-iterated inductive definitions using Buchholz's improvement of local predicativity, followed by Weiermann's observation that Buchholz's method can also be used for predicative theories to characterize their provably recursive functions. A second example presents an ordinal analysis of the theory of /Pi_2 reflection, a subsystem of set theory that is proof-theoretically equivalent to Kripke-Platek set. The book is pitched at undergraduate/graduate level, and thus addressed to students of mathematical logic interested in the basics of proof theory. It can be used for introductory as well as more advanced courses in proof theory. An earlier version of this book was published in 1989 as volume 1407 of the "Lecture Notes in Mathematics" (ISBN 978-3-540-51842-6).


Digital
Mathematische Grundlagen der Informatik
Author:
ISBN: 9783110703061 9783486221138 Year: 2020 Publisher: München ;; Wien De Gruyter Oldenbourg

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Proof Theory : The First Step into Impredicativity
Authors: ---
ISBN: 9783540693192 Year: 2009 Publisher: Berlin Heidelberg Springer Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book verifies with compelling evidence the author's intent to "write a book on proof theory that needs no previous knowledge of proof theory". Avoiding the cryptic terminology of proof theory as far as possible, the book starts at an elementary level and displays the connections between infinitary proof theory and generalized recursion theory, especially the theory of inductive definitions. As a "warm up" Gentzen's classical analysis of pure number theory is presented in a more modern terminology, followed by an explanation and proof of the famous result of Feferman and Schütte on the limits of predicativity. The author also provides an introduction to ordinal arithmetic, introduces the Veblen hierarchy and employs these functions to design an ordinal notation system for the ordinals below Epsilon 0 and Gamma 0, while emphasizing the first step into impredicativity, that is, the first step beyond Gamma 0. This is first done by an analysis of the theory of non-iterated inductive definitions using Buchholz's improvement of local predicativity, followed by Weiermann's observation that Buchholz's method can also be used for predicative theories to characterize their provably recursive functions. A second example presents an ordinal analysis of the theory of /Pi_2 reflection, a subsystem of set theory that is proof-theoretically equivalent to Kripke-Platek set. The book is pitched at undergraduate/graduate level, and thus addressed to students of mathematical logic interested in the basics of proof theory. It can be used for introductory as well as more advanced courses in proof theory. An earlier version of this book was published in 1989 as volume 1407 of the "Lecture Notes in Mathematics" (ISBN 978-3-540-51842-6).


Book
Iterated inductive definitions and subsystems of analysis: : recent proof-theoretical studies
Authors: --- ---
ISBN: 3540111700 0387111700 3540386491 9783540111702 Year: 1981 Volume: 897 Publisher: Berlin: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Logic Colloquium '02 : proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic and the Colloquium Logicum, held in Münster, Germany, August 3-11, 2002
Authors: --- --- ---
ISBN: 131675572X 9781316755723 Year: 2016 Publisher: Ithaca, NY : Association for Symbolic Logic,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the twenty-seventh publication in the Lecture Notes in Logic series, contains the proceedings of two conferences: the European Summer Meeting of the Association for Symbolic Logic and the Colloquium Logicum, held in Münster, Germany in August, 2002. This compilation of articles from some of the world's preeminent logicians spans all areas of mathematical logic, including philosophical logic and computer science logic. It contains expanded versions of a number of invited plenary talks and tutorials that will be of interest to graduate students and researchers in the field of mathematical logic.


Book
Concepts of Proof in Mathematics, Philosophy, and Computer Science

Loading...
Export citation

Choose an application

Bookmark

Abstract

A proof is a successful demonstration that a conclusion necessarily follows by logical reasoning from axioms which are considered evident for the given context and agreed upon by the community. It is this concept that sets mathematics apart from other disciplines and distinguishes it as the prototype of a deductive science. Proofs thus are utterly relevant for research, teaching and communication in mathematics and of particular interest for the philosophy of mathematics. In computer science, moreover, proofs have proved to be a rich source for already certified algorithms. This book provides the reader with a collection of articles covering relevant current research topics circled around the concept 'proof'. It tries to give due consideration to the depth and breadth of the subject by discussing its philosophical and methodological aspects, addressing foundational issues induced by Hilbert's Programme and the benefits of the arising formal notions of proof, without neglecting reasoning in natural language proofs and applications in computer science such as program extraction.


Digital
Concepts of Proof in Mathematics, Philosophy, and Computer Science

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Philosophy


Digital
Listing 1 - 10 of 10
Sort by