Results 1  10
of
213,453
Trees and EhrenfeuchtFraïssé games
, 1997
"... We study trees T of height at most omega1 with no uncountable branches, and their applications in the study of pairs (A,B) of nonisomorphic structures over a fixed vocabulary. There is a natural quasiordering of such trees in terms of the existence of a strictly increasing mapping from one tree t ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We study trees T of height at most omega1 with no uncountable branches, and their applications in the study of pairs (A,B) of nonisomorphic structures over a fixed vocabulary. There is a natural quasiordering of such trees in terms of the existence of a strictly increasing mapping from one tree to another. We investigate in depth the structure of this quasiordering and relate its properties to properties of pairs (A,B) of structures. Many new constructions of pairs of highly equivalent nonisomorphic structures are given.
EhrenfeuchtFraïssé Games on Random Structures
"... Abstract. Certain results in circuit complexity (e.g., the theorem that AC 0 functions have low average sensitivity [5, 17]) imply the existence of winning strategies in EhrenfeuchtFraïssé games on pairs of random structures (e.g., ordered random graphs G = G(n, 1/2) and G + = G ∪ {random edge}). S ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Certain results in circuit complexity (e.g., the theorem that AC 0 functions have low average sensitivity [5, 17]) imply the existence of winning strategies in EhrenfeuchtFraïssé games on pairs of random structures (e.g., ordered random graphs G = G(n, 1/2) and G + = G ∪ {random edge
On winning strategies in EhrenfeuchtFraïssé games
 Theoretical Computer Science
, 1997
"... We present a powerful and versatile new sufficient condition for the second player (the ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We present a powerful and versatile new sufficient condition for the second player (the
EhrenfeuchtFraïssé goes elementarily automatic for structures of bounded degree
"... Many relational structures are automatically presentable, i.e. elements of the domain can be seen as words over a finite alphabet and equality and other atomic relations are represented with finite automata. The firstorder theories over such structures are known to be primitive recursive, which is ..."
Abstract
 Add to MetaCart
is shown by the inductive construction of an automaton representing any relation definable in the firstorder logic. We propose a general method based on EhrenfeuchtFraïssé games to give upper bounds on the size of these automata and on the time required to build them. We apply this method for two
An EhrenfeuchtFraïssé Game Approach to Collapse Results in Database Theory
, 2008
"... We present a new EhrenfeuchtFraïssé game approach to collapse results in database theory. We show that, in principle, every natural generic collapse result may be proved via a translation of winning strategies for the duplicator in an EhrenfeuchtFraïssé game. Following this approach we can deal wi ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present a new EhrenfeuchtFraïssé game approach to collapse results in database theory. We show that, in principle, every natural generic collapse result may be proved via a translation of winning strategies for the duplicator in an EhrenfeuchtFraïssé game. Following this approach we can deal
More on the EhrenfeuchtFraïssé game of length ω1
, 2001
"... This paper is a continuation of [8]. Let A and B be two first order structures of the same vocabulary L. We denote the domains of A and B by A and B respectively. All vocabularies are assumed to be relational. The EhrenfeuchtFraïsségame of length of A and B denoted by EFG (A; B) is defined as fo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper is a continuation of [8]. Let A and B be two first order structures of the same vocabulary L. We denote the domains of A and B by A and B respectively. All vocabularies are assumed to be relational. The EhrenfeuchtFraïsségame of length of A and B denoted by EFG (A; B) is defined
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2837 (11 self)
 Add to MetaCart
;enyi's nonmonotone result [Imm88, Sze87] that NL = coNL; this is a simple extension of the monotone circuit depth lower bound of Karchmer and Wigderson [KW90] for stconnectivity. We also consider mBWBP (monotone bounded width branching programs) and study the question of whether mBWBP is properly contained
Results 1  10
of
213,453