The recursion-theoretic complexity of the semantics of predicate logic as a programming language

DOI10.1016/S0019-9958(82)91234-7zbMath0527.03022MaRDI QIDQ3043128

Howard A. Blair

Publication date: 1982

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

PROLOGresolution principleHorn formulaslogic programdegree of unsolvabilityHerbrand interpretationprogramming in logic

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Mechanization of proofs and logical operations (03B35) General topics in the theory of software (68N01) Complexity of proofs (03F20)

Related Items (10)

Definite clause programs are canonical (over a suitable domain) ⋮ Truth versus information in logic programming ⋮ The expressiveness of locally stratified programs ⋮ An equivalence preserving first order unfold/fold transformation system ⋮ On logical constraints in logic programming ⋮ Game characterizations of logic program properties ⋮ Sémantique logique et dénotationnelle des interpréteurs PROLOG ⋮ A slight strengthening of a theorem of Blair and Kunen ⋮ Equivalence-preserving first-order unfold/fold transformation systems ⋮ Fixpoint semantics for logic programming a survey

This page was built for publication: The recursion-theoretic complexity of the semantics of predicate logic as a programming language