{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:22:55Z","timestamp":1648855375555},"reference-count":23,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T00:00:00Z","timestamp":1373932800000},"content-version":"vor","delay-in-days":593,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1016\/j.apal.2011.06.005","type":"journal-article","created":{"date-parts":[[2011,7,25]],"date-time":"2011-07-25T22:33:58Z","timestamp":1311633238000},"page":"1001-1034","source":"Crossref","is-referenced-by-count":6,"title":["CERES in higher-order logic"],"prefix":"10.1016","volume":"162","author":[{"given":"Stefan","family":"Hetzl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Leitsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Weller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.apal.2011.06.005_br000005","series-title":"Proofs from the Book","author":"Aigner","year":"1999"},{"issue":"3","key":"10.1016\/j.apal.2011.06.005_br000010","doi-asserted-by":"crossref","first-page":"414","DOI":"10.2307\/2269949","article-title":"Resolution in type theory","volume":"36","author":"Andrews","year":"1971","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/j.apal.2011.06.005_br000015","series-title":"LPAR 2008","first-page":"451","article-title":"Cut elimination for first order G\u00f6del logic by hyperclause resolution","volume":"vol. 5330","author":"Baaz","year":"2008"},{"key":"10.1016\/j.apal.2011.06.005_br000020","series-title":"Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2004","first-page":"481","article-title":"Cut-elimination: experiments with ceres","volume":"vol. 3452","author":"Baaz","year":"2005"},{"key":"10.1016\/j.apal.2011.06.005_br000025","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.tcs.2008.02.043","article-title":"Ceres: an analysis of F\u00fcrstenberg\u2019s proof of the infinity of primes","volume":"403","author":"Baaz","year":"2008","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"10.1016\/j.apal.2011.06.005_br000030","doi-asserted-by":"crossref","first-page":"353","DOI":"10.3233\/FI-1994-2044","article-title":"Skolemization and proof complexity","volume":"20","author":"Baaz","year":"1994","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"10.1016\/j.apal.2011.06.005_br000035","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1006\/jsco.1999.0359","article-title":"Cut-elimination and redundancy-elimination by resolution","volume":"29","author":"Baaz","year":"2000","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/j.apal.2011.06.005_br000040","series-title":"Proceedings of LPAR 2004","first-page":"1","article-title":"Ceres in many-valued logics","volume":"vol. 3452","author":"Baaz","year":"2005"},{"issue":"4","key":"10.1016\/j.apal.2011.06.005_br000045","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.2178\/jsl\/1102022211","article-title":"Higher-order semantics and extensionality","volume":"69","author":"Benzm\u00fcller","year":"2004","journal-title":"Journal of Symbolic Logic"},{"issue":"1\u20132","key":"10.1016\/j.apal.2011.06.005_br000050","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/A:1020840027781","article-title":"Comparing approaches to resolution based higher-order theorem proving","volume":"133","author":"Benzm\u00fcller","year":"2002","journal-title":"Synthese"},{"issue":"2","key":"10.1016\/j.apal.2011.06.005_br000055","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2307\/2266170","article-title":"A formulation of the simple theory of types","volume":"5","author":"Church","year":"1940","journal-title":"Journal of Symbolic Logic"},{"issue":"1","key":"10.1016\/j.apal.2011.06.005_br000060","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1023\/A:1027357912519","article-title":"Theorem proving modulo","volume":"31","author":"Dowek","year":"2003","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/j.apal.2011.06.005_br000065","series-title":"Labelled Deductive Systems","volume":"vol. I","author":"Gabbay","year":"1996"},{"issue":"1","key":"10.1016\/j.apal.2011.06.005_br000070","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/BF01201353","article-title":"Untersuchungen \u00fcber das logische Schlie\u00dfen I","volume":"39","author":"Gentzen","year":"1935","journal-title":"Mathematische Zeitschrift"},{"issue":"1","key":"10.1016\/j.apal.2011.06.005_br000075","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF01201363","article-title":"Untersuchungen \u00fcber das logische Schlie\u00dfen II","volume":"39","author":"Gentzen","year":"1935","journal-title":"Mathematische Zeitschrift"},{"key":"10.1016\/j.apal.2011.06.005_br000080","series-title":"Proof Theory and Logical Complexity","author":"Girard","year":"1987"},{"key":"10.1016\/j.apal.2011.06.005_br000085","unstructured":"Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel\u00a0Paleo, CERES in second-order logic, Technical report, Vienna University of Technology, 2008."},{"key":"10.1016\/j.apal.2011.06.005_br000090","series-title":"Intelligent Computer Mathematics","first-page":"462","article-title":"Herbrand sequent extraction","volume":"vol. 5144","author":"Hetzl","year":"2008"},{"key":"10.1016\/j.apal.2011.06.005_br000095","series-title":"Logical Foundations of Computer Science","first-page":"214","article-title":"A clausal approach to proof analysis in second-order logic","volume":"vol. 5407","author":"Hetzl","year":"2009"},{"issue":"4","key":"10.1016\/j.apal.2011.06.005_br000100","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF00370646","article-title":"A compact representation of proofs","volume":"46","author":"Miller","year":"1987","journal-title":"Studia Logica"},{"issue":"1","key":"10.1016\/j.apal.2011.06.005_br000105","doi-asserted-by":"crossref","first-page":"98","DOI":"10.2178\/jsl\/1174668386","article-title":"Intensional models for the theory of types","volume":"72","author":"Muskens","year":"2007","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/j.apal.2011.06.005_br000110","series-title":"Induction and Analogy in Mathematics","volume":"vol. 1","author":"Polya","year":"1954"},{"key":"10.1016\/j.apal.2011.06.005_br000115","series-title":"Basic Proof Theory","author":"Troelstra","year":"2000"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007211000807?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007211000807?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T16:52:11Z","timestamp":1592758331000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007211000807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":23,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["S0168007211000807"],"URL":"https:\/\/doi.org\/10.1016\/j.apal.2011.06.005","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}