Switch to: References

Citations of:

Computability theory, semantics, and logic programming

Oxford: Clarendon Press (1987)

Add citations

You must login to add citations.
  1. Finitary inductively presented logics.Solomon Feferman - manuscript
    A notion of finitary inductively presented (f.i.p.) logic is proposed here, which includes all syntactically described logics (formal systems)met in practice. A f.i.p. theory FS0 is set up which is universal for all f.i.p. logics; though formulated as a theory of functions and classes of expressions, FS0 is a conservative extension of PRA. The aims of this work are (i)conceptual, (ii)pedagogical and (iii)practical. The system FS0 serves under (i)and (ii)as a theoretical framework for the formalization of metamathematics. The general approach (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
    We consider the informal concept of "computability" or "effective calculability" and two of the formalisms commonly used to define it, "(Turing) computability" and "(general) recursiveness". We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were first and are now used, their impact on nonspecialists, how their use will affect the future content of the subject of computability theory, and its connection to other related areas. After a careful (...)
    Download  
     
    Export citation  
     
    Bookmark   52 citations  
  • Pseudo-Boolean valued prolog.Melvin Fitting - 1988 - Studia Logica 47 (2):85-91.
    A generalization of conventional Horn clause logic programming is proposed in which the space of truth values is a pseudo-Boolean or Heyting algebra, whose members may be thought of as evidences for propositions. A minimal model and an operational semantics is presented, and their equivalence is proved, thus generalizing the classic work of Van Emden and Kowalski.
    Download  
     
    Export citation  
     
    Bookmark