{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:52:37Z","timestamp":1743047557678,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030435196"},{"type":"electronic","value":"9783030435202"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-43520-2_19","type":"book-chapter","created":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T23:08:28Z","timestamp":1585696108000},"page":"302-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computer-Supported Exploration of a Categorical Axiomatization of Modeloids"],"prefix":"10.1007","author":[{"given":"Lucca","family":"Tiemens","sequence":"first","affiliation":[]},{"given":"Dana S.","family":"Scott","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Benzm\u00fcller","sequence":"additional","affiliation":[]},{"given":"Miroslav","family":"Benda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,1]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Benda, M.: Modeloids. I. Trans. Am. Math. Soc. 250, 47\u201390 (1979). https:\/\/doi.org\/10.1090\/s0002-9947-1979-0530044-4","DOI":"10.1090\/s0002-9947-1979-0530044-4"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10817-018-09507-7","volume":"64","author":"C Benzm\u00fcller","year":"2020","unstructured":"Benzm\u00fcller, C., Scott, D.S.: Automating free logic in HOL, with an experimental application in category theory. J. Autom. Reason. 64(1), 53\u201372 (2020). https:\/\/doi.org\/10.1007\/s10817-018-09507-7","journal-title":"J. Autom. Reason."},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10817-013-9278-5","volume":"51","author":"JC Blanchette","year":"2013","unstructured":"Blanchette, J.C., B\u00f6hme, S., Paulson, L.C.: Extending sledgehammer with SMT solvers. J. Autom. Reasoning 51(1), 109\u2013128 (2013). https:\/\/doi.org\/10.1007\/s10817-013-9278-5","journal-title":"J. Autom. Reasoning"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-14052-5_11","volume-title":"Interactive Theorem Proving","author":"JC Blanchette","year":"2010","unstructured":"Blanchette, J.C., Nipkow, T.: Nitpick: a counterexample generator for higher-order logic based on a relational model finder. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 131\u2013146. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14052-5_11"},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-28788-4","DOI":"10.1007\/3-540-28788-4"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Howie, J.M.: Fundamentals of Semigroup Theory. Oxford University Press, Oxford (1995)","DOI":"10.1093\/oso\/9780198511946.001.0001"},{"key":"19_CR7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1515\/9783112708651-006","volume":"7","author":"J Kastl","year":"1979","unstructured":"Kastl, J.: Inverse categories. Algebraische Modelle, Kategorien und Gruppoide 7, 51\u201360 (1979)","journal-title":"Algebraische Modelle, Kategorien und Gruppoide"},{"key":"19_CR8","unstructured":"Lambert, K.: The definition of e! in free logic. In: Abstracts: The International Congress for Logic, Methodology and Philosophy of Science. Stanford University Press, Stanford (1960)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Lambert, K.: Free Logic: Selected Essays. Cambridge University Press, Cambridge (2002)","DOI":"10.1017\/CBO9781139165068"},{"key":"19_CR10","doi-asserted-by":"publisher","unstructured":"Lawson, M.V.: Inverse Semigroups. World Scientific (1998). https:\/\/doi.org\/10.1142\/3645","DOI":"10.1142\/3645"},{"key":"19_CR11","volume-title":"Elements of Finite Model Theory","author":"L Libkin","year":"2013","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2013)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Linckelmann, M.: On inverse categories and transfer in cohomology. Proc. Edinburgh Math. Soc. 56(1), 187\u2013210 (2012). https:\/\/doi.org\/10.1017\/s0013091512000211","DOI":"10.1017\/S0013091512000211"},{"key":"19_CR13","doi-asserted-by":"publisher","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL: A Proof Assistant for Higher-Order Logic. LNCS, vol.\u00a02283. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45949-9","DOI":"10.1007\/3-540-45949-9"},{"key":"19_CR14","unstructured":"Scott, D.: Existence and description in formal logic. In: Schoenman, R. (ed.) Bertrand Russell: Philosopher of the Century, pp. 181\u2013200. George Allen & Unwin, London (1967). Reprinted with additions in: Lambert, K. (ed.) Philosophical Application of Free Logic, pp. 28\u201348. Oxford Universitry Press (1991)"},{"key":"19_CR15","unstructured":"Tiemens, L.: Computer-supported Exploration of a Categorical Axiomatization of Miroslav Benda\u2019s Modeloids. Bachelor\u2019s thesis, Freie Universit\u00e4t Berlin (2019). https:\/\/www.mi.fu-berlin.de\/inf\/groups\/ag-ki\/Theses\/Completed-theses\/Bachelor-theses\/2019\/Tiemens\/BA-Tiemens2.pdf"},{"key":"19_CR16","unstructured":"Tiemens, L., Scott, D.S., Benzm\u00fcller, C., Benda, M.: Computer-supported exploration of a categorical axiomatization of modeloids. ArXiv abs\/1910.12863 (2019). https:\/\/arxiv.org\/abs\/1910.12863"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43520-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,3]],"date-time":"2024-08-03T05:15:51Z","timestamp":1722662151000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-43520-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030435196","9783030435202"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43520-2_19","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":"1 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RAMiCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Palaiseau","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":"26 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ramics18.gforge.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"29","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":"20","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":"0","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":"69% - 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":"4","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":"3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"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)"}}]}}