Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
29
click to vote
ENTCS
2008
favorite
Email
discuss
report
106
views
more
ENTCS 2008
»
Coequational Logic for Finitary Functors
13 years 11 months ago
Download
www.iti.cs.tu-bs.de
Coequations, which are subsets of a cofree coalgebra, can be viewed as properties of systems. In case of a polynomial functor, a logic of coequations was formulated by J. Ad
Daniel Schwencke
Real-time Traffic
Coequational Logic
|
ENTCS 2008
|
Functors
|
Logic
|
claim paper
Related Content
»
Coequational logic for accessible functors
»
A Note on Expressive Coalgebraic Logics for Finitary Set Functors
»
Functorial Coalgebraic Logic The Case of Manysorted Varieties
»
Towards Coalgebraic Behaviourism
»
Open Graphs and Monoidal Theories
more »
Post Info
More Details (n/a)
Added
10 Dec 2010
Updated
10 Dec 2010
Type
Journal
Year
2008
Where
ENTCS
Authors
Daniel Schwencke
Comments
(0)
Researcher Info
ENTCS 2010 Study Group
Computer Vision