article · 2006
IMPLEMENTING REFLECTION IN NUPRL
Cited by 0Abstract and details only
Abstract
Reflection is the ability of some entity to describe itself. In a logical context, it is the ability of a logic to reason about itself. Reflection is, therefore, placed at the core of meta-mathematics, making it an important part of formal reasoning; where it revolves mainly around syntax and semantics — the main challenge is in making the syntax of the logic become part of its semantic domain. Given its importance, it is surprising that logical computer systems tend to avoid the subject, or provide poor tools for reflective work. This is in sharp contrast to the area of programming languages, where reflection is well researched and used in a variety of ways where it plays an central role. One factor in making reflection inaccessible in logical systems is the relative difficulty that is immediately encountered when formalizing syntax: dealing with formal syntax means dealing with structures that involve bindings, and in a logical context it seems natural to use the same formal tools to describe syntax — often limiting the usability of such formalizations to specific theories and toy examples. Gödel numbers are an example for a reflective formalism that serves its purpose, yet is impractical as a
Cite this paper
(2006). IMPLEMENTING REFLECTION IN NUPRL.
“IMPLEMENTING REFLECTION IN NUPRL.” 2006.
2006. “IMPLEMENTING REFLECTION IN NUPRL.”
(2006) ‘IMPLEMENTING REFLECTION IN NUPRL’.
@article{anon2006implementing,
title = {{IMPLEMENTING REFLECTION IN NUPRL}},
year = {2006}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.