Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,224,147 papers from all fields of science
Search
Sign In
Create Free Account
Bounded quantifier
Known as:
Bounded quantifiers
In the study of formal theories in mathematical logic, bounded quantifiers are often added to a language in addition to the standard quantifiers…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
Arithmetical hierarchy
Context-sensitive grammar
ELEMENTARY
Effective descriptive set theory
Expand
Broader (1)
Computability theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Neural Networks and Quantifier Conservativity: Does Data Distribution Affect Learnability?
Vishwali Mhasawade
,
I. Szabó
,
Melanie Tosik
,
Sheng-Fu Wang
arXiv.org
2018
Corpus ID: 52291916
All known natural language determiners are conservative. Psycholinguistic experiments indicate that children exhibit a…
Expand
2017
2017
Quine ’ s “ New Foundations ” is consistent
M. R. Holmes
2017
Corpus ID: 5699591
In this paper we will present a proof of the consistency of Quine’s set theory “New Foundations” (hereinafter NF), so-called…
Expand
2016
2016
The expressive power, satisfiability and path checking problems of MTL and TPTL over non-monotonic data words
Shiguang Feng
2016
Corpus ID: 41991876
Recently, verification and analysis of data words have gained a lot of interest. Metric temporal logic (MTL) and timed…
Expand
2016
2016
On the Banach space structure of Banach lattices with disjointness preserving isometries: ultraroots and axiomatizability
Y. Raynaud
2016
Corpus ID: 125010627
Let C be an axiomatizable class of order continuous real or complex Banach lattices, that is, this class is closed under…
Expand
2010
2010
Separating bounded arithmetical theories by Herbrand consistency
Saeed Salehi
Journal of Logic and Computation
2010
Corpus ID: 9334187
The problem of Π1–separating the hierarchy of bounded arithmetic has been studied in the article. It is shown that the notion of…
Expand
2010
2010
Herbrand consistency of some arithmetical theories
Saeed Salehi
Journal of Symbolic Logic (JSL)
2010
Corpus ID: 14933971
Abstract Gödel's second incompleteness theorem is proved for Herbrand consistency of some arithmetical theories with bounded…
Expand
2009
2009
ANALYTIC STRUCTURES AND MODEL THEORETIC COMPACTNESS
J. Iovino
,
Ben Yaacov
2009
Corpus ID: 1684607
In recent years, there has been considerable interest in replicating the successful development of first-order model theory in…
Expand
2008
2008
Short Note: Coefficients of Variation in Variables with Bounded Scales
H. Kulkarni
,
K. Srinivas
,
J. Turnbull
,
K. Pinyopusarerk
2008
Corpus ID: 125909043
With a variable that is recorded on a scale with fixed bounds, it can be appropriate to use for the denominator of the…
Expand
1997
1997
Algebraic Methods and Bounded Formulas
D. Zambella
Notre Dame J. Formal Log.
1997
Corpus ID: 14086684
We present some algebraic tools useful to the study of the ex-pressive power of bounded formulas in second-order arithmetic…
Expand
1994
1994
Distributivity in Incompletely Speciied Type Hierarchies: Theory and Computational Complexity
DistributivityinIncompletely Speci
1994
Corpus ID: 16396960
Type hierarchies are a central feature of current systems which employ feature structures for the representation and manipulation…
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