Sciweavers

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

7

JSYML
2008

favoriteEmaildiscussreport

51views more JSYML 2008»

Scott's problem for Proper Scott sets

13 years 4 months ago

Scott's problem for Proper Scott sets

Download websupport1.citytech.cuny.edu

Some 40 years ago, Dana Scott proved that every countable Scott set is the standard system of a model of PA. Two decades later, Knight and

Victoria Gitman

Real-time Traffic

Countable Scott | Dana Scott | JSYML 2008 | Standard |

claim paper

Related Content

» Solution of Scotts problem on the number of directions determined by a point set in 3space

» The Complexity of Orbits of Computably Enumerable Sets

» Realisable Classifiers Improving Operating Performance on Variable Cost Problems

» Solving multiagent assignment Markov decision processes

» Towards a practical engineering tool for rostering

» Approximating the Pareto Front of Multicriteria Optimization Problems

» Binary Space Partitions for Fat Rectangles

» Intersections of graphs

» Quantum lower bound for the collision problem

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JSYML
Authors	Victoria Gitman

Comments (0)