The author discusses two rules of definitional reflection: the logical version of definitional
reflection, as used in the extended logic programming language GCLA, and the omega …

Variable binding is a prevalent feature of the syntax and proof theory of many logical
systems. In this paper, we define a programming language that provides intrinsic support for …

In recent work Baader has shown that a certain description logic with conjunction, existential
quantification and with circular definitions has a polynomial time subsumption problem both …

The authors lay the foundations for reasoning about proofs whose steps include both
invocations of programs to build subproofs (tactics) and references to representations of …

Much effort has been recently devoted to the study of polytime formal (and especially logical)
systems. The purpose of such systems is manyfold. On the theoretical side, they provide a …

An important tool for controlling search in an object logic is the use of structured theory
presentations. In order to apply these ideas to the setting of a logical framework, the authors …

The relationship between signed formulas and annotated logics, two approaches that some
authors have used to analyze multiple-valued logics (MVLs), is explored. A special case of …

The theory of cut-free sequent proofs has been used to motivate and justify the design of a
number of logic programming languages. Two such languages,/spl lambda/Prolog and its …

A construction principle for natural deduction systems for arbitrary, finitely-many-valued first
order logics is exhibited. These systems are systematically obtained from sequent calculi …

We introduce the concept of reflection principle as a knowledge representation paradigm in
a computational logic setting. Reflection principles are expressed as certain kinds of logic …