Amazon cover image
Image from Amazon.com
Image from Google Jackets

Proof Theory and Intuitionistic Systems [electronic resource] / by Bruno Scarpellini.

By: Contributor(s): Material type: TextTextSeries: Lecture Notes in Mathematics ; 212Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1971Description: VIII, 292 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540368755
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 511.3 23
LOC classification:
  • QA8.9-10.3
Online resources:
Contents:
and preliminaries -- A review of Gentzen's second consistency proof -- The intuitionistic system of number theory -- A formally intuitionistic system as strong as classical analysis -- Transfinite induction with respect to recursive wellorderings without function parameters -- A formally intuitonistic theory equivalent to classical transfinite induction with respect to recursive wellfounded trees with function parameters -- A system containing barinduction with respect to decidable predicates -- Harrop formulas -- The Markov principle -- Relative consistency proof of ZTN with respect to ZTi/IN*.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

and preliminaries -- A review of Gentzen's second consistency proof -- The intuitionistic system of number theory -- A formally intuitionistic system as strong as classical analysis -- Transfinite induction with respect to recursive wellorderings without function parameters -- A formally intuitonistic theory equivalent to classical transfinite induction with respect to recursive wellfounded trees with function parameters -- A system containing barinduction with respect to decidable predicates -- Harrop formulas -- The Markov principle -- Relative consistency proof of ZTN with respect to ZTi/IN*.

There are no comments on this title.

to post a comment.
(C) Powered by Koha

Powered by Koha