{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:13:29Z","timestamp":1760202809238,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662595329"},{"type":"electronic","value":"9783662595336"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-662-59533-6_4","type":"book-chapter","created":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T19:02:35Z","timestamp":1561230155000},"page":"53-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Rigid First-Order Hybrid Logic"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Blackburn","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Martins","sequence":"additional","affiliation":[]},{"given":"Mar\u00eda","family":"Manzano","sequence":"additional","affiliation":[]},{"given":"Antonia","family":"Huertas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,9]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10992-012-9260-4","volume":"43","author":"C Areces","year":"2014","unstructured":"Areces, C., Blackburn, P., Huertas, A., Manzano, M.: Completeness in hybrid type theory. J. Philos. Log. 43, 209\u2013238 (2014)","journal-title":"J. Philos. Log."},{"issue":"1\u20133","key":"4_CR2","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0168-0072(03)00059-9","volume":"124","author":"C Areces","year":"2003","unstructured":"Areces, C., Blackburn, P., Marx, M.: Repairing the interpolation theorem in quantified modal logic. Ann. Pure Appl. Log. 124(1\u20133), 287\u2013299 (2003)","journal-title":"Ann. Pure Appl. Log."},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10849-013-9184-6","volume":"23","author":"LS Barbosa","year":"2014","unstructured":"Barbosa, L.S., Martins, M.A., Carreteiro, M.: A Hilbert-style axiomatisation for equational hybrid logic. J. Log. Lang. Inf. 23(1), 31\u201352 (2014)","journal-title":"J. Log. Lang. Inf."},{"key":"4_CR4","series-title":"Studies in Universal Logic","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-319-09719-0_19","volume-title":"The Life and Work of Leon Henkin","author":"P Blackburn","year":"2014","unstructured":"Blackburn, P., Huertas, A., Manzano, M., J\u00f8rgensen, K.F.: Henkin and hybrid logic. In: Manzano, M., Sain, I., Alonso, E. (eds.) The Life and Work of Leon Henkin. SUL, pp. 279\u2013306. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-09719-0_19"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/3-540-45616-3_4","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"P Blackburn","year":"2002","unstructured":"Blackburn, P., Marx, M.: Tableaux for quantified hybrid logic. In: Egly, U., Ferm\u00fcller, C.G. (eds.) TABLEAUX 2002. LNCS (LNAI), vol. 2381, pp. 38\u201352. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45616-3_4"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s11225-006-9009-6","volume":"84","author":"P Blackburn","year":"2006","unstructured":"Blackburn, P., ten Cate, B.: Pure extensions, proof rules, and hybrid axiomatics. Studia Logica 84, 277\u2013322 (2006)","journal-title":"Studia Logica"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.2307\/2274487","volume":"55","author":"WM Farmer","year":"1990","unstructured":"Farmer, W.M.: A partial functions version of Church\u2019s simple theory of types. J. Symb. Log. 55(3), 1269\u20131291 (1990)","journal-title":"J. Symb. Log."},{"key":"4_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5292-1","volume-title":"First-Order Modal Logic","author":"M Fitting","year":"1998","unstructured":"Fitting, M., Mendelsohn, R.: First-Order Modal Logic. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/978-94-011-5292-1"},{"key":"4_CR9","unstructured":"Manzano, M., Huertas, A., Blackburn, P., Martins, M.: Hybrid partial type theory (2019, Submitted)"},{"issue":"6","key":"4_CR10","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1007\/s11225-018-9833-5","volume":"107","author":"Maria Manzano","year":"2018","unstructured":"Manzano, M., Martins, M., Huertas, A.: Completeness in equational hybrid propositional type theory. Studia Logica (2018). \nhttps:\/\/doi.org\/10.1007\/s11225-018-9833-5","journal-title":"Studia Logica"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-59533-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T15:02:52Z","timestamp":1575644572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-59533-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662595329","9783662595336"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-59533-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Utrecht","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic2019.sites.uu.nl\/","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":"60","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":"41","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":"6","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":"68% - 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":"2,3","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":"8","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)"}}]}}