Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter B. Andrews
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, PA, USA
- award (2003): Herbrand Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j15]Peter B. Andrews, Chad E. Brown:
TPS: A hybrid automatic-interactive system for developing proofs. J. Appl. Log. 4(4): 367-395 (2006)- 2005
- [c14]Peter B. Andrews:
Proving Theorems of Type Theory Automatically with TPS. AAAI 2005: 1676-1677 - [c13]Peter B. Andrews:
Some Reflections on Proof Transformations. Mechanizing Mathematical Reasoning 2005: 14-29 - 2004
- [j14]Peter B. Andrews, Chad E. Brown, Frank Pfenning, Matthew Bishop, Sunil Issar, Hongwei Xi:
ETPS: A System to Help Students Write Formal Proofs. J. Autom. Reason. 32(1): 75-92 (2004) - 2003
- [j13]Peter B. Andrews:
Herbrand Award Acceptance Speech. J. Autom. Reason. 31(2): 169-187 (2003) - 2001
- [p1]Peter B. Andrews:
Classical Type Theory. Handbook of Automated Reasoning 2001: 965-1007 - 2000
- [c12]Peter B. Andrews, Matthew Bishop, Chad E. Brown:
System Description: TPS: A Theorem Proving System for Type Theory. CADE 2000: 164-169 - [c11]Peter B. Andrews, Chad E. Brown:
Tutorial: Using TPS for Higher-Order Theorem Proving and ETPS for Teaching Logic. CADE 2000: 511-512
1990 – 1999
- 1998
- [c10]Matthew Bishop, Peter B. Andrews:
Selectively Instantiating Definitions. CADE 1998: 365-380 - 1996
- [j12]Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, Hongwei Xi:
TPS: A Theorem-Proving System for Classical Type Theory. J. Autom. Reason. 16(3): 321-353 (1996) - [c9]Peter B. Andrews, Matthew Bishop:
On Sets, Types, Fixed Points, and Checkerboards. TABLEAUX 1996: 1-15 - 1993
- [c8]Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, Hongwei Xi:
TPS: An Interactive and Automatic Tool for Proving Theorems of Type Theory. HUG 1993: 366-370 - 1991
- [j11]Peter B. Andrews:
More on the Problem of Finding a Mapping between Clause Representation and Natural Deduction Representation. J. Autom. Reason. 7(2): 285-286 (1991) - 1990
- [c7]Peter B. Andrews, Sunil Issar, Dan Nesmith, Frank Pfenning:
The TPS Theorem Proving System. CADE 1990: 641-642
1980 – 1989
- 1989
- [j10]Peter B. Andrews:
On Connections and Higher-Order Logic. J. Autom. Reason. 5(3): 257-291 (1989) - 1988
- [c6]Peter B. Andrews, Sunil Issar, Daniel Nesmith, Frank Pfenning:
The TPS Theorem Proving System. CADE 1988: 760-761 - 1986
- [b1]Peter B. Andrews:
An introduction to mathematical logic and type theory - to truth through proof. Computer science and applied mathematics, Academic Press 1986, ISBN 978-0-12-058535-9, pp. I-XV, 1-304 - [c5]Peter B. Andrews:
Connections and Higher-Order Logic. CADE 1986: 1-4 - [c4]Peter B. Andrews, Frank Pfenning, Sunil Issar, Carl P. Klapper:
The TPS Theorem Proving System. CADE 1986: 663-664 - 1982
- [c3]Dale A. Miller
, Eve Longini Cohen, Peter B. Andrews:
A Look at TPS. CADE 1982: 50-69 - 1981
- [j9]Peter B. Andrews:
Theorem Proving via General Matings. J. ACM 28(2): 193-214 (1981) - 1980
- [c2]Peter B. Andrews:
Transforming Matings into Natural Deduction Proofs. CADE 1980: 281-292
1970 – 1979
- 1977
- [c1]Peter B. Andrews, Eve Longini Cohen:
Theorem Proving in Type Theory. IJCAI 1977: 566 - 1976
- [j8]Peter B. Andrews:
Refutations by Matings. IEEE Trans. Computers 25(8): 801-807 (1976) - 1974
- [j7]Peter B. Andrews:
Resolution and the consistency of analysis. Notre Dame J. Formal Log. 15(1): 73-84 (1974) - 1972
- [j6]Peter B. Andrews:
General Models, Descriptions, and Choice in Type Theory. J. Symb. Log. 37(2): 385-394 (1972) - [j5]Peter B. Andrews:
General Models and Extensionality. J. Symb. Log. 37(2): 395-397 (1972) - 1971
- [j4]Peter B. Andrews:
Resolution in Type Theory. J. Symb. Log. 36(3): 414-432 (1971)
1960 – 1969
- 1968
- [j3]Peter B. Andrews:
Resolution With Merging. J. ACM 15(3): 367-381 (1968) - [j2]Peter B. Andrews:
A Correction Concerning Resolution. J. ACM 15(4): 720 (1968) - [j1]Peter B. Andrews:
On Simplifying the Matrix of a WFF. J. Symb. Log. 33(2): 180-192 (1968)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-27 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
