20世纪的数学逻辑MATHEMATICAL LOGIC IN THE 20TH CENTURY
点此进入淘宝搜索页搜索分類: 图书,进口原版书,科学与技术 Science & Techology ,
作者： Gerald E. Sacks 著
出 版 社： Aspen Publishers
出版时间： 2001-12-1字数：版次： 1页数： 693印刷时间： 2001/12/01开本：印次： 1纸张： 胶版纸I S B N ： 9789810247362包装： 精装内容简介
This invaluable book is a collection of 31 important — both in ideas and results — papers published by mathematical logicians in the 20th Century. The papers have been selected by Professor Gerald E Sacks. Some of the authors are Gödel, Kleene, Tarski, A Robinson, Kreisel, Cohen, Morley, Shelah, Hrushovski and Woodin.
目录
Introduction
The Independence of the Continuum Hypothesis
The Independence of the Continuum Hypothesis II
Marginalia to a Theorem of Silver
Three Theorems on Recursive Enumeration. I. Decomposition II. Maximal Set. III. Enumeration without Duplication
Higher Set Theory and Mathematical Practice
Introduction to H1/2-Logic
Consistency-Proof for the Generalized Continuum-Hypothesis
The Mordell-Lang Conjecture for Function Fields
Model-Theoretic Invariants: Applications to Recursive and Hyperarithmetic Operations
Recursive Functionals and Quantifiers of Finite Types I
A Recursively Enumerable Degree which will not Split over all Lesser Ones
Measurable Cardinals and Analytic Games
Enumerable Sets are Diophantine
Categoricity in Power
Hyperanalytic Predicates
Solution of Post's Reduction Problem and Some Other Problems of the Theory of Algorithms
Recursively Enumerable Sets of Positive Integers and Their
Decision Problems
Non-Standard Analysis
The Recursively Enumerable Degrees are Dense
Measurable Cardinals and Constructible Sets
Stable Theories
The Problem of Predicativity
On the Singular Cardinals Problem
Automorphisms of the Lattice of Recursively Enumerable Sets Part I: Maximal Sets
A Model of Set-Theory in which Every Set of Reals is Lebesgue Measurable
On Degrees of Recursive Unsolvability
A Decision Method for Elementary Algebra and Geometry
……
