{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T14:10:26Z","timestamp":1765116626504,"version":"3.46.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031995354"},{"type":"electronic","value":"9783031995361"}],"license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-031-99536-1_20","type":"book-chapter","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T10:54:16Z","timestamp":1753959256000},"page":"326-339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tabular Intermediate Logics Comparison"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7696-3848","authenticated-orcid":false,"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6438-6262","authenticated-orcid":false,"given":"Micha\u0142","family":"Stronkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Sangiorgi, D.: Concurrency theory: a historical perspective on coinduction and process calculi. In: Computational logic, pp. 399\u2013442. Amsterdam: Elsevier\/North Holland (2014)","DOI":"10.1016\/B978-0-444-51624-4.50009-5"},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"B\u00edlka, O.r., Jir\u00e1sek, J., Klav\u00edk, P., Tancer, M., Volec, J.: On the complexity of planar covering of small graphs. In: Graph-theoretic concepts in computer science, Lecture Notes in Comput. Sci., vol.\u00a06986, pp. 83\u201394. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25870-1_9","DOI":"10.1007\/978-3-642-25870-1_9"},{"issue":"2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1137\/22M1513290","volume":"38","author":"L Bulteau","year":"2024","unstructured":"Bulteau, L., Dabrowski, K.K., K\u00f6hler, N., Ordyniak, S., Paulusma, D.: An algorithmic framework for locally constrained homomorphisms. SIAM J. Discret. Math. 38(2), 1315\u20131350 (2024). https:\/\/doi.org\/10.1137\/22M1513290","journal-title":"SIAM J. Discret. Math."},{"key":"20_CR4","unstructured":"Chagrov, A., Zakharyaschev, M.: Modal logic, Oxford Logic Guides, vol.\u00a035. The Clarendon Press, Oxford University Press, New York (1997). Oxford Science Publications"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Chaplick, S., Fiala, J., van \u2019t Hof, P., Paulusma, D., Tesa\u0159, M.: Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Theoretical Comput. Sci. 590, 86\u201395 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.01.028, fundamentals of Computation Theory","DOI":"10.1016\/j.tcs.2015.01.028"},{"key":"20_CR6","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. Cambridge, MA: MIT Press, 3rd ed. edn. (2009)"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Diestel, R.: Graph theory, graduate texts in mathematics, vol.\u00a0173. Springer, Heidelberg, fourth edn. (2010). https:\/\/doi.org\/10.1007\/978-3-642-14279-6","DOI":"10.1007\/978-3-642-14279-6"},{"issue":"2","key":"20_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0165-4896(91)90080-B","volume":"21","author":"MG Everett","year":"1991","unstructured":"Everett, M.G., Borgatti, S.: Role colouring a graph. Math. Social Sci. 21(2), 183\u2013188 (1991). https:\/\/doi.org\/10.1016\/0165-4896(91)90080-B","journal-title":"Math. Social Sci."},{"issue":"4","key":"20_CR9","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/s00224-009-9200-z","volume":"46","author":"J Fiala","year":"2010","unstructured":"Fiala, J., Paulusma, D.: Comparing universal covers in polynomial time. Theory Comput. Syst. 46(4), 620\u2013635 (2010). https:\/\/doi.org\/10.1007\/s00224-009-9200-z","journal-title":"Theory Comput. Syst."},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Fiala, J.r., Paulusma, D.: A complete complexity classification of the role assignment problem. Theoret. Comput. Sci. 349(1), 67\u201381 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.09.029","DOI":"10.1016\/j.tcs.2005.09.029"},{"key":"20_CR11","volume-title":"Ordered sets, Advances in Mathematics (Springer)","author":"E Harzheim","year":"2005","unstructured":"Harzheim, E.: Ordered sets, Advances in Mathematics (Springer), vol. 7. Springer, New York (2005)"},{"key":"20_CR12","first-page":"1293","volume":"151","author":"VA Jankov","year":"1963","unstructured":"Jankov, V.A.: On the relation between deducibility in intuitionistic propositional calculus and finite implicative structures. Dokl. Akad. Nauk SSSR 151, 1293\u20131294 (1963)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"20_CR13","doi-asserted-by":"publisher","unstructured":"de\u00a0Jongh, D., Yang, F.: Jankov\u2019s theorems for intermediate logics in the setting of universal models. In: Logic, language, and computation. In: 8th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2009, Bakuriani, Georgia, September 21\u201325, 2009. Revised selected papers, pp. 53\u201376. Berlin: Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-22303-7_5","DOI":"10.1007\/978-3-642-22303-7_5"},{"key":"20_CR14","unstructured":"de\u00a0Jongh, D.H.J.: Investigations on the intuitionistic propositional calculus. ProQuest LLC, Ann Arbor, MI thesis (Ph.D.)\u2013The University of Wisconsin - Madison (1968)"},{"issue":"1\u20133","key":"20_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(94)90026-4","volume":"133","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J.: Regular codes in regular graphs are difficult. Discrete Math. 133(1\u20133), 191\u2013205 (1994). https:\/\/doi.org\/10.1016\/0012-365X(94)90026-4","journal-title":"Discrete Math."},{"key":"20_CR16","volume-title":"Comparison of tabular intermediate logics","author":"A Mata","year":"2022","unstructured":"Mata, A., Stronkowski, M.: Comparison of tabular intermediate logics. Abstract at TACL conference, Coimbra (2022)"},{"key":"20_CR17","volume-title":"A short introduction to intuitionistic logic","author":"G Mints","year":"2000","unstructured":"Mints, G.: A short introduction to intuitionistic logic. The University Series in Mathematics, Kluwer Academic\/Plenum Publishers, New York (2000)"},{"issue":"3","key":"20_CR18","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0165-4896(00)00064-0","volume":"41","author":"A Peke\u010d","year":"2001","unstructured":"Peke\u010d, A., Roberts, F.S.: The role assignment model nearly fits most social networks. Math. Soc. Sci. 41(3), 275\u2013293 (2001). https:\/\/doi.org\/10.1016\/S0165-4896(00)00064-0","journal-title":"Math. Soc. Sci."},{"issue":"4","key":"20_CR19","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W Schnyder","year":"1989","unstructured":"Schnyder, W.: Planar graphs and poset dimension. Order 5(4), 323\u2013343 (1989). https:\/\/doi.org\/10.1007\/BF00353652","journal-title":"Order"},{"key":"20_CR20","volume-title":"Introduction to the theory of computation","author":"M Sipser","year":"2006","unstructured":"Sipser, M.: Introduction to the theory of computation. Thompson, Boston, MA (2006)"},{"issue":"2","key":"20_CR21","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0378-8733(83)90025-4","volume":"5","author":"DR White","year":"1983","unstructured":"White, D.R., Reitz, K.P.: Graph and semigroup homomorphisms on networks of relations. Soc. Netw. 5(2), 193\u2013234 (1983). https:\/\/doi.org\/10.1016\/0378-8733(83)90025-4","journal-title":"Soc. Netw."}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-99536-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T14:07:14Z","timestamp":1765116434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-99536-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"ISBN":["9783031995354","9783031995361"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-99536-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"assertion":[{"value":"1 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic.org\/wollic2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}