arXiv (All)
open access
The Semantic Elevation Operator and the Closure of the Undecidable Class under Preservation
The undecidability of a program's static semantic properties is governed by Rice's theorem. Self-modifying systems, however, require analysing not whether a property holds now, but whether it is preserved when the system rewrites itself. We formalise this transition through a semantic elevation oper
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Advanced Semantics#3436
- Expressive Power of Property Graph Constraint Languages#1084152
- Lógica como Epistemología en Condiciones de Laboratorio#691384
- First Philosophy: The Boundary Condition: A Geometric Derivation of Reality from the Logic of Distinction#91777
- A Formal Executable Semantics of Orc Using the K Framework#374965
Record · ID 998862
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive