EuDML | Browse

A weak form of the constructively important notion of locatedness is lifted from the context of a metric space to that of a uniform space. Certain fundamental results about almost located and totally bounded sets are then proved.

Alternative models in precipitation analysis.

Barbulescu, Alina, Bautu, Elena (2009)

Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică

Ambiguity and stratification

Marcel Crabbé (1978)

Fundamenta Mathematicae

An algebraic approach to the Heyting-Brouwer predicate calculus

Cecylia Rauszer (1977)

Fundamenta Mathematicae

An application of a reflection principle

Zofia Adamowicz, Leszek Aleksander Kołodziejczyk, Paweł Zbierski (2003)

Fundamenta Mathematicae

We define a recursive theory which axiomatizes a class of models of IΔ₀ + Ω ₃ + ¬ exp all of which share two features: firstly, the set of Δ₀ definable elements of the model is majorized by the set of elements definable by Δ₀ formulae of fixed complexity; secondly, Σ₁ truth about the model is recursively reducible to the set of true Σ₁ formulae of fixed complexity.

An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions.

Weiermann, Andreas (2003)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

An interpretation of $S_{2}^{1}$ in $Σ_{1}^{b}$ -NIA.

Ferreira, Gilda, Oitavem, Isabel (2006)

Portugaliae Mathematica. Nova Série

An Ordering of the set of Sentences of Peano Arithmetic

Aleksandar Ignjatović (1985)

Publications de l'Institut Mathématique

An upper bound on the space complexity of random formulae in resolution

Michele Zito (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We prove that, with high probability, the space complexity of refuting a random unsatisfiable Boolean formula in $k$ -CNF on $n$ variables and $m = Δ n$ clauses is $O (n \cdot Δ^{- \frac{1}{k - 2}})$ .

An Upper Bound on the Space Complexity of Random Formulae in Resolution

Michele Zito (2010)

RAIRO - Theoretical Informatics and Applications

We prove that, with high probability, the space complexity of refuting a random unsatisfiable Boolean formula in k-CNF on n variables and m = Δn clauses is $O (n \cdot Δ^{- \frac{1}{k - 2}})$ .

Application de la généralisation du principe de correspondance à la théorie de l'élimination

Louis Saltel (1873)

Nouvelles annales de mathématiques : journal des candidats aux écoles polytechnique et normale

Approximation theory of uniqueness conditions by existence conditions

Nobuyoshi Motohashi (1984)

Fundamenta Mathematicae

Currently displaying 41 – 60 of 67

Previous Page 3 Next