Sciweavers

472 search results - page 7 / 95
» Limiting Negations in Formulas
Sort
View
JAT
2006
77views more  JAT 2006»
13 years 7 months ago
On extensions of a theorem of Baxter
We combine the Riemann-Hilbert approach with the techniques of Banach algebras to obtain an extension of Baxter's Theorem for polynomials orthogonal on the unit circle. This ...
Jeffrey S. Geronimo, Andrei Martínez-Finkel...
ALT
2004
Springer
14 years 4 months ago
Learning Languages from Positive Data and Negative Counterexamples
In this paper we introduce a paradigm for learning in the limit of potentially infinite languages from all positive data and negative counterexamples provided in response to the ...
Sanjay Jain, Efim B. Kinber
COMBINATORICA
2010
13 years 5 months ago
Formulae and growth rates of high-dimensional polycubes
A d-dimensional polycube is a facet-connected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in their shape or orientation. A proper d-dimens...
Ronnie Barequet, Gill Barequet, Günter Rote
JSYML
2006
124views more  JSYML 2006»
13 years 7 months ago
Glivenko theorems for substructural logics over FL
It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provabl...
Nikolaos Galatos, Hiroakira Ono
STACS
2007
Springer
14 years 1 months ago
A New Rank Technique for Formula Size Lower Bounds
We exactly determine the formula size of the parity function. If n = 2 + k, where 0 ≤ k < 2 , then the formula size of parity on n bits is 2 (2 + 3k) = n2 + k2 − k2 . Khrap...
Troy Lee