Select an Action
Logic Colloquium 76 : proceedings of a conference held in Oxford in July 1976
Title:
Logic Colloquium 76 : proceedings of a conference held in Oxford in July 1976
Author:
Logic Colloquium (1976 : Oxford)
ISBN:
9780080954967
9781282309074
9786612309076
Conference Author:
Publication Information:
Amsterdam ; New York : North-Holland Pub. Co. ; New York : Sole distributors for U.S.A. and Canada, Elsevier North-Holland, 1977.
Physical Description:
1 online resource (x, 612 pages) : portrait.
Series:
Studies in logic and the foundations of mathematics ; v. 87
Studies in logic and the foundations of mathematics ; v. 87.
Contents:
Front Cover; Logic Colloquium 76; Copyright Page; TABLE OF CONTENTS; PREFACE; INVITED ADDRESSES; PART ONE ""STUDIES IN LOGIC"" SYMPOSIUM; Chapter 1 Twenty-five years of ""Studies in Logic""; Chapter 2 Hyperfinite model theory; Chapter 3 On the kind of data needed for a theory of proofs; Chapter 4 The foundations of mathematics in Poland after World War II; Chapter 5 A tribute to A. Mostowski; PART TWO HISTORY OF MODERN LOGIC; Chapter 6 Bolzano's contribution to logic and philosophy of mathematics; Chapter 7 The simple theory of types; Chapter 8 Set-theoretic semantics
Chapter 9 On the work and influence of Stanislaw LesniewskiChapter 10 Inference without axiom or paradoxes; Chapter 11 Leopold Löwenheim: life, work, and early influence; PART THREE APPLICATIONS OF MODEL THEORY; Chapter 12 Relatively homogeneous structures; Chapter 13 Applications of logic to the problem of splitting Abelian groups; Chapter 14 Stability and N0-categoricity of nonabelian groups; Chapter 15 Existentially closed models of basic number theory; PART FOUR RECURSION THEORY; Chapter 16 Inductive schemata and recursively continuous functionals
Chapter 17 Between recursion theory and set theoryChapter 18 Computable and recursively countable functions of higher type; Chapter 19 Aspects of constructivity in mathematics; Chapter 20 The model C of the partial continuous functionals; PART FIVE COMPLEXITY OF COMPUTATIONS; Chapter 21 Bounded concatenation as a uniform method for proving lower complexity bounds; Chapter 22 The network complexity and the breadth of Boolean functions
Chapter 23 Complexity of derivations from quantifier-free Horn formulae, mechanical introduction of explicit definitions, and refinement of completeness theoremsPART SIX SET THEORY; Chapter 24 Precipitous ideals; Chapter 25 The real line and the universe; Chapter 26 Adding dependent choice to the prime ideal theorem; Chapter 27 The one/many problem in the foundations of set theory; Chapter 28 Sets having calibre N1
Abstract:
Provability, Computability and Reflection.
Electronic Access:
ScienceDirect http://www.sciencedirect.com/science/book/9780720406917Available:*
Shelf Number | Item Barcode | Shelf Location | Status |
|---|---|---|---|
| QA9 .A1 L63 1976 EB | 1192442-1001 | Elsevier E-Book Collections | Searching... |
On Order
Select a list
Make this your default list.
The following items were successfully added.
There was an error while adding the following items. Please try again.
:
Select An Item
Data usage warning: You will receive one text message for each title you selected.
Standard text messaging rates apply.