A Proof-theoretic Analysis of Goal-directed Provability

DOI10.1093/LOGCOM/4.1.69MaRDI QIDQ4286216zbMATH OpenOpenAlexFDO

Authors 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 proofgoal-directed proofintuitionistic predicate logic

Mathematics Subject Classification ID

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

Recommendations

• Uniform proofs as a foundation for logic programming
• Uniform provability in classical logic
• On goal-directed provability in classical logic
• An Intuitionistic Predicate Logic Theorem Prover
• Goal-directed proof theory

Cited in

(8)

• Correspondences between classical, intuitionistic and uniform provability
• Proof-search in type-theoretic languages: An introduction
• Cut elimination for the unified logic
• Uniform proofs as a foundation for logic programming
• On goal-directed provability in classical logic
• Uniform provability in classical logic
• An Interactive Driver for Goal-directed Proof Strategies
• Computer Science Logic

Describes a project that uses

Uses Software

• ETPS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286216)