Minimal from Classical Proofs

The c u t t i n g p l a n e p r o o f System w i t h b o u n d e d degree of f a l s i t y A . Goerdt 119 D e n o t a t i o n a l versus d e c l a r a t i v e semantics f o r f u n c t i o n a l p r o g r a m m i n g J . C . Gonzalez Moreno, M . T . Hortala Gonzalez and M . Rodriguez Artalejo 134 O n t r a n s i t i v e c l o s u r e l o g i c E . Grädel 149 Some aspects o f t h e p r o b a b i l i s t i c b e h a v i o r of v a r i a n t s of r e s o l u t i o n P. Heusch and E . Speckenmeyer 164 Safe q u e r i e s i n r e l a t i o n a l databases w i t h f u n c t i o n s J . Hirshfeld 173 L o g i c a l i n f e r e n c e a n d p o l y h e d r a l p r o j e c t i o n J . N . Hooker 184 S t a h l e l o g i c B . Hösli 201 A t r a n s f o r m a t i o n a l m e t h o d o l o g y f o r p r o v i n g t e r m i n a t i o n of l o g i c p r o g r a m s M . R. K . Krishna Rao, D . Kapur and R. K . Shyamasundar 213 P l a u s i b i l i t y l o g i c D. Lehmann 227