Sciweavers

9405 search results - page 15 / 1881
» Computing a Model of Set Theory
Sort
View
GRC
2010
IEEE
14 years 10 months ago
Local Pattern Mining from Sequences Using Rough Set Theory
Abstract--Sequential pattern mining is a crucial but challenging task in many applications, e.g., analyzing the behaviors of data in transactions and discovering frequent patterns ...
Ken Kaneiwa, Yasuo Kudo
BSL
2007
51views more  BSL 2007»
14 years 9 months ago
Relating First-order Set Theories and Elementary Toposes
We show how to interpret the language of first-order set theory in an elementary topos endowed with, as extra structure, a directed structural system of inclusions (dssi). As our ...
Steven Awodey, Carsten Butz, Alex Simpson, Thomas ...
JSC
2006
122views more  JSC 2006»
14 years 9 months ago
An automated prover for Zermelo-Fraenkel set theory in Theorema
This paper presents some fundamental aspects of the design and the implementation of an automated prover for Zermelo-Fraenkel set theory within the well-known Theorema system. The...
Wolfgang Windsteiger
SAC
2006
ACM
15 years 3 months ago
A branch and prune algorithm for the approximation of non-linear AE-solution sets
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
Alexandre Goldsztejn
82
Voted
DCC
2008
IEEE
15 years 9 months ago
Coprimitive sets and inextendable codes
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
T. L. Alderson, Aiden A. Bruen