Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
All known natural language determiners are conservative. Psycholinguistic experiments indicate that children exhibit a… 
2013
2013
The Rasch model can be used to transform ordinal data into interval data. Rasch has seldom been incorporated in data envelopment… 
2010
2010
The problem of Π1–separating the hierarchy of bounded arithmetic has been studied in the article. It is shown that the notion of… 
2006
2006
A bounded formula is a pair consisting of a propositional formula φ in the first coordinate and a real number within the unit… 
1999
1999
Hybrid languages are extended modal languages which can refer to (or even quantify over) worlds. The use of strong hybrid… 
1998
1998
The purpose of this note is to show that the independence results for sharply bounded arithmetic of Takeuti [4] and Tada and… 
1995
1995
Abstract In this paper we characterize the well-known computational complexity classes of the polynomial time hierarchy as… 
1995
1995
Samuel Buss showed that, under certain circumstances, adding the col- lection scheme for bounded formulae to a bounded theory of… 
1988
1988
  • S. Martini
  • 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… 
1984
1984
This is the third and last part of an investigation in several topics of first order model theory of modules which I began in…