Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study
Article Properties
-
DOI (url)
-
Publication Date2001/01/01
-
Indian UGC (journal)
-
Refrences31
-
Citations39
-
Bart Jacobs
Cite
Jacobs, Bart. “Many-Sorted Coalgebraic Modal Logic: A Model-Theoretic Study”. RAIRO - Theoretical Informatics and Applications, vol. 35, no. 1, 2001, pp. 31-59, https://doi.org/10.1051/ita:2001108.
Jacobs, B. (2001). Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study. RAIRO - Theoretical Informatics and Applications, 35(1), 31-59. https://doi.org/10.1051/ita:2001108
Jacobs, Bart. “Many-Sorted Coalgebraic Modal Logic: A Model-Theoretic Study”. RAIRO - Theoretical Informatics and Applications 35, no. 1 (2001): 31-59. https://doi.org/10.1051/ita:2001108.
Jacobs B. Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study. RAIRO - Theoretical Informatics and Applications. 2001;35(1):31-59.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| 10.1016/S0304-3975(00)00056-6 | Theoretical Computer Science |
| 2000 | |
| 10.1016/S0168-0072(98)00042-6 | Annals of Pure and Applied Logic |
| 1999 | |
| Points, lines and diamonds: a two-sorted modal logic for projective planes | Journal of Logic and Computation |
| 12 | 1999 |
| Structural Induction and Coinduction in a Fibrational Setting | Information and Computation |
| 72 | 1998 |
| 10.1017/S0960129598002588 | Mathematical Structures in Computer Science |
| 1998 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Well-definedness and observational equivalence for inductive–coinductive programs | Journal of Logic and Computation |
| 2019 | |
Bisimulation proof methods in a path-based specification language for polynomial coalgebras | Mathematical Structures in Computer Science |
| 2014 | |
Completeness for the coalgebraic cover modality | Logical Methods in Computer Science |
| 2012 | |
| Coalgebraic semantics of modal logics: An overview | Theoretical Computer Science |
| 14 | 2011 |
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra | Mathematical Structures in Computer Science |
| 2011 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 20
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Definability, Canonical Models, Compactness for Finitary Coalgebraic Modal Logic and was published in 2002. The most recent citation comes from a 2019 study titled Well-definedness and observational equivalence for inductive–coinductive programs. This article reached its peak citation in 2004, with 9 citations. It has been cited in 11 different journals, 9% of which are open access. Among related journals, the Electronic Notes in Theoretical Computer Science cited this research the most, with 14 citations. The chart below illustrates the annual citation trends for this article.