We analyze computational aspects of partially ordered quantification in first-order logic. Show that almost any non-linear quantifier, applied to quantifier-free first-order formula suffices to express an -complete predicate. The remaining non-linear quantifiers experiment exactly co- predicates.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/26312/1/0000397.pd
We study the finite satisfiability problem for the two-variable fragment of the first-order logic ex...
In this paper, we study the game-theoretic and computational repercussions of Henkin’s partially ord...
This paper considers the structure consisting of the set of all words over a given alphabet together...
We analyze computational aspects of partially ordered quantification i first-order logic. show that ...
In the present article a study of the finite model theory of Henkin quantifiers with boolean variabl...
This paper gives a thorough overview of what is known about first-order logic with counting quantif...
Second-order logic is the extension of first-order logic obtaining by introducing quantification of...
Abstract. In this paper we take up the study of Henkin quantifiers with boolean variables [4] also k...
This paper considers the structure consisting of the set of all words over a given alphabet together...
We begin with a disucssion of some of the serious deficiencies of first order predicate languages. T...
An algorithm is presented which eliminates second-order quantifiers over predicate variables in form...
AbstractFirst-order logic is known to have a severely limited expressive power on finite structures....
This is a copy of the author 's final draft version of an article published in the journal Lecture n...
This paper considers Henkin’s proof of completeness of classical first-order logic and extends its s...
A proof procedure is described which operates on formulas of the predicate calculus which are quanti...
We study the finite satisfiability problem for the two-variable fragment of the first-order logic ex...
In this paper, we study the game-theoretic and computational repercussions of Henkin’s partially ord...
This paper considers the structure consisting of the set of all words over a given alphabet together...
We analyze computational aspects of partially ordered quantification i first-order logic. show that ...
In the present article a study of the finite model theory of Henkin quantifiers with boolean variabl...
This paper gives a thorough overview of what is known about first-order logic with counting quantif...
Second-order logic is the extension of first-order logic obtaining by introducing quantification of...
Abstract. In this paper we take up the study of Henkin quantifiers with boolean variables [4] also k...
This paper considers the structure consisting of the set of all words over a given alphabet together...
We begin with a disucssion of some of the serious deficiencies of first order predicate languages. T...
An algorithm is presented which eliminates second-order quantifiers over predicate variables in form...
AbstractFirst-order logic is known to have a severely limited expressive power on finite structures....
This is a copy of the author 's final draft version of an article published in the journal Lecture n...
This paper considers Henkin’s proof of completeness of classical first-order logic and extends its s...
A proof procedure is described which operates on formulas of the predicate calculus which are quanti...
We study the finite satisfiability problem for the two-variable fragment of the first-order logic ex...
In this paper, we study the game-theoretic and computational repercussions of Henkin’s partially ord...
This paper considers the structure consisting of the set of all words over a given alphabet together...
DOI
Add to ORKG