Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,985,216 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
First-order logic
Logic of graphs
Prenex normal form
Quantifier (logic)
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Extended Graded Modalities in Strategy Logic
Benjamin Aminof
,
Vadim Malvone
,
A. Murano
,
S. Rubin
SR
2016
Corpus ID: 5497487
Strategy Logic (SL) is a logical formalism for strategic reasoning in multi-agent systems. Its main feature is that it has…
Expand
2012
2012
Certain Conjunctive Query Answering in SQL
Alexandre Decan
,
Fabian Pijcke
,
Jef Wijsen
Scalable Uncertainty Management
2012
Corpus ID: 21117356
An uncertain database db is defined as a database in which distinct tuples of the same relation can agree on their primary key. A…
Expand
2011
2011
Rank Hierarchies for Generalized Quantifiers
H. Keisler
,
W. Lotfallah
Journal of Logic and Computation
2011
Corpus ID: 8804435
We show that for each n and m, there is an existential first order sentence that is NOT logically equivalent to a sentence of…
Expand
Review
2008
Review
2008
Model Transformations in Decidability Proofs for Monadic Theories
W. Thomas
Annual Conference for Computer Science Logic
2008
Corpus ID: 10487787
We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first…
Expand
2007
2007
Games on Trees and Syntactical Complexity of Formulas
M. Krynicki
,
José Maria Turull Torres
Logic Journal of the IGPL
2007
Corpus ID: 10040017
Ehrenfeucht-Fraisse games have been introduced as a means of characterizing the relation of elementary equivalence between…
Expand
2007
2007
Ehrenfeucht-Fraïssé Games on Linear Orders
Ryan Bissell-Siders
Workshop on Logic, Language, Information and…
2007
Corpus ID: 42778613
We write strategies for both players in the Ehrenfeucht-Fraisse game played between two linear orders. We prove that our…
Expand
2005
2005
Locally modular geometries in homogeneous structures
Tapani Hyttinen
Mathematical Logic Quarterly
2005
Corpus ID: 43289863
We show that if M is a strongly minimal large homogeneous structure in a countable similarity type and the pregeometry of M is…
Expand
Highly Cited
2005
Highly Cited
2005
Existential positive types and preservation under homomorphisms
Benjamin Rossman
20th Annual IEEE Symposium on Logic in Computer…
2005
Corpus ID: 18553513
We prove the finite homomorphism preservation theorem: a first-order formula is preserved under homomorphisms on finite…
Expand
2005
2005
A local normal form theorem for infinitary logic with unary quantifiers
H. Keisler
,
W. Lotfallah
Mathematical Logic Quarterly
2005
Corpus ID: 17735211
We prove a local normal form theorem of the Gaifman type for the infinitary logic L∞ω(Qu)ω whose formulas involve arbitrary unary…
Expand
2001
2001
On definability of order in logic with choice
T. Huuskonen
,
Tapani Hyttinen
Proceedings 16th Annual IEEE Symposium on Logic…
2001
Corpus ID: 44593253
We will answer questions due to Blass and Gurevich (2000) on definability of order in the first-order logic with Hilbert's…
Expand
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)
ACCEPT & CONTINUE