Slaman, T. A. (Theodore Allen) 1954Overview
Most widely held works by
T. A Slaman
Computability, enumerability, unsolvability directions in recursion theory
(
)
10 editions published in 1996 in English and held by 1,219 WorldCat member libraries worldwide The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource
Infinity and truth
by Workshop on Infinity and Truth
(
)
5 editions published between 2013 and 2014 in English and held by 1,065 WorldCat member libraries worldwide This volume is based on the talks given at the Workshop on Infinity and Truth held at the Institute for Mathematical Sciences, National University of Singapore, from 25 to 29 July 2011. The chapters are by leading experts in mathematical and philosophical logic that examine various aspects of the foundations of mathematics. The theme of the volume focuses on two basic foundational questions: (i) What is the nature of mathematical truth and how does one resolve questions that are formally unsolvable within the ZermeloFraenkel set theory with the axiom of choice, and (ii) Do the discoveries in mathematics provide evidence favoring one philosophical view over others? These issues are discussed from the vantage point of recent progresses in foundational studies. The final chapter features questions proposed by the participants of the workshop that will drive foundational research. The wide range of topics covered here will be of benefit to students, researchers and mathematicians interested in the foundations of mathematics
Notes on forcing axioms
by Stevo Todorcevic
(
)
3 editions published in 2014 in English and held by 986 WorldCat member libraries worldwide In the mathematical practice, the Baire category method is a tool for establishing the existence of a rich array of generic structures. However, in mathematics, the Baire category method is also behind a number of fundamental results such as the Open Mapping Theorem or the BanachSteinhaus Boundedness Principle. This volume brings the Baire category method to another level of sophistication via the internal version of the settheoretic forcing technique. It is the first systematic account of applications of the higher forcing axioms with the stress on the technique of building forcing notions
Mathematical logic and applications : proceedings of the Logic Meeting held in Kyoto, 1987
by J Shinoda
(
Book
)
13 editions published in 1989 in English and held by 420 WorldCat member libraries worldwide These proceedings include the papers presented at the logic meeting held at the Research Institute for Mathematical Sciences, Kyoto University, in the summer of 1987. The meeting mainly covered the current research in various areas of mathematical logic and its applications in Japan. Several lectures were also presented by logicians from other countries, who visited Japan in the summer of 1987
ERecursion, Forcing and C*Algebras
by Yue Yang
(
)
2 editions published in 2014 in English and held by 31 WorldCat member libraries worldwide This volume presents the lecture notes of short courses given by three leading experts in mathematical logic at the 2012 Asian Initiative for Infinity Logic Summer School. The major topics cover settheoretic forcing, higher recursion theory, and applications of set theory to C*algebra. This volume offers a wide spectrum of ideas and techniques introduced in contemporary research in the field of mathematical logic to students, researchers and mathematicians
On the theory of the polynomial degrees of the recursive sets
by J Shinoda
(
Book
)
5 editions published in 1987 in English and held by 8 WorldCat member libraries worldwide
Every set has a least jump enumeration
by Richard J Coles
(
Book
)
1 edition published in 1998 in English and held by 5 WorldCat member libraries worldwide
The continuum hypothesis and the theory of the Kleene degrees
by J Shinoda
(
Book
)
2 editions published in 1988 in English and held by 5 WorldCat member libraries worldwide
Conference on Computability Theory : 27 January3 February 1996, Oberwolfach, Germany
by Conference on Computability Theory
(
Book
)
2 editions published in 1998 in English and held by 5 WorldCat member libraries worldwide
Computational Prospects of Infinity: Part I Tutorials. Lecture Note Series, Institute for Mathematical Sciences, National University of Singapore, Volume 14
(
)
1 edition published in 2008 in English and held by 4 WorldCat member libraries worldwide This volume presents the written versions of the tutorial lectures given at the Workshop on Computational Prospects of Infinity, held from 18 June to 15 August 2005 at the Institute for Mathematical Sciences, National University of Singapore. It consists of articles by four of the leading experts in recursion theory (computability theory) and set theory. The survey paper of Rod Downey provides a comprehensive introduction to algorithmic randomness, one of the most active areas of current research in recursion theory. Theodore A Slaman's article is the first printed account of the groundbreaking work of SlamanWoodin and SlamanShore on the definability of the Turing jump.John Steel presents some results on the properties of derived models of mice, and on the existence of mice with large derived models. The study was motivated by some of the wellknown Holy Grails in inner model theory, including the Mouse Set Conjecture. In his presentation, W Hugh Woodin gives an outline of an expanded version (unpublished) on suitable extender sequences, a subject that was developed in the attempt to understand inner model theory for large cardinals beyond the level of superstrong cardinals. The volume serves as a useful guide for graduate students and researchers in recursion theory and set theory to some of the most important and significant developments in these subjects in recent years
Recursive in a generic real
by J Shinoda
(
Book
)
2 editions published in 1997 in English and held by 4 WorldCat member libraries worldwide
On cosimple isols and their intersection types
by Rod Downey
(
Book
)
1 edition published in 1990 in English and held by 4 WorldCat member libraries worldwide
Computational Prospects of Infinity: Part II: Presented Talks. Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, Volume 15
(
)
1 edition published in 2008 in English and held by 4 WorldCat member libraries worldwide This volume is a collection of written versions of the talks given at the Workshop on Computational Prospects of Infinity, held at the Institute for Mathematical Sciences from 18 June to 15 August 2005. It consists of contributions from many of the leading experts in recursion theory (computability theory) and set theory. The topics covered in this volume include: the structure theory of various notions of degrees of unsolvability; algorithmic randomness; reverse mathematics; forcing; large cardinals and inner model theory; and, many others
Conference on computability theory
by Conference on Computability Theory
(
Book
)
2 editions published in 1998 in English and held by 2 WorldCat member libraries worldwide
Mathematical Logic and Applications
by J Shinoda
(
)
1 edition published in 1989 in English and held by 2 WorldCat member libraries worldwide
Working below a high recursively enumerable degree
by Richard A Shore
(
Book
)
1 edition published in 1990 in English and held by 2 WorldCat member libraries worldwide
Mathematical logic and applications : 87th Meeting : Papers
(
)
1 edition published in 1989 in English and held by 2 WorldCat member libraries worldwide
Computability, enumerability, unsolvability : direction in recursion theory
(
Book
)
1 edition published in 1996 in English and held by 1 WorldCat member library worldwide
Conference on Computability Theory, 27 January3 February 1996, Oberwolfach, Germany
by Conference on Computability Theory
(
)
1 edition published in 1998 in English and held by 1 WorldCat member library worldwide
Conference on computability theory : Oberwolfach, Germany, 27.0103.02.1996
by K AmbosSpies
(
Book
)
1 edition published in 1998 in English and held by 1 WorldCat member library worldwide more
fewer
Audience Level
Related Identities
Associated Subjects
Axiomatic set theory Axioms Baire classes C*algebras Computable functions Forcing (Model theory) Intersection theory Isols Lattice theory Logic, Symbolic and mathematical Mathematics MathematicsPhilosophy Numbers, Real Recursion theory Recursive functions Recursively enumerable sets Set theory Unsolvability (Mathematical logic)

Alternative Names
Slaman, T. A.
Slaman, Theodore A.
Slaman, Theodore A. 1954
Slaman, Theodore A. (Theodore Allen), 1954
Slaman, Theodore Allen 1954
Languages
Covers
