{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:56:55Z","timestamp":1742950615370,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030510534"},{"type":"electronic","value":"9783030510541"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-51054-1_5","type":"book-chapter","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T19:02:39Z","timestamp":1593457359000},"page":"79-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Trakhtenbrot\u2019s Theorem in Coq"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4126-6975","authenticated-orcid":false,"given":"Dominik","family":"Kirst","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9860-7203","authenticated-orcid":false,"given":"Dominique","family":"Larchey-Wendling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,24]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59207-2","volume-title":"The Classical Decision Problem. Perspectives in Mathematical Logic","author":"E B\u00f6rger","year":"1997","unstructured":"B\u00f6rger, E., Gr\u00e4del, E., Gurevich, Y.: The Classical Decision Problem. Perspectives in Mathematical Logic. Springer, Heidelberg (1997)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-14052-5_13","volume-title":"Interactive Theorem Proving","author":"T Braibant","year":"2010","unstructured":"Braibant, T., Pous, D.: An efficient Coq Tactic for deciding kleene algebras. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 163\u2013178. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-14052-5_13"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ic.2011.12.003","volume":"211","author":"R Brochenin","year":"2012","unstructured":"Brochenin, R., Demri, S., Lozes, E.: On the almighty wand. Inf. Comput. 211, 106\u2013137 (2012)","journal-title":"Inf. Comput."},{"issue":"5","key":"5_CR4","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"75","author":"NG de Bruijn","year":"1972","unstructured":"de Bruijn, N.G.: Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Mathematicae (Proceedings) 75(5), 381\u2013392 (1972)","journal-title":"Indagationes Mathematicae (Proceedings)"},{"doi-asserted-by":"publisher","unstructured":"Calcagno, C., Yang, H., O\u2019Hearn, P.W.: Computability and complexity results for a spatial assertion language for data structures. In: Hariharan, Ramesh, Vinay, V., Mukund, Madhavan (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 108\u2013119. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45294-X_10","key":"5_CR5","DOI":"10.1007\/3-540-45294-X_10"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-39634-2_17","volume-title":"Interactive Theorem Proving","author":"C Cohen","year":"2013","unstructured":"Cohen, C.: Pragmatic quotient types in Coq. In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) Interactive Theorem Proving, pp. 213\u2013228. Springer, Berlin Heidelberg, Berlin, Heidelberg (2013)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-319-94821-8_15","volume-title":"Interactive Theorem Proving","author":"Y Forster","year":"2018","unstructured":"Forster, Y., Heiter, E., Smolka, G.: Verification of PCP-related computational reductions in Coq. In: Avigad, J., Mahboubi, A. (eds.) ITP 2018. LNCS, vol. 10895, pp. 253\u2013269. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-94821-8_15"},{"doi-asserted-by":"crossref","unstructured":"Forster, Y., Kirst, D., Smolka, G.: On synthetic undecidability in Coq, with an application to the Entscheidungs problem. In: International Conference on Certified Programs and Proofs, pp. 38\u201351. ACM (2019)","key":"5_CR8","DOI":"10.1145\/3293880.3294091"},{"unstructured":"Forster, Y., Kirst, D., Wehr, D.: Completeness theorems for first-order logic analysed in constructive type theory. In: Symposium on Logical Foundations Of Computer Science, 2020, Deerfield Beach, Florida, U.S.A. January 2020","key":"5_CR9"},{"doi-asserted-by":"crossref","unstructured":"Forster, Y., Larchey-Wendling, D.: Certified undecidability of intuitionistic linear logic via binary stack machines and minsky machines. In: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, pp. 104\u2013117. ACM (2019)","key":"5_CR10","DOI":"10.1145\/3293880.3294096"},{"unstructured":"Forster, Y., Larchey-Wendling, D., Dudenhefner, A., Heiter, E., Kirst, D., Kunze, F., Smolka, G., Spies, S., Wehr, D., Wuttke, M.: A Coq library of undecidable problems. In: CoqPL 2020. New Orleans, LA, United States (2020). \nhttps:\/\/github.com\/uds-psl\/coq-library-undecidability","key":"5_CR11"},{"unstructured":"Kirst, D., Larchey-Wendling, D.: Trakhtenbrot\u2019s Theorem in Coq, A Constructive Approach to Finite Model Theory (2020). \nhttps:\/\/arxiv.org\/abs\/2004.07390","key":"5_CR12"},{"unstructured":"Larchey-Wendling, D., Forster, Y.: Hilbert\u2019s tenth problem in Coq. In: 4th International Conference on Formal Structures for Computation and Deduction. LIPIcs, vol. 131, pp. 27:1\u201327:20, February 2019","key":"5_CR13"},{"key":"5_CR14","volume-title":"Elements of Finite Model Theory","author":"L Libkin","year":"2010","unstructured":"Libkin, L.: Elements of Finite Model Theory, 1st edn. Springer, Heidelberg (2010)","edition":"1"},{"doi-asserted-by":"crossref","unstructured":"L\u00f6wenheim, L.: \u00dcber M\u00f6glichkeiten im Relativkalk\u00fcl. Mathematische Annalen 76, 447\u2013470 (1915). \nhttp:\/\/eudml.org\/doc\/158703","key":"5_CR15","DOI":"10.1007\/BF01458217"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-319-22102-1_19","volume-title":"Interactive Theorem Proving","author":"P Maksimovi\u0107","year":"2015","unstructured":"Maksimovi\u0107, P., Schmitt, A.: HOCore in Coq. In: Urban, C., Zhang, X. (eds.) ITP 2015. LNCS, vol. 9236, pp. 278\u2013293. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-22102-1_19"},{"doi-asserted-by":"crossref","unstructured":"Sch\u00e4fer, S., Smolka, G., Tebbi, T.: Completeness and decidability of de Bruijn substitution algebra in Coq. In: Proceedings of the 2015 Conference on Certified Programs and Proofs, pp. 67\u201373. ACM (2015)","key":"5_CR17","DOI":"10.1145\/2676724.2693163"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-319-43144-4_23","volume-title":"Interactive Theorem Proving","author":"G Smolka","year":"2016","unstructured":"Smolka, G., Stark, K.: Hereditarily finite sets in constructive type theory. In: Blanchette, J.C., Merz, S. (eds.) ITP 2016. LNCS, vol. 9807, pp. 374\u2013390. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-43144-4_23"},{"doi-asserted-by":"crossref","unstructured":"Spies, S., Forster, Y.: Undecidability of higher-order unification formalised in Coq. In: International Conference on Certified Programs and Proofs, CPP 2020, New Orleans, USA, January 2020","key":"5_CR19","DOI":"10.1145\/3372885.3373832"},{"doi-asserted-by":"crossref","unstructured":"Stark, K., Sch\u00e4fer, S., Kaiser, J.: Autosubst 2: reasoning with multi-sorted de Bruijn terms and vector substitutions. In: International Conference on Certified Programs and Proofs, pp. 166\u2013180. ACM (2019)","key":"5_CR20","DOI":"10.1145\/3293880.3294101"},{"issue":"4","key":"5_CR21","first-page":"569","volume":"70","author":"BA Trakhtenbrot","year":"1950","unstructured":"Trakhtenbrot, B.A.: The impossibility of an algorithm for the decidability problem on finite classes. Dokl. Akad. Nok. SSSR 70(4), 569\u2013572 (1950)","journal-title":"Dokl. Akad. Nok. SSSR"},{"issue":"3","key":"5_CR22","doi-asserted-by":"publisher","first-page":"745","DOI":"10.2307\/2275782","volume":"61","author":"W Veldman","year":"1996","unstructured":"Veldman, W., Waaldijk, F.: Some elementary results in intutionistic model theory. J. Symbol. Logic 61(3), 745\u2013767 (1996)","journal-title":"J. Symbol. Logic"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/BFb0014566","volume-title":"Theoretical Aspects of Computer Software","author":"B Werner","year":"1997","unstructured":"Werner, B.: Sets in types, types in sets. In: Abadi, M., Ito, T. (eds.) TACS 1997. LNCS, vol. 1281, pp. 530\u2013546. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/BFb0014566"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51054-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T21:11:30Z","timestamp":1593465090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51054-1_5"}},"subtitle":["A Constructive Approach to Finite Model Theory"],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030510534","9783030510541"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51054-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Automated Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcar2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijcar2020.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"150","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.03","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.38","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11 system descriptions are also included. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}