From the 1 of 6 linked papers with an AI index.
6 papers
Quantitative asymptotic regularity and -asymptotic regularity for the inexact generalized Halpern iteration
Nicoleta Dumitru, Laurentiu Leustean
The paper uses proof‑mining techniques to derive explicit quantitative bounds on the asymptotic and T‑asymptotic regularity of an inexact generalized Halpern iteration, a viscosity…
Quantitative results on a generalized viscosity approximation method
Paulo Firmino, Laurentiu Leustean
In this paper, we study, in a nonlinear setting, the asymptotic behaviour of a generalized viscosity approximation method associated with a countable family of nonexpansive mapping…
Matching logic -- a new axiomatization
LaurenÅ£iu LeuÅtean, Dafina TrufaÅ
In these notes we propose a new, simpler proof system for first-order matching logic with application and definedness. The new proof system is inspired by Tarski's axiomatization f…
Notes on applicative matching logic
LaurenÅ£iu LeuÅtean
Matching logic (ML) was developed by Grigore RoÅu and collaborators as a logic for defining the formal semantics of programming languages and for specifying and reasoning about th…
Rates of (T-)asymptotic regularity of the generalized Krasnoselskii-Mann-type iteration
Paulo Firmino, Laurentiu Leustean
In this paper we use proof mining methods to compute rates of (-)asymptotic regularity of the generalized Krasnoselskii-Mann-type iteration associated to a nonexpansive mapping…
Proceedings Eighth Symposium on Working Formal Methods
Mircea Marin, LaurenÅ£iu LeuÅtean
The Working Formal Methods Symposium (FROM) is a series of workshops that aim to bring together researchers and practitioners who work on formal methods by contributing new theoret…