Add to ORKGWe introduce a refinement of the usual Ehrenfeucht-Fra\"{\i}ss\'e game. The new game will help us make finer distinctions than the traditional one. In particular, it can be used to measure the size formulas needed for expressing a given property. We will give two versions of the game: the first version characterizes the size of formulas in propositional logic, and the second version works for first-order predicate logic.Peer reviewe
As the title indicates, this thesis is concerned with the strength of non-uniformity in proof comple...
AbstractIt was considered to be “typical for first order theories” that a restriction to sentences w...
We will find a lower bound on the recognition complexity of the theories that are nontrivial relativ...
25 pagesWe introduce a refinement of the usual Ehrenfeucht-Fra\"{\i}ss\'e game. The new game will he...
AbstractIt is shown how the method of Fischer and Rabin can be extended to get good lower bounds for...
In 1981, Neil Immerman described a two-player game, which he called the "separability game" \cite{Im...
This paper considers the structure consisting of the set of all words over a given alphabet together...
AbstractBy the complexity KF(Φ) of the formula Φ: (A ⋁ B) ⇒ C we mean the minimal length of a progra...
This paper is motivated by the problem of proving lower bounds on the formula size of boolean funct...
AbstractThe expressive power of existentially quantified Boolean formulas ∃CNF with free variables i...
We present and study a framework in which one can present alternation-based lower bounds on proof le...
Many algorithmic results on the modal mu-calculus use representations of formulas such as alternatin...
AbstractThe decision problem of various logical theories can be decided by automata-theoretic method...
AbstractThe complexity of subclasses of logical theories (mainly Presburger and Skolem arithmetic) i...
We present and study a framework in which one can present alternation-based lower bounds on proof le...
As the title indicates, this thesis is concerned with the strength of non-uniformity in proof comple...
AbstractIt was considered to be “typical for first order theories” that a restriction to sentences w...
We will find a lower bound on the recognition complexity of the theories that are nontrivial relativ...
25 pagesWe introduce a refinement of the usual Ehrenfeucht-Fra\"{\i}ss\'e game. The new game will he...
AbstractIt is shown how the method of Fischer and Rabin can be extended to get good lower bounds for...
In 1981, Neil Immerman described a two-player game, which he called the "separability game" \cite{Im...
This paper considers the structure consisting of the set of all words over a given alphabet together...
AbstractBy the complexity KF(Φ) of the formula Φ: (A ⋁ B) ⇒ C we mean the minimal length of a progra...
This paper is motivated by the problem of proving lower bounds on the formula size of boolean funct...
AbstractThe expressive power of existentially quantified Boolean formulas ∃CNF with free variables i...
We present and study a framework in which one can present alternation-based lower bounds on proof le...
Many algorithmic results on the modal mu-calculus use representations of formulas such as alternatin...
AbstractThe decision problem of various logical theories can be decided by automata-theoretic method...
AbstractThe complexity of subclasses of logical theories (mainly Presburger and Skolem arithmetic) i...
We present and study a framework in which one can present alternation-based lower bounds on proof le...
As the title indicates, this thesis is concerned with the strength of non-uniformity in proof comple...
AbstractIt was considered to be “typical for first order theories” that a restriction to sentences w...
We will find a lower bound on the recognition complexity of the theories that are nontrivial relativ...