Sciweavers

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

6

JSYML
2000

favoriteEmaildiscussreport

78views more JSYML 2000»

On Quantification with A Finite Universe

13 years 4 months ago

On Quantification with A Finite Universe

Download shelah.logic.at

We consider a finite universe U (more exactly - a family U of them), second order quantifiers QK , where for each U this means quantifying over a family of n(K)-place relations closed under permuting U. We define some natural orders and shed some light on the classification problem of those quantifiers. I would like to thank Alice Leonhardt for the beautiful typing. Publication No. 639 First Typed - 97/Dec/19 Latest Revision - 98/Oct/27 Typeset by AMS-TEX 1

Saharon Shelah

Real-time Traffic

Classification Problem | JSYML 2000 | Natural Orders | Order Quantifiers |

claim paper

Related Content

» Parameterfree polymorphic types

» From topology to metric modal logic and quantification in metric spaces

» A Trace Based Bisimulation for the Spi Calculus An Extended Abstract

» Frequent Itemset Discovery with SQL Using Universal Quantification

» Equational Constraint Solving Via a Restricted Form of Universal Quantification

» Temporal aggregates and temporal universal quantification in standard SQL

» Optimizing Queries with Universal Quantification in ObjectOriented and ObjectRelational Da...

» Lexical Scoping as Universal Quantification

» Supporting Universal Quantification in a TwoDimensional Database Query Language

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	JSYML
Authors	Saharon Shelah

Comments (0)