Titlebook: Computational Logic and Proof Theory; 5th Kurt G?del Collo Georg Gottlob,Alexander Leitsch,Daniele Mundici Conference proceedings 19971st e

florid

Alogtime algorithms for tree isomorphism, comparison, and canonization, a natural ordering on trees. We present alternating logarithmic time algorithms for the tree isomorphism problem, the tree canonization problem and the tree comparison problem. As a consequence, there is a recursive enumeration of the alternating log time tree problems.

Opponent

Subtyping over a lattice (abstract),as a solution then there is a solution whose alternating dag is of polynomial size in the size of the original system. There are examples showing that the well known dag representation of types is not good enough for this purpose, already for the two-element lattice.

Vital-Signs

NaDSyL and some applications, completeness and the eliminability of cut are sketched along with three applications: The foundations for recursive definitions of well-founded and non-well founded predicates, classical and intuitionistic second order arithmetic, and a study of Cantor‘s diagonal argument and paradox.

vocation

寬度

Restart tableaux with selection function,ableau calculi which generalize these on the ground level. This makes differences and similarities between the calculi clearer and, in addition, gives insight into how properties of the calculi can be transferred among them. In particular, a precise borderline separating proof confluent from non-proof confluent variants is exhibited.

滲透

慟哭

aviator

heterogeneous

ENDOW