25 found
Order:
Disambiguations
Peter Andrews [16]Peter B. Andrews [12]
See also
  1.  35
    Resolution in Type Theory.Peter B. Andrews - 1971 - Journal of Symbolic Logic 36 (3):414-432.
  2.  51
    General Models and Extensionality.Peter B. Andrews - 1972 - Journal of Symbolic Logic 37 (2):395-397.
  3.  13
    An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof.M. Yasuhara & Peter B. Andrews - 1988 - Journal of Symbolic Logic 53 (1):312.
  4.  26
    Church's Type Theory.Peter Andrews - 2008 - Stanford Encyclopedia of Philosophy.
    Church’s type theory, aka simple type theory, is a formal logical language which includes classical first-order and propositional logic, but is more expressive in a practical sense. It is used, with some modifications and enhancements, in most modern applications of type theory. It is particularly well suited to the formalization of mathematics and other disciplines and to specifying and verifying hardware and software. It also plays an important role in the study of the formal semantics of natural language. When utilizing (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  5.  47
    General Models, Descriptions, and Choice in Type Theory.Peter B. Andrews - 1972 - Journal of Symbolic Logic 37 (2):385-394.
  6.  7
    TPS: A Hybrid Automatic-Interactive System for Developing Proofs.Peter B. Andrews & Chad E. Brown - 2006 - Journal of Applied Logic 4 (4):367-395.
  7.  10
    The Decision Problem. Solvable Classes of Quantificational Formulas.Peter B. Andrews - 1982 - Journal of Symbolic Logic 47 (2):452-453.
    Direct download  
     
    Export citation  
     
    Bookmark   15 citations  
  8.  3
    False Lemmas in Herbrand.Burton Dreben & Peter Andrews - 1966 - Journal of Symbolic Logic 31 (4):657-659.
  9.  18
    A. H. Lightstone. The Axiomatic Method. An Introduction to Mathematical Logic.Prentice-Hall, Inc., Englewood Cliffs, N.J., 1964, X + 246 Pp. [REVIEW]Peter Andrews - 1966 - Journal of Symbolic Logic 31 (1):106-108.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  10.  4
    A Note on the Theory of Propositional Types.Peter Andrews & A. Grzegorczyk - 1966 - Journal of Symbolic Logic 31 (3):502.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  11.  10
    Burton Dreben and Warren D. Goldfarb. The Decision Problem. Solvable Classes of Quantificational Formulas. Advanced Book Program. Addison-Wesley Publishing Company, Reading, Mass., 1979, Xii + 271 Pp. [REVIEW]Peter B. Andrews - 1982 - Journal of Symbolic Logic 47 (2):452-453.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  12.  11
    Burton Dreben and John Denton. A Supplement to Herbrand. The Journal of Symbolic Logic, Vol. 31 , Pp. 393–398.Peter Andrews - 1967 - Journal of Symbolic Logic 32 (4):521-522.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  13.  1
    Burton Dreben and Stål Aanderaa. Herbrand Analyzing Functions. Bulletin of the American Mathematical Society, Vol. 70 , Pp. 697–698. [REVIEW]Peter Andrews - 1968 - Journal of Symbolic Logic 32 (4):521.
  14.  8
    Dreben Burton S.. Solvable Surányi Subclasses: An Introduction to the Herbrand Theory. Proceedings of a Harvard Symposium on Digital Computers and Their Applications, 3-6 April 1961, The Annals of the Computation Laboratory of Harvard University, Vol. 31, Harvard University Press, Cambridge, Mass., 1962, Pp. 32–47. [REVIEW]Peter Andrews - 1965 - Journal of Symbolic Logic 30 (3):390-391.
  15.  4
    Grzegorczyk A.. A Note on the Theory of Prepositional Types. Fundamenta Mathematicae, Vol. 54 (1964), Pp. 27–29.Peter Andrews - 1966 - Journal of Symbolic Logic 31 (3):502-503.
  16.  22
    On Simplifying the Matrix of a WFF.Peter Andrews - 1968 - Journal of Symbolic Logic 33 (2):180-192.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  17.  11
    Provability in Elementary Type Theory.Peter B. Andrews - 1974 - Mathematical Logic Quarterly 20 (25‐27):411-418.
  18.  18
    Provability in Elementary Type Theory.Peter B. Andrews - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (25-27):411-418.
  19. Review: A. H. Lightstone, The Axiomatic Method. An Introduction to Mathematical Logic. [REVIEW]Peter Andrews - 1966 - Journal of Symbolic Logic 31 (1):106-108.
  20.  15
    Review: Burton Dreben, Warren D. Goldfarb, The Decision Problem. Solvable Classes of Quantificational Formulas. [REVIEW]Peter B. Andrews - 1982 - Journal of Symbolic Logic 47 (2):452-453.
  21. Review: Burton Dreben, Stal Aanderaa, Herbrand Analyzing Functions. [REVIEW]Peter Andrews - 1967 - Journal of Symbolic Logic 32 (4):521-521.
     
    Export citation  
     
    Bookmark  
  22.  7
    Richard Goldberg. On the Solvability of a Subclass of the Surányi Reduction Class. The Journal of Symbolic Logic, Vol. 28 No. 3 , Pp. 237–244.Peter Andrews - 1965 - Journal of Symbolic Logic 30 (3):391.
  23. Review: Richard Goldberg, On the Solvability of a Subclass of the Suranyi Reduction Class. [REVIEW]Peter Andrews - 1965 - Journal of Symbolic Logic 30 (3):391-391.
  24.  25
    W. V. Quine. A Proof Procedure for Quantification Theory. The Journal of Symbolic Logic, Vol. 20 , Pp. 141–149.Peter Andrews - 1966 - Journal of Symbolic Logic 31 (4):657.
  25.  4
    Resolution and the Consistency of Analysis.Peter B. Andrews - 1974 - Notre Dame Journal of Formal Logic 15 (1):73-84.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark