activity
20062024
most citedOn fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms

2 citations · 2 across the 5 of their papers we have counts for

collaborators

5 papers

econ.TH2024

Intergenerational Preferences and Continuity: Reconciling Order and Topology

Asier Estevan, Roberto Maura, Oscar Valero

In this paper we focus our efforts on studying how a preorder and topology can be made compatible. Thus we provide a characterization of those that are continuous-compatible. Such…

cs.IT2024★ 2 cited

On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms

Asier Estevan, Juan-José Minãna, Oscar Valero

The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursive specifications in Denotational Semantics. In this paper we discuss whether the hypot…

math.LO2016

On the structure of formal balls of the balanced quasi-metric domain of words

Salvador Romaguera, Oscar Valero

In "Denotational semantics for programming languages, balanced quasi-metrics and fixed points" (International Journal of Computer Mathematics 85 (2008), 623-630), J. Rodríguez-Lópe…

cs.CC2010

The Baire partial quasi-metric space: A mathematical tool for asymptotic complexity analysis in Computer Science

M. A. Cerdà-Uguet, M. P. Schellekens, O. Valero

In 1994, S.G. Matthews introduced the notion of partial metric space in order to obtain a suitable mathematical tool for program verification [Ann. New York Acad. Sci. 728 (1994),…

math.FA2006

Quotient normed cones

Oscar Valero

Given a normed cone and a subcone we construct and study the quotient normed cone generated by . In particular we characterize the bicompleteness…