Sciweavers

218 search results - page 24 / 44
» Finite Trees as Ordinals
Sort
View
APAL
2010
115views more  APAL 2010»
14 years 10 months ago
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Lev D. Beklemishev
APAL
2010
124views more  APAL 2010»
14 years 10 months ago
The effective theory of Borel equivalence relations
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-K...
Ekaterina B. Fokina, Sy-David Friedman, Asger T&ou...
CORR
2006
Springer
103views Education» more  CORR 2006»
14 years 10 months ago
Positional Determinacy of Games with Infinitely Many Priorities
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current...
Erich Grädel, Igor Walukiewicz
ICML
2007
IEEE
15 years 10 months ago
Infinite mixtures of trees
Finite mixtures of tree-structured distributions have been shown to be efficient and effective in modeling multivariate distributions. Using Dirichlet processes, we extend this ap...
Sergey Kirshner, Padhraic Smyth
SIAMSC
2010
125views more  SIAMSC 2010»
14 years 8 months ago
A Parallel Geometric Multigrid Method for Finite Elements on Octree Meshes
Abstract. In this article, we present a parallel geometric multigrid algorithm for solving elliptic partial differential equations (PDEs) on octree based conforming finite elemen...
Rahul S. Sampath, George Biros