Displaying 21 – 40 of 79

Showing per page

Club-guessing and non-structure of trees

Tapani Hyttinen (2001)

Fundamenta Mathematicae

We study the possibilities of constructing, in ZFC without any additional assumptions, strongly equivalent non-isomorphic trees of regular power. For example, we show that there are non-isomorphic trees of power ω₂ and of height ω · ω such that for all α < ω₁· ω · ω, E has a winning strategy in the Ehrenfeucht-Fraïssé game of length α. The main tool is the notion of a club-guessing sequence.

Combinatorics and quantifiers

Jaroslav Nešetřil (1996)

Commentationes Mathematicae Universitatis Carolinae

Let I m be the set of subsets of I of cardinality m . Let f be a coloring of I m and g a coloring of I m . We write f g if every f -homogeneous H I is also g -homogeneous. The least m such that f g for some f : I m k is called the k -width of g and denoted by w k ( g ) . In the first part of the paper we prove the existence of colorings with high k -width. In particular, we show that for each k > 0 and m > 0 there is a coloring g with w k ( g ) = m . In the second part of the paper we give applications of wide colorings in the theory of generalized quantifiers....

Compactness and Löwenheim-Skolem properties in categories of pre-institutions

Antonino Salibra, Giuseppe Scollo (1993)

Banach Center Publications

The abstract model-theoretic concepts of compactness and Löwenheim-Skolem properties are investigated in the "softer" framework of pre-institutions [18]. Two compactness results are presented in this paper: a more informative reformulation of the compactness theorem for pre-institution transformations, and a theorem on natural equivalences with an abstract form of the first-order pre-institution. These results rely on notions of compact transformation, which are introduced as arrow-oriented generalizations...

Compactness of Powers of ω

Paolo Lipparini (2013)

Bulletin of the Polish Academy of Sciences. Mathematics

We characterize exactly the compactness properties of the product of κ copies of the space ω with the discrete topology. The characterization involves uniform ultrafilters, infinitary languages, and the existence of nonstandard elements in elementary extensions. We also have results involving products of possibly uncountable regular cardinals.

Comparing the succinctness of monadic query languages over finite trees

Martin Grohe, Nicole Schweikardt (2004)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive power on trees, but some can express the same queries much more succinctly than others. For example, we show that, under some complexity theoretic assumption, monadic second-order logic is non-elementarily more succinct than monadic least fixed point logic, which in turn is non-elementarily more succinct than monadic datalog. Succinctness...

Comparing the succinctness of monadic query languages over finite trees

Martin Grohe, Nicole Schweikardt (2010)

RAIRO - Theoretical Informatics and Applications

We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive power on trees, but some can express the same queries much more succinctly than others. For example, we show that, under some complexity theoretic assumption, monadic second-order logic is non-elementarily more succinct than monadic least fixed point logic, which in turn is non-elementarily more succinct than monadic datalog.
Succinctness...

Compatible Idempotent Terms in Universal Algebra

Ivan Chajda, Antonio Ledda, Francesco Paoli (2014)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

In universal algebra, we oftentimes encounter varieties that are not especially well-behaved from any point of view, but are such that all their members have a “well-behaved core”, i.e. subalgebras or quotients with satisfactory properties. Of special interest is the case in which this “core” is a retract determined by an idempotent endomorphism that is uniformly term definable (through a unary term t ( x ) ) in every member of the given variety. Here, we try to give a unified account of this phenomenon....

Currently displaying 21 – 40 of 79