{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:07:43Z","timestamp":1725487663699},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540660866"},{"type":"electronic","value":"9783540487548"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48754-9_18","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:20:56Z","timestamp":1184602856000},"page":"186-201","source":"Crossref","is-referenced-by-count":1,"title":["Partial Functions in an Impredicative Simple Theory of Types"],"prefix":"10.1007","author":[{"given":"Paul C.","family":"Gilmore","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,11]]},"reference":[{"key":"18_CR1","unstructured":"Peter B. Andrews. An Introduction to Mathematical Logic and Type Theory: to Truth Through Proof, Academic Press, 1986."},{"key":"18_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1007\/BFb0012885","volume-title":"9\u2019th International Conference on Automated Deduction (CADE)","author":"P. B. Andrews","year":"1988","unstructured":"Peter B. Andrews, Sunil Issar, Daniel Nesmith, & Frank Pfenning. The TPS Theorem Proving System, 9\u2019th International Conference on Automated Deduction (CADE), volume 310, Lecture Notes in Computer Science, E. Lusk & R. Overbeek (Eds), 760\u2013761, Springer-Verlag 1988."},{"key":"18_CR3","unstructured":"H.P. Barendregt. The Lambda Calculus, Its Syntax and Semantics, Revised Edition. North-Holland. 1985."},{"key":"18_CR4","first-page":"149","volume":"IX","author":"A. Church","year":"1939","unstructured":"Alonzo Church. Schr\u00f6der\u2019s Anticipation of the Simple Theory of Types. The Journal of Unified Science (Erkenntnis) Vol IX, 149\u2013152, 1939.","journal-title":"The Journal of Unified Science (Erkenntnis)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A. Church","year":"1940","unstructured":"Alonzo Church. A Formulation of the Simple Theory of Types, J. Sym. Logic, 5, 56\u201368, 1940.","journal-title":"J. Sym. Logic"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.2307\/2274487","volume":"55","author":"W. M. Farmer","year":"1990","unstructured":"William M. Farmer, A Partial Functions Version of Church\u2019s Simple Theory of Types, J. Sym. Logic, 55, 1269\u20131290, 1990.","journal-title":"J. Sym. Logic"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.2307\/2274063","volume":"51","author":"P. C. Gilmore","year":"1986","unstructured":"Paul C. Gilmore. Natural Deduction Based Set Theories: A New Resolution of the Old Paradoxes, J.Sym. Logic, 51, 393\u2013411, 1986.","journal-title":"J.Sym. Logic"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Paul C. Gilmore. An Impredicative Simple Theory of Types, presented at the Fourteenth Workshop on Mathematical Foundations for Programming Systems, Queen Mary College, London, May 1998. The paper is available at: http:\/\/www.cs.ubc.ca\/spider\/gilmore","DOI":"10.1007\/3-540-48754-9_18"},{"key":"18_CR9","unstructured":"Paul C. Gilmore. Cut-Elimination for an Impredicative Simple Theory of Types, July 1998. The paper is to appear in the Journal of Symbolic Logic and is available at: http:\/\/www.cs.ubc.ca\/spider\/gilmore"},{"key":"18_CR10","unstructured":"Paul C. Gilmore. A Foundation for the Entity Relationship Approach: How and Why, Proceedings of the 6th Entity Relationship Conference, S.T. March (Ed.), North-Holland 95\u2013113, 1988."},{"key":"18_CR11","unstructured":"An Impredicative Higher Order Logic and Some Applications, a monograph on ITT in preparation."},{"key":"18_CR12","first-page":"73","volume-title":"VLSI Specification, Verification and Synthesis","author":"M. J.C. Gordon","year":"1987","unstructured":"Michael J.C. Gordon. A Proof Generating System for Higher-order Logic, VLSI Specification, Verification and Synthesis, G. Birtwistle, P. Subrahmanyam, Eds., Academic Publishers, Boston, pp. 73\u2013128, 1987. Also, University of Cambridge Computer Laboratory Technical Report No. 103"},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BFb0105405","volume":"1125","author":"M. Gordon","year":"1996","unstructured":"Mike Gordon. Set Theory, Higher Order Logic or Both? The 1996 International Conference on Theorem Proving in Higher order Logics, Lecture Notes in Computer Science No. 1125, pp191\u2013202, Springer-Verlag, 1996.","journal-title":"Lecture Notes in Computer Science"},{"key":"18_CR14","volume-title":"The PVS Specification Language (Beta Release)","author":"S. Owre","year":"1993","unstructured":"S. Owre, N. Shankar, and J. M. Rushby. The PVS Specification Language (Beta Release), Computer Science Laboratory, SRI International, Menlo Park CA 94025, June 14, 1993."},{"key":"18_CR15","unstructured":"Willard Van Orman Quine, Mathematical Logic, Revised Edition, Harvard University Press, 1951."},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"305","DOI":"10.2307\/2963525","volume":"25","author":"K. Sch\u00fctte","year":"1960","unstructured":"K. Sch\u00fctte. Syntactical and Semantical Properties of Simple Type Theory, J. Sym. Logic, 25, 305\u2013326, 1960.","journal-title":"J. Sym. Logic"},{"key":"18_CR17","first-page":"625","volume":"16","author":"W. Sellars","year":"1963","unstructured":"Wilfred Sellars. Abstract Entities, Rev. of Metaphysics, vol. 16, 625\u2013671, 1963.","journal-title":"Rev. of Metaphysics"},{"key":"18_CR18","first-page":"67","volume":"17","author":"W. Sellars","year":"1963","unstructured":"Wilfred Sellars. Classes as Abstract Entities and the Russell Paradox, Rev. of Metaphysics, vol. 17, 67\u201390, 1963.","journal-title":"Rev. of Metaphysics"},{"key":"18_CR19","unstructured":"Joseph R. Shoenfield, Mathematical Logic, Addison-Wesley, 1967."},{"key":"18_CR20","unstructured":"Ernst Zermelo, Investigations in the Foundations of Set Theory, From Frege to G\u00f6del, Ed. Jean van Heijenoort, Harvard University Press, 199\u2013215, 1967."}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48754-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T18:44:38Z","timestamp":1708109078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48754-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660866","9783540487548"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48754-9_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}