All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2 Next

Displaying 21 – 40 of 62

Showing per page

Oligomorphic transformation monoids and homomorphism-homogeneous structures

Dragan Mašulović, Maja Pech (2011)

Fundamenta Mathematicae

A structure is called homomorphism-homogeneous if every homomorphism between finitely generated substructures of the structure extends to an endomorphism of the structure (P. J. Cameron and J. Nešetřil, 2006). In this paper we introduce oligomorphic transformation monoids in full analogy to oligomorphic permutation groups and use this notion to propose a solution to a problem, posed by Cameron and Nešetřil in 2006, to characterize endomorphism monoids of homomorphism-homogeneous relational structures...

On sets with rank one in simple homogeneous structures

Ove Ahlman, Vera Koponen (2015)

Fundamenta Mathematicae

We study definable sets D of SU-rank 1 in ℳ e q , where ℳ is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such D can be seen as a ’canonically embedded structure’, which inherits all relations on D which are definable in ℳ e q , and has no other definable relations. Our results imply that if no relation symbol of the language of ℳ has arity higher than 2, then there is a close relationship between triviality of dependence and being a reduct of a binary...

On the number of countable models of stable theories

Predrag Tanović (2001)

Fundamenta Mathematicae

We prove: Theorem. If T is a countable, complete, stable, first-order theory having an infinite set of constants with different interpretations, then I(T,ℵ₀) ≥ ℵ₀.

Random orderings and unique ergodicity of automorphism groups

Omer Angel, Alexander S. Kechris, Russell Lyons (2014)

Journal of the European Mathematical Society

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random graph. We give similar theorems for other structures, including, for example, metric spaces. These give the first examples of uniquely ergodic groups, other than compact groups and extremely amenable groups, after Glasner andWeiss’s example of the group of all permutations...

Relational quotients

Miodrag Sokić (2013)

Fundamenta Mathematicae

Let 𝒦 be a class of finite relational structures. We define ℰ𝒦 to be the class of finite relational structures A such that A/E ∈ 𝒦, where E is an equivalence relation defined on the structure A. Adding arbitrary linear orderings to structures from ℰ𝒦, we get the class 𝒪ℰ𝒦. If we add linear orderings to structures from ℰ𝒦 such that each E-equivalence class is an interval then we get the class 𝒞ℰ[𝒦*]. We provide a list of Fraïssé classes among ℰ𝒦, 𝒪ℰ𝒦 and 𝒞ℰ[𝒦*]. In addition, we classify...

Separable reduction theorems by the method of elementary submodels

Marek Cúth (2012)

Fundamenta Mathematicae

We simplify the presentation of the method of elementary submodels and we show that it can be used to simplify proofs of existing separable reduction theorems and to obtain new ones. Given a nonseparable Banach space X and either a subset A ⊂ X or a function f defined on X, we are able for certain properties to produce a separable subspace of X which determines whether A or f has the property in question. Such results are proved for properties of sets: of being dense, nowhere dense, meager, residual...

The number of countable isomorphism types of complete extensions of the theory of Boolean algebras

Paul Iverson (1991)

Colloquium Mathematicae

There is a conjecture of Vaught [17] which states: Without The Generalized Continuum Hypothesis one can prove the existence of a complete theory with exactly ω 1 nonisomorphic, denumerable models. In this paper we show that there is no such theory in the class of complete extensions of the theory of Boolean algebras. More precisely, any complete extension of the theory of Boolean algebras has either 1 or 2 ω nonisomorphic, countable models. Thus we answer this conjecture in the negative for any complete...

Currently displaying 21 – 40 of 62