منابع مشابه
Axioms in Definitional Calculi
This paper introduces a restricted form of the axiom rule in calculi of Partial Inductive Definitions (PID). The paper argues that in calculi of PIDs the distinction between atomic and non-atomic formulae is not as clear as in traditional sequent calculi. Therefore the common restriction of the axiom rule to the atomic case is not adequate for this type of calculi. A novel proviso for the axiom...
متن کاملDefinitional Trees
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure representing, at a high level of abstraction, a form of control. Its application solves a specific problem arising in the design and implementation of inherently sequential, lazy, functional programming languages based on rewriting. For example, we show how to extend the ...
متن کاملDefinitional Constraints
Certain constraints that should be interpreted as definitions or quasi-definitions can cause prediction problems for logics of action. Standard ways to avoid them rely on notions of priority in the minimization of fluent change. We offer an alternative approach based on belief revision. Revision is performed on the reduct of the system theory after isolating definitions, and the revised theory ...
متن کاملOmega-almost Boolean rings
In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.
متن کامل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 sys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1968
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093893522