JSYML
2010
13 years 8 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
JSYML
2010
13 years 8 months ago
2010
JSYML
2010
13 years 8 months ago
2010
We generalize the model theory of small profinite structures developed by Newelski to the case of compact metric spaces considered together with compact groups of homeomorphisms a...
JSYML
2010
13 years 8 months ago
2010
JSYML
2010
13 years 8 months ago
2010
We say a countable model A has a 0-basis if the types realized in A are uniformly computable. We say A has a (d-)decidable copy if there exists a model B = A such that the element...
JSYML
2010
13 years 8 months ago
2010
It is shown that under GCH every poset preserves its cofinality in any cofinality preserving extension. On the other hand, starting with measurable cardinals, a model with a part...
JSYML
2010
13 years 8 months ago
2010
We prove that the (non-intuitionistic) law of the double negation shift has a bounded functional interpretation with bar recursive functionals of finite type. As an application, we...
JSYML
2010
13 years 8 months ago
2010
In 2007, Terence Tao wrote on his blog an essay about soft analysis, hard analysis and the finitization of soft analysis statements into hard analysis statements. One of his main ...
JSYML
2010
13 years 8 months ago
2010
JSYML
2010
13 years 8 months ago
2010
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...