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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2017
024619772017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We consider the problem of checking whether a proposed invariant φ expressed in first-order logic with quantifier alternation is… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
2017
2017
Abstract For every q ∈ N let FOq denote the class of sentences of first-order logic FO of quantifier rank at most q. If a graph… (More)
Is this relevant?
2004
2004
Term algebras have wide applicability in computer science. Unfortunately, the decision problem for term algebras has a… (More)
Is this relevant?
1997
1997
We show that every model of I 0 has an end extension to a model of a theory (extending Buss' S 0 2) where logspace computable… (More)
Is this relevant?
1988
1988
We propose a sound model for an extension of the language Fun, proposed by L. Cardelli and P. Wegner as a formalization of the… (More)
Is this relevant?
1988
1988
A b s t r a c t . We consider domino games which describe computations of alternating Turing machines in the same way as dominoes… (More)
Is this relevant?
1988
1988
We describe an extension to our quantifier-free computational logic to provide the expressive power and convenience of bounded… (More)
Is this relevant?
1982
1982
Almost all lower bounds for the complexity of the decision problem for mathematical theories rely on the fact that certain… (More)
Is this relevant?
Highly Cited
1978
Highly Cited
1978
This paper concerns both the complexity aspects of PA and the pragmatics of improving algorithms for dealing with restricted… (More)
Is this relevant?