EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Weak Monotone Fixed Points for Positive–Negative Guarded Language Systems in a Length-Based Ultrametric Space

Laura Ajeti, Hristo Hristov, Atanas Ilchev, Boyan Zlatanov

Axioms · 13.06.2026 · 15 (6) · 440

DOI: 10.3390/axioms15060440 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Axioms, online erschienen am 13.06.2026. Verfasst von Laura Ajeti und 3 weiteren Autor:innen. Die Arbeit nennt 17 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We study positive–negative guarded systems of language equations over a fixed finite alphabet. The ambient space is the complete ultrametric space of all formal languages equipped with a length-based distance, where two languages are close whenever they agree on all words up to a sufficiently large length. The systems considered here contain both positive recursive dependencies and negative dependencies expressed through language complements. To handle this mixed structure, we introduce a suitable product order on pairs of languages and prove that the associated system operator has the weak monotone property. We show that the complement is an isometry for the length-based ultrametric and establish a signed wrapping estimate for guarded positive and negative language terms. These estimates lead to an ordered contraction principle for comparable pairs. As a consequence, the canonical lower and upper Picard iterations converge to the same limit, which is the unique fixed pair of the system. We also derive an explicit convergence rate and a finite-depth certification result: after a prescribed number of iterations, the approximants agree with the fixed-point semantics on all words below a given length. Additional symmetry assumptions are shown to force the unique fixed pair to be diagonal, reducing the system to a single language equation. Finally, we discuss an application to trace-based policies for tool-using AI agents. In this interpretation, finite executions of an agent are represented as words over an alphabet of observable tool-events, and the two components of the fixed point provide a stable semantics for policy-defined admissible and risky trace classes. The resulting framework gives a mathematically certified method for finite-depth analysis of recursive trace-based policies based on ultrametric fixed-point techniques.

Zitieren

APA

Ajeti, L., Hristov, H., Ilchev, A., & Zlatanov, B. (2026). Weak Monotone Fixed Points for Positive–Negative Guarded Language Systems in a Length-Based Ultrametric Space. Axioms, 15(6), 440. https://doi.org/10.3390/axioms15060440

Vancouver

Ajeti L, Hristov H, Ilchev A, Zlatanov B. Weak Monotone Fixed Points for Positive–Negative Guarded Language Systems in a Length-Based Ultrametric Space. Axioms. 2026;15(6):440. doi:10.3390/axioms15060440

BibTeX
@article{Ajeti2026,
  author = {Ajeti, Laura and Hristov, Hristo and Ilchev, Atanas and Zlatanov, Boyan},
  title = {Weak Monotone Fixed Points for Positive–Negative Guarded Language Systems in a Length-Based Ultrametric Space},
  journal = {Axioms},
  year = {2026},
  volume = {15},
  number = {6},
  pages = {440},
  doi = {10.3390/axioms15060440}
}
Kostenlos starten →