Coalgebraic logic

Annals of Pure and Applied Logic 96 (1-3):277-317 (1999)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(98)00042-6

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Stochastic coalgebraic logic: Bisimilarity and behavioral equivalence.Ernst-Erich Doberkat - 2008 - Annals of Pure and Applied Logic 155 (1):46-68.
Ann. pure appl. logic : Erratum to “coalgebraic logic” 96 277–317.Lawrence S. Moss - 1999 - Annals of Pure and Applied Logic 99 (1-3):241-259.
Coalgebraic logic for stochastic right coalgebras.Ernst-Erich Doberkat & Christopher Schubert - 2009 - Annals of Pure and Applied Logic 159 (3):268-284.
Coalgebraic logic for stochastic right coalgebras.Ernst-Erich Doberkat & Christoph Schubert - 2009 - Annals of Pure and Applied Logic 159 (3):268-284.
"Quantum field theory and coalgebraic logic in theoretical computer science.Giuseppe Vitiello Gianfanco Basti, Antonio Capolupo - 2017 - Progress in Biophysics and Molecular Biology 130:39-52.
Lawrence S. Moss. Power set recursion. Annals of pure and applied logic, vol. 71 , pp. 247–306.Dag Normann - 1996 - Journal of Symbolic Logic 61 (4):1388-1389.
Completeness for μ-calculi: A coalgebraic approach.Sebastian Enqvist, Fatemeh Seifan & Yde Venema - 2019 - Annals of Pure and Applied Logic 170 (5):578-641.
Modal Ω-Logic. Khudairi - unknown
Hyperintensional Ω-Logic.David Elohim - 2019 - In Matteo Vincenzo D'Alfonso & Don Berkich (eds.), On the Cognitive, Ethical, and Scientific Dimensions of Artificial Intelligence. Springer Verlag.
Review: Lawrence S. Moss, Power Set Recursion. [REVIEW]Dag Normann - 1996 - Journal of Symbolic Logic 61 (4):1388-1389.

Analytics

Added to PP
2014-01-16

Downloads
46 (#336,513)

6 months
11 (#340,261)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Larry Moss
Indiana University

Citations of this work

Finite models constructed from canonical formulas.Lawrence S. Moss - 2007 - Journal of Philosophical Logic 36 (6):605 - 640.
Completeness for flat modal fixpoint logics.Luigi Santocanale & Yde Venema - 2010 - Annals of Pure and Applied Logic 162 (1):55-82.
A Computational Learning Semantics for Inductive Empirical Knowledge.Kevin T. Kelly - 2014 - In Alexandru Baltag & Sonja Smets (eds.), Johan van Benthem on Logic and Information Dynamics. Cham, Switzerland: Springer International Publishing. pp. 289-337.
Completeness for μ-calculi: A coalgebraic approach.Sebastian Enqvist, Fatemeh Seifan & Yde Venema - 2019 - Annals of Pure and Applied Logic 170 (5):578-641.

View all 20 citations / Add more citations

References found in this work

Non-Well-Founded Sets.Peter Aczel - 1988 - Palo Alto, CA, USA: Csli Lecture Notes.
A quantitative analysis of modal logic.Ronald Fagin - 1994 - Journal of Symbolic Logic 59 (1):209-252.
Modal correspondence for models.Jon Barwise & Lawrence S. Moss - 1998 - Journal of Philosophical Logic 27 (3):275-294.
On the Foundations of Corecursion.Lawrence Moss & Norman Danner - 1997 - Logic Journal of the IGPL 5 (2):231-257.

Add more references