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)

Related topics

Related topics

16 relations
Arithmetical hierarchyContext-sensitive grammarELEMENTARYEffective descriptive set theory

Broader (1)

Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Bounded Z-type neurodynamics with limited-time convergence and noise tolerance for calculating time-dependent Lyapunov equation
2018
2018
Weakly minimal groups with a new predicate
Fix a weakly minimal (i.e. superstable [Formula: see text]-rank [Formula: see text]) structure [Formula: see text]. Let [Formula… 
2016
2016
On the Banach space structure of Banach lattices with disjointness preserving isometries: ultraroots and axiomatizability
Let C be an axiomatizable class of order continuous real or complex Banach lattices, that is, this class is closed under… 
2013
2013
Polylogarithmic Cuts in Models of V^0
We study initial cuts of models of weak two-sorted Bounded Arithmetics with respect to the strength of their theories and show… 
2013
2013
Rasch model in data envelopment analysis: application in the international tourist hotel industry
The Rasch model can be used to transform ordinal data into interval data. Rasch has seldom been incorporated in data envelopment… 
2012
2012
Imprecise probabilities for representing ignorance about a parameter
2010
2010
Separating bounded arithmetical theories by Herbrand consistency
The problem of Π1–separating the hierarchy of bounded arithmetic has been studied in the article. It is shown that the notion of… 
1991
1991
On maximal theories
Let S be a recursive theory. Let a theory T* consisting of Σ1 sentences be called maximal (with respect to S) if T* is maximal… 
1991
1991
Hierarchies of Weak Automata and Weak Monadic Formulas
1990
1990
Logic Programming with Bounded Quantifiers
This paper describes an extension of Horn clause logic programs by bounded quantifiers. Bounded quantifiers had been extensively… 
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)