{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:12:44Z","timestamp":1743073964439,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030930998"},{"type":"electronic","value":"9783030931001"}],"license":[{"start":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T00:00:00Z","timestamp":1639612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T00:00:00Z","timestamp":1639612800000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-93100-1_16","type":"book-chapter","created":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T23:02:26Z","timestamp":1639609346000},"page":"253-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computability Models over Categories and Presheaves"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4121-7455","authenticated-orcid":false,"given":"Iosif","family":"Petrakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,16]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0084207","volume-title":"Category Theory","year":"1991","unstructured":"Carboni, A., Pedicchio, M.C., Rosolini, G. (eds.): Category Theory. LNM, vol. 1488. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0084207"},{"key":"16_CR2","unstructured":"Cockett, R.: Categories and Computability, Lecture Notes (2014)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Cockett, R., Hofstra, P.: Introduction to turing categories. Ann. Pure Appl. Log. 156(2\u20133), 183\u2013209 (2008). https:\/\/doi.org\/10.1016\/j.apal.2008.04.005","DOI":"10.1016\/j.apal.2008.04.005"},{"issue":"10","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1835","DOI":"10.1016\/j.jpaa.2009.12.028","volume":"214","author":"R Cockett","year":"2010","unstructured":"Cockett, R., Hofstra, P.: Categorical simulations. J. Pure Appl. Algebra 214(10), 1835\u20131853 (2010). https:\/\/doi.org\/10.1016\/j.jpaa.2009.12.028","journal-title":"J. Pure Appl. Algebra"},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1215\/ijm\/1256052950","volume":"14","author":"A Klein","year":"1970","unstructured":"Klein, A.: Relations in categories. Illinois J. Math. 14(4), 536\u2013550 (1970)","journal-title":"Illinois J. Math."},{"key":"16_CR6","unstructured":"Longley, J.: Realizability Toposes and language semantics. Ph.D. thesis ECS-LFCS-95-332 University of Edinbourgh (1995)"},{"issue":"5","key":"16_CR7","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/j.entcs.2004.08004","volume":"17","author":"J Longley","year":"2007","unstructured":"Longley, J.: On the ubiquity of certain total type structures. Math. Struct. Comput. Sci. 17(5), 841\u2013953 (2007). https:\/\/doi.org\/10.1016\/j.entcs.2004.08004","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"16_CR8","doi-asserted-by":"publisher","first-page":"E240201","DOI":"10.1017\/S0960129513000182","volume":"24","author":"J Longley","year":"2014","unstructured":"Longley, J.: Computability structures, simulations and realizability. Math. Struct. Comput. Sci. 24(2), E240201 (2014). https:\/\/doi.org\/10.1017\/S0960129513000182","journal-title":"Math. Struct. Comput. Sci."},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Longley, J., Normann, D.: Higher-Order Computability. THEOAPPLCOM. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47992-6","DOI":"10.1007\/978-3-662-47992-6"},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"I. Petrakis: Dependent sums and dependent products in Bishop\u2019s set theory. In: Dybjer, P., et al. (eds.) TYPES 2018. LIPIcs, vol. 130 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.TYPES.2018.3. Article no. 3","DOI":"10.4230\/LIPIcs.TYPES.2018.3"},{"key":"16_CR11","unstructured":"Petrakis, I.: Families of sets in bishop set theory. Habilitation thesis, Ludwig-Maximilians-Universit\u00e4t (2020)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Petrakis, I.: Computability models over categories. arXiv:2105.06933v1 (2021)","DOI":"10.1007\/978-3-030-93100-1_16"},{"key":"16_CR13","unstructured":"Rosolini, G.: Continuity and effectiveness in topoi. Ph.D. thesis, University of Oxford (1986)"},{"key":"16_CR14","unstructured":"Riehl, E.: Category Theory in Context. Dover Publications Inc., Mineola (2016)"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93100-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,27]],"date-time":"2021-12-27T00:03:51Z","timestamp":1640563431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93100-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,16]]},"ISBN":["9783030930998","9783030931001"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93100-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021,12,16]]},"assertion":[{"value":"16 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LFCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logical Foundations of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Deerfield Beach, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lfcs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lfcs.ws.gc.cuny.edu\/","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":"35","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":"23","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":"66% - 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.1","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.4","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)"}}]}}