Results 1 to 10 of about 1,624 (20)

Co-c.e. spheres and cells in computable metric spaces [PDF]

open access: yesLogical Methods in Computer Science, 2011
We investigate conditions under which a co-computably enumerable set in a computable metric space is computable. Using higher-dimensional chains and spherical chains we prove that in each computable metric space which is locally computable each co ...
Zvonko Iljazovic
doaj   +1 more source

Decidable Expansions of Labelled Linear Orderings [PDF]

open access: yesLogical Methods in Computer Science, 2011
Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists a non-trivial
Alexis Bes, Alexander Rabinovich
doaj   +1 more source

Tameness in least fixed-point logic and McColm's conjecture [PDF]

open access: yes, 2021
We investigate four model-theoretic tameness properties in the context of least fixed-point logic over a family of finite structures. We find that each of these properties depends only on the elementary (i.e., first-order) limit theory, and we completely
Bhaskar, Siddharth, Kruckman, Alex
core   +2 more sources

Beginning of stability theory for Polish Spaces [PDF]

open access: yes, 2011
We consider stability theory for Polish spaces and more generally for definable structures.
B. Hart   +14 more
core   +1 more source

On structures in hypergraphs of models of a theory [PDF]

open access: yes, 2018
We define and study structural properties of hypergraphs of models of a theory including lattice ones. Characterizations for the lattice properties of hypergraphs of models of a theory, as well as for structures on sets of isomorphism types of models of ...
Kulpeshov, Beibut, Sudoplatov, Sergey
core   +3 more sources

Topological diagonalizations and Hausdorff dimension [PDF]

open access: yes, 2002
The Hausdorff dimension of a product XxY can be strictly greater than that of Y, even when the Hausdorff dimension of X is zero. But when X is countable, the Hausdorff dimensions of Y and XxY are the same.
Tsaban, Boaz, Weiss, Tomasz
core   +7 more sources

Selection principles in mathematics: A milestone of open problems [PDF]

open access: yes, 2003
We survey some of the major open problems involving selection principles, diagonalizations, and covering properties in topology and infinite combinatorics.
Tsaban, Boaz
core   +5 more sources

Universal Structures

open access: yes, 2013
We deal with the existence of universal members in a given cardinality for several classes. First we deal with classes of Abelian groups, specifically with the existence of universal members in cardinalities which are strong limit singular of countable ...
Shelah, Saharon
core   +1 more source

Well-orders in the transfinite Japaridze algebra

open access: yes, 2014
This paper studies the transfinite propositional provability logics $\glp_\Lambda$ and their corresponding algebras. These logics have for each ordinal $\xi< \Lambda$ a modality $\la \alpha \ra$.
Fernández-Duque, David   +1 more
core   +1 more source

Compactness of maximal eventually different families

open access: yes, 2017
We show that there is an effectively closed maximal eventually different family of functions in spaces of the form $\prod_n F(n)$ for $F\colon \mathbb{N} \to \mathbb{N}\cup\{\mathbb{N}\}$ and give an exact criterion for when there exists an effectively ...
Schrittesser, David
core   +1 more source

Home - About - Disclaimer - Privacy