<--- Back to Details
First PageDocument Content
Logic / Mathematical logic / Abstraction / Non-classical logic / Modal logic / Automated theorem proving / Logic programming / Model theory / Admissible rule / Substitution / Unification / Intermediate logic
Date: 2016-06-10 10:39:23
Logic
Mathematical logic
Abstraction
Non-classical logic
Modal logic
Automated theorem proving
Logic programming
Model theory
Admissible rule
Substitution
Unification
Intermediate logic

A syntactic approach to unification in transitive reflexive modal logics Rosalie Iemhoff∗ June 10, 2016 Abstract

Add to Reading List

Source URL: www.phil.uu.nl

Download Document from Source Website

File Size: 341,21 KB

Share Document on Facebook

Similar Documents

AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT  INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING  1. I NTRODUCTION

AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING 1. I NTRODUCTION

DocID: 1vah4 - View Document

Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for

Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for

DocID: 1sXwT - View Document

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson

DocID: 1sOSK - View Document

Microsoft Word - BlankPage

Microsoft Word - BlankPage

DocID: 1rugC - View Document

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

DocID: 1rrok - View Document