메뉴 건너뛰기




Volumn 82, Issue 1, 2003, Pages 170-190

Stone coalgebras

Author keywords

Coalgebra; Descriptive general frames; Kripke polynomial functors; Modal logic; Stone spaces; Vietoris topology

Indexed keywords

COMPUTER SCIENCE; FORMAL LOGIC; MATHEMATICAL MODELS; POLYNOMIALS; SEMANTICS; THEOREM PROVING;

EID: 17444421446     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80638-8     Document Type: Conference Paper
Times cited : (14)

References (29)
  • 3
    • 21744439868 scopus 로고    scopus 로고
    • Partializing Stone Spaces using SFP Domains (extended abstract)
    • M. et al. Bidoit. Berlin: Springer
    • Alessi F., Baldan P., Honsell F. Partializing Stone Spaces using SFP Domains (extended abstract). Bidoit M., et al. CAAP '97 volume 1158 of LNCS. 1997;478-489 Springer, Berlin
    • (1997) CAAP '97 Volume 1158 of LNCS , pp. 478-489
    • Alessi, F.1    Baldan, P.2    Honsell, F.3
  • 5
    • 0003369028 scopus 로고    scopus 로고
    • A logic for coalgebraic simulation
    • Horst Reichel, editor, Coalgebraic Methods in Computer Science (CMCS'00)
    • Alexandru Baltag. A logic for coalgebraic simulation. In Horst Reichel, editor, Coalgebraic Methods in Computer Science (CMCS'00), volume 33 of Electronic Notes in Theoretical Computer Science, pages 41-60, 2000.
    • (2000) Electronic Notes in Theoretical Computer Science , vol.33 , pp. 41-60
    • Baltag, A.1
  • 7
    • 84949024611 scopus 로고    scopus 로고
    • On specification logics for algebra-coalgebra structures: Reconciling reachability and observability
    • Mogens Nielsen, editor, Proceedings of FoSSaCS 2002 Springer
    • Corina Cirstea. On specification logics for algebra-coalgebra structures: Reconciling reachability and observability. In Mogens Nielsen, editor, Proceedings of FoSSaCS 2002, volume 2303 of LNCS, pages 82-97. Springer, 2002.
    • (2002) LNCS , vol.2303 , pp. 82-97
    • Cirstea, C.1
  • 15
    • 17844383468 scopus 로고    scopus 로고
    • Many-sorted coalgebraic modal logic: A model-theoretic study
    • Jacobs Bart. Many-sorted coalgebraic modal logic: a model-theoretic study. Theoretical Informatics and Applications. 35:(1):2001;31-59
    • (2001) Theoretical Informatics and Applications , vol.35 , Issue.1 , pp. 31-59
    • Jacobs, B.1
  • 16
    • 0004072372 scopus 로고
    • Cambridge University Press
    • Johnstone Peter. Stone Spaces. 1982;Cambridge University Press
    • (1982) Stone Spaces
    • Johnstone, P.1
  • 17
    • 18944372451 scopus 로고    scopus 로고
    • Coalgebraic modal logic of finite rank
    • CWI, Amsterdam
    • A. Kurz and D. Pattinson. Coalgebraic modal logic of finite rank. Technical Report SEN-R0222, CWI, Amsterdam, 2002.
    • (2002) Technical Report , vol.SEN-R0222
    • Kurz, A.1    Pattinson, D.2
  • 18
    • 18944406687 scopus 로고    scopus 로고
    • Definability, canonical models, compactness for finitary coalgebraic modal logic
    • Lawrence Moss, editor, Proceedings of CMCS 2002 volume 65.1 Elsevier
    • A. Kurz and D. Pattinson. Definability, canonical models, compactness for finitary coalgebraic modal logic. In Lawrence Moss, editor, Proceedings of CMCS 2002, volume 65.1 of ENTCS. Elsevier, 2002.
    • (2002) ENTCS
    • Kurz, A.1    Pattinson, D.2
  • 19
    • 4944238554 scopus 로고    scopus 로고
    • Modal predicates and coequations
    • Lawrence Moss, editor, Proceedings of CMCS 2002 volume 65.1 Elsevier
    • A. Kurz and J. Rosický. Modal predicates and coequations. In Lawrence Moss, editor, Proceedings of CMCS 2002, volume 65.1 of ENTCS. Elsevier, 2002.
    • (2002) ENTCS
    • Kurz, A.1    Rosický, J.2
  • 24
    • 84957101344 scopus 로고    scopus 로고
    • Semantical principles in the modal logic of coalgebras
    • Proceedings 18th International Symposium on Theoretical Aspects of Computer Science (STACS 2001) Berlin Springer
    • Dirk Pattinson. Semantical principles in the modal logic of coalgebras. In Proceedings 18th International Symposium on Theoretical Aspects of Computer Science (STACS 2001), volume 2010 of LNCS, Berlin, 2001. Springer.
    • (2001) LNCS , vol.2010
    • Pattinson, D.1
  • 26
    • 0001986854 scopus 로고    scopus 로고
    • Universal coalgebra: A theory of systems
    • Rutten J.J.M.M. Universal coalgebra: A theory of systems. Theoretical Computer Science. 249:2000;3-80
    • (2000) Theoretical Computer Science , vol.249 , pp. 3-80
    • Rutten, J.J.M.M.1
  • 28
    • 18944373901 scopus 로고
    • Topology
    • S. Abramsky, D.M. Gabbay, & T.S.E. Maibaum. Oxford University Press
    • Smyth Michael. Topology. Abramsky S., Gabbay D.M., Maibaum T.S.E. Handbook of Logic in Computer Science, volume 1. 1993;Oxford University Press
    • (1993) Handbook of Logic in Computer Science, Volume 1
    • Smyth, M.1
  • 29
    • 35048876968 scopus 로고    scopus 로고
    • On the final sequence of an accessible set functor
    • To appear
    • James Worrell. On the final sequence of an accessible set functor. Theoretical Computer Science. To appear.
    • Theoretical Computer Science
    • Worrell, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.