<--- Back to Details
First PageDocument Content
Logic programming / Mathematics / Unification / Sequent / Linear logic / Admissible rule / Substitution / Logic / Mathematical logic / Automated theorem proving
Date: 2002-09-02 10:28:36
Logic programming
Mathematics
Unification
Sequent
Linear logic
Admissible rule
Substitution
Logic
Mathematical logic
Automated theorem proving

30 Years of Higher-Order Unification G´

Add to Reading List

Source URL: pauillac.inria.fr

Download Document from Source Website

File Size: 70,08 KB

Share Document on Facebook

Similar Documents

Proof theory / Mathematical logic / Logic / Mathematics / Sequent / Natural deduction / Cut-elimination theorem / Admissible rule / Proof complexity / Propositional calculus / Structural rule / Cut rule

Under consideration for publication in Math. Struct. in Comp. Science Complexity of Translations from Resolution to Sequent Calculus (Presentation-Only - Draft) Giselle Reis1 and Bruno Woltzenlogel Paleo2

DocID: 1xVA3 - View Document

social learning Abstract Social learning describes the process whereby individuals learn about a new and uncertain technology from the decisions and experiences of their neighbours. Because information must flow sequent

DocID: 1vmb1 - View Document

INL (instantial neighborhood logic) - tableau, sequent calculus, interpolation Junhua Yu () Tsinghua University (Beijing, China @ Steklov Mathematical Institute

DocID: 1v7WD - View Document

Dynamic Derivations for Sequent-Based Logical Argumentation Ofer ARIELI a and Christian STRASSER b of Computer Science, The Academic College of Tel-Aviv, Israel b Department of Philosophy and Moral Sciences, Ghent Univer

DocID: 1uBGP - View Document

A Sequent Calculus for Nominal Logic Murdoch Gabbay ´ LIX Ecole Polytechnique

DocID: 1tYXN - View Document