PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 14, 20260 citationsOpen Access

The Recursive Admissibility Guard (RAG): A Stability Constraint for Self-Referential Reasoning within the Paton System

View Full Paper
APAndrew John Paton

Key Points

  • The aim is to formalise the Recursive Admissibility Guard (RAG) to enhance stability in self-referential reasoning.
  • Developed RAG as a machinery-layer component within the Paton System.
  • Implemented calibration frequency and observable re-anchoring.
  • Enforced external constraint injection for stability.
  • Established termination protocols upon reaching stability within tolerance bounds.
  • RAG successfully stabilises recursive reasoning processes.
  • Maintains structural viability without altering existing models.
  • Functions as a non-interfering overlay applicable across various domains.

Abstract

This paper formalises the Recursive Admissibility Guard (RAG) as a machinery-layer component within the Paton System. RAG stabilises recursive or self-referential reasoning by enforcing calibration frequency, observable re-anchoring, external constraint injection, and termination upon stability within tolerance bounds. The construct operates as a non-interfering admissibility overlay applicable across domains without modifying underlying physical or theoretical models. Positioned alongside Paton Compass, Paton Assist, Structural Honesty Gate, and Viability Permission Gate, the RAG preserves recursive integrity while maintaining domain neutrality and structural viability.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Andrew John Paton (2026) studied this question.

synapsesocial.com/papers/699011032ccff479cfe57587https://doi.org/10.5281/zenodo.18625007
Ask AI
Helpful
Bookmark
Share
View Full Paper