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

Howard A. Blair

Research output: Contribution to journal › Article › peer-review

ASJC Scopus subject areas

@article{2ad2abf45912437db9fce4fa415b40c1,

title = "The recursion-theoretic complexity of the semantics of predicate logic as a programming language",

author = "Blair, {Howard A.}",

year = "1982",

doi = "10.1016/S0019-9958(82)91234-7",

language = "English (US)",

volume = "54",

pages = "25--47",

journal = "Information and Control",

issn = "0019-9958",

publisher = "Elsevier",

number = "1-2",

}

TY - JOUR

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

AU - Blair, Howard A.

PY - 1982

Y1 - 1982

UR - http://www.scopus.com/inward/record.url?scp=0020150554&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020150554&partnerID=8YFLogxK

U2 - 10.1016/S0019-9958(82)91234-7

DO - 10.1016/S0019-9958(82)91234-7

M3 - Article

AN - SCOPUS:0020150554

SN - 0019-9958

VL - 54

SP - 25

EP - 47

JO - Information and Control

JF - Information and Control

IS - 1-2

ER -