Computational Prospects of Infinity - Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By WORLD SCIENTIFIC

9789812796547, 9789812796554

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A CUPPABLE NON-BOUNDING DEGREE

Computational Prospects of Infinity - Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore ◽

10.1142/9789812796554_0011 ◽

2008 ◽

pp. 207-223

Author(s):

Keng Meng Ng

NONSTANDARD METHODS IN RAMSEY'S THEOREM FOR PAIRS

Computational Prospects of Infinity - Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore ◽

10.1142/9789812796554_0003 ◽

2008 ◽

pp. 47-57 ◽

Cited By ~ 1

Author(s):

C. T. Chong

Keyword(s):

Ramsey's Theorem ◽

Ramsey’S Theorem

GENERATING SETS FOR THE RECURSIVELY ENUMERABLE TURING DEGREES

Computational Prospects of Infinity - Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore ◽

10.1142/9789812796554_0001 ◽

2008 ◽

pp. 1-22

Author(s):

Klaus Ambos-Spies ◽

Steffen Lempp ◽

Theodore A. Slaman

Keyword(s):

Turing Degrees ◽

Generating Sets ◽

Recursively Enumerable

FRONT MATTER

Computational Prospects of Infinity - Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore ◽

10.1142/9789812796554_fmatter ◽

2008 ◽

pp. i-ix

MONADIC DEFINABILITY OF ORDINALS

Computational Prospects of Infinity - Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore ◽

10.1142/9789812796554_0010 ◽

2008 ◽

pp. 193-205

Author(s):

Itay Neeman

ELIMINATING CONCEPTS

Computational Prospects of Infinity - Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore ◽

10.1142/9789812796554_0012 ◽

2008 ◽

pp. 225-247 ◽

Cited By ~ 3

Author(s):

André Nies

ABSOLUTENESS FOR UNIVERSALLY BAIRE SETS AND THE UNCOUNTABLE II

Computational Prospects of Infinity - Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore ◽

10.1142/9789812796554_0009 ◽

2008 ◽

pp. 163-191 ◽

Cited By ~ 3

Author(s):

Ilijas Farah ◽

Richard Ketchersid ◽

Paul Larson ◽

Menachem Magidor

LOWNESS FOR COMPUTABLE MACHINES

Computational Prospects of Infinity - Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore ◽

10.1142/9789812796554_0005 ◽

2008 ◽

pp. 79-86 ◽

Cited By ~ 5

Author(s):

Rod Downey ◽

Noam Greenberg ◽

Nenad Mihailović ◽

André Nies

CODING INTO H(ω2), TOGETHER (OR NOT) WITH FORCING AXIOMS.

Computational Prospects of Infinity - Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore ◽

10.1142/9789812796554_0002 ◽

2008 ◽

pp. 23-46

Author(s):

David Asperó

Keyword(s):

Forcing Axioms

A SIMPLER SHORT EXTENDERS FORCING — GAP 3

Computational Prospects of Infinity - Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore ◽

10.1142/9789812796554_0006 ◽

2008 ◽

pp. 87-129

Author(s):

Moti Gitik

Computational Prospects of Infinity - Lecture Notes Series, Institute for Mathematical Sciences, National University of SingaporeLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By WORLD SCIENTIFIC

A CUPPABLE NON-BOUNDING DEGREE

NONSTANDARD METHODS IN RAMSEY'S THEOREM FOR PAIRS

GENERATING SETS FOR THE RECURSIVELY ENUMERABLE TURING DEGREES

FRONT MATTER

MONADIC DEFINABILITY OF ORDINALS

ELIMINATING CONCEPTS

ABSOLUTENESS FOR UNIVERSALLY BAIRE SETS AND THE UNCOUNTABLE II

LOWNESS FOR COMPUTABLE MACHINES

CODING INTO H(ω2), TOGETHER (OR NOT) WITH FORCING AXIOMS.

A SIMPLER SHORT EXTENDERS FORCING — GAP 3

Computational Prospects of Infinity - Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore
Latest Publications