{"id":"https://openalex.org/W2060917500","doi":"https://doi.org/10.1305/ndjfl/1094155277","title":"Expressive Logics for Coalgebras via Terminal Sequence Induction","display_name":"Expressive Logics for Coalgebras via Terminal Sequence Induction","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2060917500","doi":"https://doi.org/10.1305/ndjfl/1094155277","mag":"2060917500"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1094155277","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1094155277","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-45/issue-1/Expressive-Logics-for-Coalgebras-via-Terminal-Sequence-Induction/10.1305/ndjfl/1094155277.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-45/issue-1/Expressive-Logics-for-Coalgebras-via-Terminal-Sequence-Induction/10.1305/ndjfl/1094155277.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077171828","display_name":"Dirk Pattinson","orcid":"https://orcid.org/0000-0002-5832-6666"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]},{"id":"https://openalex.org/I3018771216","display_name":"LMU Klinikum","ror":"https://ror.org/02jet3w32","country_code":"DE","type":"healthcare","lineage":["https://openalex.org/I3018771216","https://openalex.org/I8204097"]},{"id":"https://openalex.org/I4210131871","display_name":"Shanxi Jincheng Anthracite Mining Group (China)","ror":"https://ror.org/03j92cn97","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210131871"]},{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["CN","DE","US"],"is_corresponding":true,"raw_author_name":"Dirk Pattinson","raw_affiliation_strings":["Institut fr Informatik LMU Mnchen Mnchen GERMANY","University of Notre Dame","Institut f\u00fcr Informatik LMU M\u00fcnchen M\u00fcnchen GERMANY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut fr Informatik LMU Mnchen Mnchen GERMANY","institution_ids":["https://openalex.org/I4210131871"]},{"raw_affiliation_string":"University of Notre Dame","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik LMU M\u00fcnchen M\u00fcnchen GERMANY","institution_ids":["https://openalex.org/I3018771216","https://openalex.org/I8204097"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5077171828"],"corresponding_institution_ids":["https://openalex.org/I107639228","https://openalex.org/I3018771216","https://openalex.org/I4210131871","https://openalex.org/I8204097"],"apc_list":null,"apc_paid":null,"fwci":12.4784,"has_fulltext":true,"cited_by_count":92,"citation_normalized_percentile":{"value":0.98418161,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"45","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6923489570617676},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.628645658493042},{"id":"https://openalex.org/keywords/predicate-logic","display_name":"Predicate logic","score":0.6033463478088379},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.5978837609291077},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.5536881685256958},{"id":"https://openalex.org/keywords/functor","display_name":"Functor","score":0.5185118913650513},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4748390316963196},{"id":"https://openalex.org/keywords/normal-modal-logic","display_name":"Normal modal logic","score":0.4646102488040924},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.45883458852767944},{"id":"https://openalex.org/keywords/interpretation","display_name":"Interpretation (philosophy)","score":0.4319286048412323},{"id":"https://openalex.org/keywords/accessibility-relation","display_name":"Accessibility relation","score":0.41836434602737427},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4131363034248352},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39170223474502563},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3536686301231384},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3038126826286316},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2764228582382202},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.1867137849330902}],"concepts":[{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6923489570617676},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.628645658493042},{"id":"https://openalex.org/C19689857","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"Predicate logic","level":3,"score":0.6033463478088379},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.5978837609291077},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.5536881685256958},{"id":"https://openalex.org/C156772000","wikidata":"https://www.wikidata.org/wiki/Q864475","display_name":"Functor","level":2,"score":0.5185118913650513},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4748390316963196},{"id":"https://openalex.org/C114092440","wikidata":"https://www.wikidata.org/wiki/Q840226","display_name":"Normal modal logic","level":4,"score":0.4646102488040924},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.45883458852767944},{"id":"https://openalex.org/C527412718","wikidata":"https://www.wikidata.org/wiki/Q855395","display_name":"Interpretation (philosophy)","level":2,"score":0.4319286048412323},{"id":"https://openalex.org/C11191006","wikidata":"https://www.wikidata.org/wiki/Q2663311","display_name":"Accessibility relation","level":4,"score":0.41836434602737427},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4131363034248352},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39170223474502563},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3536686301231384},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3038126826286316},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2764228582382202},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.1867137849330902},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1305/ndjfl/1094155277","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1094155277","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-45/issue-1/Expressive-Logics-for-Coalgebras-via-Terminal-Sequence-Induction/10.1305/ndjfl/1094155277.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1094155277","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1094155277","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.4431","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.4431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.pst.informatik.uni-muenchen.de/~pattinso/Publications/expressivity.ps.gz","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1305/ndjfl/1094155277","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1094155277","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-45/issue-1/Expressive-Logics-for-Coalgebras-via-Terminal-Sequence-Induction/10.1305/ndjfl/1094155277.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323390","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2060917500.pdf","grobid_xml":"https://content.openalex.org/works/W2060917500.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1518444163","https://openalex.org/W1541645275","https://openalex.org/W1543688617","https://openalex.org/W1589421353","https://openalex.org/W1982431152","https://openalex.org/W1985557227","https://openalex.org/W2042266169","https://openalex.org/W2056138173","https://openalex.org/W2086788473","https://openalex.org/W2088189323","https://openalex.org/W2088378600","https://openalex.org/W2120713972","https://openalex.org/W2154547008","https://openalex.org/W2158921667","https://openalex.org/W2311147650","https://openalex.org/W2493333586","https://openalex.org/W4213277014"],"related_works":["https://openalex.org/W2101793126","https://openalex.org/W4318188140","https://openalex.org/W2795425183","https://openalex.org/W1537541219","https://openalex.org/W2069174222","https://openalex.org/W2396928407","https://openalex.org/W176661328","https://openalex.org/W2163751633","https://openalex.org/W3216606561","https://openalex.org/W2201521779"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3],"logical":[4,97],"characterization":[5,11],"of":[6,16,37,45,54,81,92],"coalgebraic":[7,17,62],"behavioral":[8,99],"equivalence.":[9],"The":[10],"is":[12,42,65],"given":[13],"in":[14],"terms":[15],"modal":[18,55,63],"logic,":[19,94],"an":[20,32],"abstract":[21],"framework":[22],"for":[23,31,67],"reasoning":[24,68],"about,":[25],"and":[26,98],"specifying":[27],"properties":[28,87],"of,":[29],"coalgebras,":[30,70],"endofunctor":[33],"on":[34,57],"the":[35,43,52,82,93],"category":[36],"sets.":[38],"Its":[39],"main":[40],"feature":[41],"use":[44],"predicate":[46],"liftings":[47],"which":[48,88],"give":[49],"rise":[50],"to":[51],"interpretation":[53],"operators":[56],"coalgebras.":[58],"We":[59],"show":[60],"that":[61,71,95],"logic":[64],"adequate":[66],"about":[69],"is,":[72,96],"behaviorally":[73],"equivalent":[74],"states":[75],"cannot":[76],"be":[77],"distinguished":[78],"by":[79],"formulas":[80],"logic.":[83],"Subsequently,":[84],"we":[85],"isolate":[86],"also":[89],"ensure":[90],"expressiveness":[91],"equivalence":[100],"coincide.":[101]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}