Results 121 to 130 of about 102,344 (170)
Some of the next articles are maybe not open access.
Fundamenta Informaticae, 1982
It is known that it is possible to impose a metric on the free iteration theory Γtr of Γ-trees such that the iterate f† of any tree f : n → p + n is a limit of of ‘finite approximations’ of f. Since this notion of limiting computation corresponds to our intuitive notion of iteration, it is natural to ask which other theories in the variety generated by
openaire +2 more sources
It is known that it is possible to impose a metric on the free iteration theory Γtr of Γ-trees such that the iterate f† of any tree f : n → p + n is a limit of of ‘finite approximations’ of f. Since this notion of limiting computation corresponds to our intuitive notion of iteration, it is natural to ask which other theories in the variety generated by
openaire +2 more sources
PROBABILITY AND METRIC DISCREPANCY THEORY
Stochastics and Dynamics, 2011We give an overview of probabilistic phenomena in metric discrepancy theory and present several new results concerning the asymptotic behavior of discrepancies DN(nkx) and sums ∑ckf(nkx) for sequences (nk)k ≥ 1 of integers.
Aistleitner, Christoph, Berkes, István
openaire +2 more sources
Choquet Theory in Metric Spaces
Zeitschrift für Analysis und ihre Anwendungen, 2000This paper deals with a generalization of the classical Choquet theorem. We consider metric spaces which are endowed with an abstract notion of convexity. Convex combinations are obtained by the solutions of variational inequalities. A generalized Krein-Milman theorem is derived from our Choquet theorem.
openaire +2 more sources
Mathematical Structures in Computer Science, 2014
This paper is a further investigation of a project carried out in Didehvar and Ghasemloo (2009) to study effective aspects of the metric logic. We prove an effective version of the omitting types theorem. We also present some concrete computable constructions showing that both the separable atomless probability algebra and the rational Urysohn space ...
Pourmahdian, Masoud +2 more
openaire +2 more sources
This paper is a further investigation of a project carried out in Didehvar and Ghasemloo (2009) to study effective aspects of the metric logic. We prove an effective version of the omitting types theorem. We also present some concrete computable constructions showing that both the separable atomless probability algebra and the rational Urysohn space ...
Pourmahdian, Masoud +2 more
openaire +2 more sources
Towards Metric Theory of Metric Regularity
2001It is shown that exact estimates for local metric regularity are obtained with the help of the slope introduced by De Giorgi-Marino-Tosques in 1980. Interrelation between the slope and subdifferentials are further analyzed.
openaire +1 more source
Implicit Functions: a Metric Theory
Set-Valued and Variational Analysis, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources