Sciweavers

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

8

MLQ
2006

favoriteEmaildiscussreport

93views more MLQ 2006»

On the extender algebra being complete

13 years 4 months ago

On the extender algebra being complete

Download www.math.toronto.edu

We show that a Woodin cardinal is necessary for the Extender Algebra to be complete. Our proof is relatively simple and does not use fine structure.

Richard Ketchersid, Stuart Zoble

Real-time Traffic

Extender Algebra | Fine Structure | MLQ 2006 | Woodin Cardinal |

claim paper

Related Content

» Completing Partial Combinatory Algebras With Unique HeadNormal Forms

» Rewriting Extended Regular Expressions

» Relational Completeness of Query Languages for Annotated Databases

» A proof of completeness for continuous firstorder logic

» A MultiSet Extended Relational Algebra A Formal Approach to a Practical Issue

» Extending the Relational Algebra to Capture Complex Objects

» Universal Algebra for Termination of HigherOrder Rewriting

» Using equivalencechecking to verify robustness to denial of service

» An Extended Relational Database Model for Uncertain and Imprecise Information

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2006
Where	MLQ
Authors	Richard Ketchersid, Stuart Zoble

Comments (0)