Sciweavers

37 search results - page 5 / 8
» The Chang-Los-Suszko theorem in a topological setting
Sort
View
AIML
2008
13 years 9 months ago
Modal logics for mereotopological relations
We present a complete axiomatization of a logic denoted by MTML (Mereo-Topological Modal Logic) based on the following set of mereotopological relations: part-of, overlap, underlap...
Yavor Nenov, Dimiter Vakarelov
CCA
2009
Springer
13 years 11 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi
JCT
2006
72views more  JCT 2006»
13 years 7 months ago
Arboricity and tree-packing in locally finite graphs
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
Maya Jakobine Stein
CORR
2012
Springer
183views Education» more  CORR 2012»
12 years 3 months ago
Twisting q-holonomic sequences by complex roots of unity
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
Stavros Garoufalidis, Christoph Koutschan
JCT
2006
77views more  JCT 2006»
13 years 7 months ago
There are uncountably many topological types of locally finite trees
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
Lilian Matthiesen