Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,810,079 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
2013
2013
Rasch model in data envelopment analysis: application in the international tourist hotel industry
Kua-Hsin Peng
,
Jen-Hung Huang
,
Wen-Hsiang Wu
Journal of the Operational Research Society
2013
Corpus ID: 2058667
The Rasch model can be used to transform ordinal data into interval data. Rasch has seldom been incorporated in data envelopment…
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
2006
2006
Rational Acceptance and Conjunctive/Disjunctive Absorption
G. Wheeler
Journal of Logic, Language and Information
2006
Corpus ID: 12876175
A bounded formula is a pair consisting of a propositional formula φ in the first coordinate and a real number within the unit…
Expand
1999
1999
Hybrid logic is the bounded fragment of first order logic.
C. Areces
,
P. Blackburn
,
M. Marx
1999
Corpus ID: 2699507
Hybrid languages are extended modal languages which can refer to (or even quantify over) worlds. The use of strong hybrid…
Expand
1998
1998
A Remark on Independence Results for Sharply Bounded Arithmetic
Jan Johannsen
Mathematical Logic Quarterly
1998
Corpus ID: 16099719
The purpose of this note is to show that the independence results for sharply bounded arithmetic of Takeuti [4] and Tada and…
Expand
1995
1995
Delineating classes of computational complexity via second order theories with weak set existence principles. I
A. Ignjatović
Journal of Symbolic Logic (JSL)
1995
Corpus ID: 9528887
Abstract In this paper we characterize the well-known computational complexity classes of the polynomial time hierarchy as…
Expand
1995
1995
A note on a result of Buss concerning bounded theories and the collection scheme.
Fernando Ferreira
1995
Corpus ID: 9334559
Samuel Buss showed that, under certain circumstances, adding the col- lection scheme for bounded formulae to a bounded theory of…
Expand
1988
1988
Bounded quantifiers have interval models
S. Martini
LISP and Functional Programming
1988
Corpus ID: 16181890
We propose a sound model for an extension of the language Fun, proposed by L. Cardelli and P. Wegner as a formalization of the…
Expand
1984
1984
Some model theory of modules. III. On infiniteness of sets definable in modules
P. Rothmaler
Journal of Symbolic Logic (JSL)
1984
Corpus ID: 45758104
This is the third and last part of an investigation in several topics of first order model theory of modules which I began in…
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