Blair, Howard A. The recursion-theoretic complexity of the semantics of predicate logic as a programming language. (English) Zbl 0527.03022 Inf. Control 54, 25-47 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 10 Documents MSC: 03D35 Undecidability and degrees of sets of sentences 03F20 Complexity of proofs 68T15 Theorem proving (deduction, resolution, etc.) (MSC2010) 68N01 General topics in the theory of software 03B35 Mechanization of proofs and logical operations Keywords:resolution principle; Herbrand interpretation; degree of unsolvability; PROLOG; programming in logic; logic program; Horn formulas Citations:Zbl 0139.123 PDF BibTeX XML Cite \textit{H. A. Blair}, Inf. Control 54, 25--47 (1982; Zbl 0527.03022) Full Text: DOI