A Proof-theoretic Analysis of Goal-directed Provability

DOI10.1093/logcom/4.1.69zbMath0793.03060OpenAlexW2035891539MaRDI QIDQ4286216

James Harland

Publication date: 21 August 1994

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/762274659754bbd2dd7e60e0401e9df9c4439bcf

zbMATH Keywords

cut-free proofintuitionistic predicate logicgoal-directed proof

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Logic programming (68N17)

Related Items (2)

Correspondences between classical, intuitionistic and uniform provability ⋮ Proof-search in type-theoretic languages: An introduction

Uses Software

• ETPS

This page was built for publication: A Proof-theoretic Analysis of Goal-directed Provability