{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:04Z","timestamp":1725455644360},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540571841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022565","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T01:14:45Z","timestamp":1131844485000},"page":"172-183","source":"Crossref","is-referenced-by-count":3,"title":["On different concepts of function introduction"],"prefix":"10.1007","author":[{"given":"Uwe","family":"Egly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0168-0072(92)90042-X","volume":"57","author":"M. Baaz","year":"1992","unstructured":"M. Baaz and A. Leitsch. Complexity of Resolution Proofs and Function Introduction. Annals of Pure and Applied Logic, 57:181\u2013215, 1992.","journal-title":"Annals of Pure and Applied Logic"},{"key":"19_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-90102-6","volume-title":"Automated Theorem Proving","author":"W. Bibel","year":"1987","unstructured":"W. Bibel. Automated Theorem Proving. Vieweg, Braunschweig, second edition, 1987.","edition":"second edition"},{"key":"19_CR3","volume-title":"Symbolic Logic and Mechanical Theorem Proving","author":"C. L. Chang","year":"1973","unstructured":"C. L. Chang and R. C. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, 1973."},{"key":"19_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-84222-0","volume-title":"Relative Complexities of First Order Calculi","author":"E. Eder","year":"1992","unstructured":"E. Eder. Relative Complexities of First Order Calculi. Vieweg, Braunschweig, 1992."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"U. Egly. Shortening Proofs by Quantifier Introduction. In A. Voronkov, editor, Proceedings of the International Conference on Logic Programming and Automated Reasoning, pages 148\u2013159. Springer Verlag, 1992.","DOI":"10.1007\/BFb0013057"},{"key":"19_CR6","volume-title":"Technical Report AIDA-93\u201309","author":"U. Egly","year":"1993","unstructured":"U. Egly. On Different Concepts of Function Introduction. Technical Report AIDA-93\u201309, FG Intellektik, FB Informatik, TH Darmstadt, 1993."},{"key":"19_CR7","volume-title":"volume 6 of Fundamental Studies in Computer Science","author":"D. W. Loveland","year":"1978","unstructured":"D. W. Loveland. Automated Theorem Proving: A Logical Basis, volume 6 of Fundamental Studies in Computer Science. North-Holland Publishing Company, Amsterdem, New York, Oxford, 1978."}],"container-title":["Lecture Notes in Computer Science","Computational Logic and Proof Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022565.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:49:03Z","timestamp":1607532543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022565"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540571841"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0022565","relation":{},"subject":[]}}