Skip to search formSkip to main contentSkip to account menu

Quantifier rank

In mathematical logic, the quantifier rank of a formula is the depth of nesting of its quantifiers. It plays an essential role in model theory… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
First-order logicLogic of graphsPrenex normal formQuantifier (logic)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Extended Graded Modalities in Strategy Logic
Strategy Logic (SL) is a logical formalism for strategic reasoning in multi-agent systems. Its main feature is that it has… 
2016
2016
ISOMORPHISM ON HYP
Abstract We show that isomorphism is not a complete ${\rm{\Sigma }}_1^1$ equivalence relation even when restricted to the… 
2015
2015
The Power of the Depth of Iteration in Defining Relations by Induction
In this thesis we study inductive definitions over finite structures, particularly, the depth of inductive definitions. We also… 
2012
2012
Certain Conjunctive Query Answering in SQL
An uncertain database db is defined as a database in which distinct tuples of the same relation can agree on their primary key. A… 
2011
2011
Rank Hierarchies for Generalized Quantifiers
We show that for each n and m, there is an existential first order sentence that is NOT logically equivalent to a sentence of… 
Review
2008
Review
2008
Model Transformations in Decidability Proofs for Monadic Theories
We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first… 
2007
2007
Games on Trees and Syntactical Complexity of Formulas
Ehrenfeucht-Fraisse games have been introduced as a means of characterizing the relation of elementary equivalence between… 
2007
2007
Ehrenfeucht-Fraïssé Games on Linear Orders
We write strategies for both players in the Ehrenfeucht-Fraisse game played between two linear orders. We prove that our… 
2005
2005
Locally modular geometries in homogeneous structures
We show that if M is a strongly minimal large homogeneous structure in a countable similarity type and the pregeometry of M is… 
2001
2001
On definability of order in logic with choice
We will answer questions due to Blass and Gurevich (2000) on definability of order in the first-order logic with Hilbert's… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)