Rules of Definitional Reflection
نویسنده
چکیده
This paper discusses two rules of definitional reflection: The “logical” version of definitional reflection as used in the extended logic programming language GCLA and the “ω”-version of definitional reflection as proposed by Eriksson and Girard. The logical version is a Left-introduction rule completely analogous to the Left-introduction rules for logical operators in Gentzen-style sequent systems, whereas the ω-version extends the logical version by a principle related to the ω-rule in arithmetic. Correspondingly, the interpretation of free variables differs between the two approaches, resulting in different principles of closure of inference rules under substitution. This difference is crucial for the computational interpretation of definitional reflection.
منابع مشابه
Finitary Partial Inductive Definitions as a General Logic
We describe how the calculus of partial inductive definitions is used to represent logics. This calculus includes the powerful principle of definitional reflection. We describe two conceptually different approaches to representing a logic, both making essential use of definitional reflection. In the deductive approach, the logic is defined by its inference rules. Only the succedent rules (in a ...
متن کاملGeneralized Definitional Reflection and the Inversion Principle
The term inversion principle goes back to Lorenzen who coined it in the early 1950s. It was later used by Prawitz and others to describe the symmetric relationship between introduction and elimination inferences in natural deduction, sometimes also called harmony. In dealing with the invertibility of rules of an arbitrary atomic production system, Lorenzen’s inversion principle has a much wider...
متن کاملInversion by Definitional Reflection and the Admissibility of Logical Rules
The inversion principle for logical rules expresses a relationship between introduction and elimination rules for logical constants. Hallnäs & Schroeder-Heister (1990, 1991) proposed the principle of definitional reflection, which embodies basic ideas of inversion in the more general context of clausal definitions. For the context of admissibility statements, this has been further elaborated by...
متن کاملA-Sufficient Substitutions in mixed Contents
In proof-systems based on calculi of Partial Inductive Definitions (PID) [6, 7, 8] the notion of an A-sufficient substitution is of central importance. Applying an A-sufficient substitution to an atom before computing its definiens is necessary for the rule of definitional reflection to be sound. E.g. in the programming language GCLA [1, 8] the substitutions computed in negated queries are rest...
متن کاملFacing the Inevitable?
This contribution aims at showing some of the advantages of taking a novel, broad and systemic view on constitutive rules based on a failure oriented analysis, relying on the notion of impasse. Basically, impasses can descend by two main kinds of causes: either a mismatch between rules (how things should be done) and facts (how things are actually done), or an internal contradiction among rules...
متن کامل