{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:52Z","timestamp":1740099172408,"version":"3.37.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030021481"},{"type":"electronic","value":"9783030021498"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-02149-8_6","type":"book-chapter","created":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T17:25:34Z","timestamp":1538760334000},"page":"87-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Decidability of Equational Theories for Subsignatures of Relation Algebra"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2983-4178","authenticated-orcid":false,"given":"Robin","family":"Hirsch","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,6]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/BF01225472","volume":"33","author":"H Andr\u00e9ka","year":"1995","unstructured":"Andr\u00e9ka, H., Bredikhin, D.: The equational theory of union-free algebras of relations. Algebra Universalis 33, 516\u2013532 (1995)","journal-title":"Algebra Universalis"},{"issue":"66","key":"6_CR2","doi-asserted-by":"publisher","first-page":"0","DOI":"10.1090\/memo\/0066","volume":"0","author":"Robert Berger","year":"1966","unstructured":"Berger, R.: The undecidability of the domino problem, volume 66 of Memoirs. Amer. Math. Soc., Providence, Rhode Island (1966)","journal-title":"Memoirs of the American Mathematical Society"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1112\/jlms\/s1-28.1.76","volume":"28","author":"T Evans","year":"1953","unstructured":"Evans, T.: Embedability and the word problem. J. London Math. Soc. 28, 76\u201380 (1953)","journal-title":"J. London Math. Soc."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1090\/S0002-9947-99-02264-3","volume":"353","author":"R Hirsch","year":"2001","unstructured":"Hirsch, R., Hodkinson, I.: Representability is not decidable for finite relation algebras. Trans. Amer. Math. Soc. 353, 1403\u20131425 (2001)","journal-title":"Trans. Amer. Math. Soc."},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.2178\/jsl.7704090","volume":"77","author":"R Hirsch","year":"2012","unstructured":"Hirsch, R., Jackson, M.: Some undecidable problems on representability as binary relations. J. Symbolic Logic 77(4), 1211\u20131244 (2012)","journal-title":"J. Symbolic Logic"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Hirsch, R., Mikulas, S.: Ordered domain algebras. J. Appl. Logic (2013)","DOI":"10.1016\/j.jal.2013.04.002"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"1961","DOI":"10.1016\/j.jpaa.2009.02.011","volume":"213","author":"M Jackson","year":"2009","unstructured":"Jackson, M., Volkov, M.: Undecidable word problems for completely 0-simple semigroups. J. Pure Appl. Algebra 213, 1961\u20131978 (2009)","journal-title":"J. Pure Appl. Algebra"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01049412","volume":"4","author":"A Kurucz","year":"2018","unstructured":"Kurucz, A., Nemeti, I., Sain, I., Simon, A.: Decidable and undecidable modal logics with a binary modality. J. Logic Lang. Inf. 4, 191\u2013206 (2018)","journal-title":"J. Logic Lang. Inf."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00012-016-0409-9","volume":"76","author":"M Neuzerling","year":"2016","unstructured":"Neuzerling, M.: Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups. Algebra Universalis 76, 431\u2013443 (2016)","journal-title":"Algebra Universalis"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02149-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T17:27:09Z","timestamp":1538760429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02149-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030021481","9783030021498"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02149-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"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":"Groningen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ramics-conference.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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"70% - 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"}},{"value":"4.06","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4.17","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"1 full invited talk","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}