Definability, Canonical Models, Compactness for Finitary Coalgebraic Modal Logic

Article Properties
Cite
Kurz, Alexander, and Dirk Pattinson. “Definability, Canonical Models, Compactness for Finitary Coalgebraic Modal Logic”. Electronic Notes in Theoretical Computer Science, vol. 65, no. 1, 2002, pp. 135-5, https://doi.org/10.1016/s1571-0661(04)80363-3.
Kurz, A., & Pattinson, D. (2002). Definability, Canonical Models, Compactness for Finitary Coalgebraic Modal Logic. Electronic Notes in Theoretical Computer Science, 65(1), 135-155. https://doi.org/10.1016/s1571-0661(04)80363-3
Kurz, Alexander, and Dirk Pattinson. “Definability, Canonical Models, Compactness for Finitary Coalgebraic Modal Logic”. Electronic Notes in Theoretical Computer Science 65, no. 1 (2002): 135-55. https://doi.org/10.1016/s1571-0661(04)80363-3.
Kurz A, Pattinson D. Definability, Canonical Models, Compactness for Finitary Coalgebraic Modal Logic. Electronic Notes in Theoretical Computer Science. 2002;65(1):135-5.
Refrences
Title Journal Journal Categories Citations Publication Date
Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study RAIRO - Theoretical Informatics and Applications
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
39 2001
Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study RAIRO - Theoretical Informatics and Applications
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
39 2001
Terminal coalgebras in well-founded set theory Theoretical Computer Science
  • 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
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
96 1993
From modal logic to terminal coalgebras Theoretical Computer Science
  • 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
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2001
Specifying coalgebras with modal logic Theoretical Computer Science
  • 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
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2001