EuDML | Browse

Items

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 99

The Feferman-Vaught theorem revisited

Hugo Volger (1976)

Colloquium Mathematicae

The Field of Reals with a Predicate for the Powers of Two.

Lou van den Dries (1986)

Manuscripta mathematica

The Functor Bext under the Negation of CH.

Manfred Dugas, Bernhard Thomé (1991)

Forum mathematicum

The induced paths in a connected graph and a ternary relation determined by them

Ladislav Nebeský (2002)

Mathematica Bohemica

By a ternary structure we mean an ordered pair $(X_{0}, T_{0})$ , where $X_{0}$ is a finite nonempty set and $T_{0}$ is a ternary relation on $X_{0}$ . By the underlying graph of a ternary structure $(X_{0}, T_{0})$ we mean the (undirected) graph $G$ with the properties that $X_{0}$ is its vertex set and distinct vertices $u$ and $v$ of $G$ are adjacent if and only if ${x \in X_{0} T_{0} (u, x, v)} \cup {x \in X_{0} T_{0} (v, x, u)} = {u, v} .$ A ternary structure $(X_{0}, T_{0})$ is said to be the B-structure of a connected graph $G$ if $X_{0}$ is the vertex set of $G$ and the following statement holds for all $u, x, y \in X_{0}$ : $T_{0} (x, u, y)$ if and only if $u$ belongs to an induced $x - y$ ...

The Infinite Random Order of Dimension $k$

Peter Winkler (1985)

Publications du Département de mathématiques (Lyon)

The isomorphism relation between tree-automatic Structures

Olivier Finkel, Stevo Todorčević (2010)

Open Mathematics

An ω-tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism problem for ω-tree-automatic structures. We prove first that the isomorphism relation for ω-tree-automatic boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups, nilpotent groups of class n ≥ 2) is not determined by the axiomatic system ZFC. Then we prove that...