Searching for "On Bounded Theories." – sorted by Relevance.
-
On the Bounded Theories of Finite Trees
- On the Bounded Theories of Finite Trees ? Sergei Vorobyov Max-Planck-Institut fur Informatik Im
- Cited by 1 (1 self) – Add To MetaCart
-
On the Decision Complexity of the Bounded Theories of Trees
- the bounded theory of finite trees. This theory replaces the usual equality =, interpreted as identity
- Cited by 1 (1 self) – Add To MetaCart
-
A note on a result of Buss concerning bounded theories and the collection scheme
- circumstances, adding the collection scheme for bounded formulae to a bounded theory of arithmetic yields a ∀Σ1
- Cited by 4 (1 self) – Add To MetaCart
-
A Bounded Search Space of Clausal Theories
- A Bounded Search Space of Clausal Theories Herman Midelfart Department of Computer and Information
- Cited by 2 (0 self) – Add To MetaCart
-
An Improved Lower Bound for the Elementary Theories of Trees
- An Improved Lower Bound for the Elementary Theories of Trees Sergei Vorobyov Max
- Cited by 22 (3 self) – Add To MetaCart
-
A Quantifier Elimination For The Theory Of p-Adic Numbers
- that such method should lead to an elementary upper bound for the theory. The present paper gives strong arguments
- Cited by 1 (1 self) – Add To MetaCart
-
A theory of class
- , in that it is based on a simple generalisation of F-bounds. The theory has timely implications for emerging OMG
- Cited by 1 (0 self) – Add To MetaCart
-
Using a Log-normal Failure Rate Distribution for Worst Case Bound Reliability Prediction
- worst case bound theory. 1. Introduction In an earlier paper [2] we derived a worst-case bound
- Cited by 1 (1 self) – Add To MetaCart
-
On the Complexity of the Theories of Weak Direct Products
- (n,k) and g as follows: Theorem 2: If the theory of g is elementary recursive and M(n,k) is bounded above
- Cited by 2 (0 self) – Add To MetaCart
-
Review of Gereon Muller: A-bar Syntax
- issues from the book---the version of bounding theory assumed, the Principle of Unambiguous Binding
- Add To MetaCart

