Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

CORR
2008
Springer

favoriteEmaildiscussreport

97views Education» more CORR 2008»

The Church Problem for Countable Ordinals

13 years 4 months ago

The Church Problem for Countable Ordinals

Download www.cs.tau.ac.il

Abstract. A fundamental theorem of B

Alexander Rabinovich

Real-time Traffic

Arbitrary Countable Length | Church Problem | Church Synthesis Problem | CORR 2008 | Education |

claim paper

Related Content

» The complexity of lineartime temporal logic over the class of ordinals

» The Complexity of Temporal Logic with Until and Since over Ordinals

» Selection and Uniformization Problems in the Monadic Theory of Ordinals A Survey

» The ChurchTuring Thesis over Arbitrary Domains

» Graph Games on Ordinals

» Covering of ordinals

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Alexander Rabinovich

Comments (0)