Provability, Computability and Reflection
- 1st Edition, Volume 90 - April 1, 2000
- Latest edition
- Author: Lev D. Beklemishev
- Language: English
Studies in Logic and the Foundations of Mathematics, Volume 90: Handbook of Mathematical Logic focuses on the principles, operations, and approaches in mathematical logic,… Read more
Purchase options
Description
Description
Studies in Logic and the Foundations of Mathematics, Volume 90: Handbook of Mathematical Logic focuses on the principles, operations, and approaches in mathematical logic, including model theory, set theory, recursion theory, and proof theory. The selection first offers information on an introduction to first-order logic, fundamentals of model theory, and ultraproducts for algebraists. Discussions focus on the completeness theorem, diagrams and compactness, stable theories, infinite formulas and extra quantifiers, bounds in polynomial ideals, and ultraproducts of valued fields. The text then tackles model completeness, homogenous sets, infinitesimal analysis of curves and surfaces, and admissible sets and infinitary logic. The book ponders on doctrines in categorical logic, axioms of set theory, combinatorics, and forcing. Topics include formal symbols for set theory, useful combinatorial principles, almost disjoint sets, partition calculus, large cardinals, sets and formation, and ordinals. The manuscript also reviews the aspects of constructive mathematics, theories of finite type related to mathematical practice, and incompleteness theorems. The selection is a dependable reference for mathematicians and researchers interested in mathematical logic.
Readership
Readership
Students and researchers in Logic (Mathematics, Computer Science, Philosophy).
Table of contents
Table of contents
Foreword
Contributors
Part A: Model Theory
Guide to Part A
A.1. An Introduction to First-Order Logic
A.2. Fundamentals of Model Theory
A.3. Ultraproducts for Algebraists
A.4. Model Completeness
A.5. Homogenous Sets
A.6. Infinitesimal Analysis of Curves and Surfaces
A.7. Admissible Sets and Infinitary Logic
A.8. Doctrines in Categorical Logic
Part B: Set Theory
Guide to Part B 317
B.1. Axioms of Set Theory
B.2. About the Axiom of Choice
B.3. Combinatorics
B.4. Forcing
B.5. Constructibility
B.6. Martin's Axiom
B.7. Consistency Results in Topology
Part C: Recursion Theory
Guide to Part C
C.1. Elements of Recursion Theory
C.2. Unsolvable Problems
C.3. Decidable Theories
C.4. Degrees of Unsolvability: A Survey of Results
C.5. α-Recursion Theory
C.6. Recursion in Higher Types
C.7. An Introduction to Inductive Definitions
C.8. Descriptive Set Theory: Projective Sets
Part D: Proof Theory and Constructive Mathematics
Guide to Part D
D.1. The Incompleteness Theorems
D.2. Proof Theory: Some Applications of Cut-Elimination
D.3. Herbrand's Theorem and Gentzen's Notion of a Direct Proof
D.4. Theories of Finite Type Related to Mathematical Practice
D.5. Aspects of Constructive Mathematics
D.6. The Logic of Topoi
D.7. The Type Free Lambda Calculus
D.8. A mathematical Incompleteness in Peano Arithmetic
Author Index
Subject Index
Product details
Product details
- Edition: 1
- Latest edition
- Volume: 90
- Published: April 1, 2000
- Language: English
About the author
About the author
Lev D. Beklemishev
Author
Affiliations and expertise
Steklov Institute of Mathematics, Moscow and Utrecht University.