APS-final

Strategy III is sound only when the tabled entries are co-inductive predicates: furthermore, a proof certificate can always be constructed and it will be essentially a post-fixed

We illustrate several merits of the logical specifications permitted by this logic: they are natural and declarative; they contain no side-conditions concerning names of variables

Proposition 10 Every proof frame F has O(4 a ) planar axiom linkings which produce a proof structure, where a is the maximum number of positive and negative occurrences of an

Lindahl and Odelstad use constitutive norms to generate a particular kind of institutional facts, called intermediate con- cepts. Their combination is visualized in Figure 9

We present a short proof of the Alexandrov–Fenchel inequalities, which mixes elementary algebraic properties and convexity properties of mixed volumes of polytopes.. Published

Motile cilia, laterality and primary ciliary dyskinesia The plenary speaker Martina Brueckner (Yale University, USA) opened the scientific part of the meeting with an introduction

In this paper, we provide separation results for the computational hierarchy of a large class of algebraic “one-more” computational problems (e.g. the one-more discrete

To make precise the use of narrowing in the induction process, let us first in- troduce a few concepts and notations. Narrowing will be performed only with rewrite rules,