This is an expository introduction to an approach to theorem proving in higher-order logic based on establishing appropriate connections between subformulas of an expanded form of the theorem to be proved. Expansion trees and expansion proofs play key roles
AbstractAn inferential semantics for full Higher Order Logic (HOL) is proposed. The paper presents a...
We present a uniform procedure for proof search in classical logic, intuitionistic logic, various mo...
We introduce a new formalization of Higher-Order-Logic (abbreviated Hol), which we baptized Formath,...
Expansion trees are defined as generalizations of Herbrand instances for formulas in a nonextensiona...
Abstract: We present a new form of Herbrand's theorem which is centered around structures calle...
We give a first-order presentation of higher-order logic based on explicit substitutions. This prese...
The focus of this lecture series will be HOL, Church's higher-order logic, which is the core of...
The TPHOLs International Conference serves as a venue for the presentation of work in theorem provin...
Colloque avec actes et comité de lecture.We propose a first-order presentation of higher-order logic...
This paper describes a procedure for unification in extensional higher order logics. The procedure i...
International audienceDifferent automated theorem provers reason in various deductive systems and, t...
An inferential semantics for full Higher Order Logic (HOL) is proposed. The paper presents a constru...
AbstractWe introduce a necessary and sufficient condition for the ω-extensionality rule of higher-or...
International audienceWe propose a first-order presentation of higher-order logic based on explicit ...
We investigate several approaches to resolution based automated theorem proving in classical higher-...
AbstractAn inferential semantics for full Higher Order Logic (HOL) is proposed. The paper presents a...
We present a uniform procedure for proof search in classical logic, intuitionistic logic, various mo...
We introduce a new formalization of Higher-Order-Logic (abbreviated Hol), which we baptized Formath,...
Expansion trees are defined as generalizations of Herbrand instances for formulas in a nonextensiona...
Abstract: We present a new form of Herbrand's theorem which is centered around structures calle...
We give a first-order presentation of higher-order logic based on explicit substitutions. This prese...
The focus of this lecture series will be HOL, Church's higher-order logic, which is the core of...
The TPHOLs International Conference serves as a venue for the presentation of work in theorem provin...
Colloque avec actes et comité de lecture.We propose a first-order presentation of higher-order logic...
This paper describes a procedure for unification in extensional higher order logics. The procedure i...
International audienceDifferent automated theorem provers reason in various deductive systems and, t...
An inferential semantics for full Higher Order Logic (HOL) is proposed. The paper presents a constru...
AbstractWe introduce a necessary and sufficient condition for the ω-extensionality rule of higher-or...
International audienceWe propose a first-order presentation of higher-order logic based on explicit ...
We investigate several approaches to resolution based automated theorem proving in classical higher-...
AbstractAn inferential semantics for full Higher Order Logic (HOL) is proposed. The paper presents a...
We present a uniform procedure for proof search in classical logic, intuitionistic logic, various mo...
We introduce a new formalization of Higher-Order-Logic (abbreviated Hol), which we baptized Formath,...