Coinduction for preordered algebra
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4033040 (Why is no real title available?)
- scientific article; zbMATH DE number 3754008 (Why is no real title available?)
- scientific article; zbMATH DE number 1231537 (Why is no real title available?)
- scientific article; zbMATH DE number 1064116 (Why is no real title available?)
- scientific article; zbMATH DE number 1543338 (Why is no real title available?)
- scientific article; zbMATH DE number 1418819 (Why is no real title available?)
- A hidden agenda
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Conditional rewriting logic as a unified model of concurrency
- Constructor-based observational logic
- Institution-independent model theory
- Logical foundations of CafeOBJ
Cited in
(9)- scientific article; zbMATH DE number 1507195 (Why is no real title available?)
- Foundations for structuring behavioural specifications
- Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
- CafeOBJ Traces
- Behavioral equivalence of hidden k-logics: an abstract algebraic approach
- scientific article; zbMATH DE number 1543338 (Why is no real title available?)
- A short overview of hidden logic
- Encoding hybridized institutions into first-order logic
- Coinductive formulas and a many-sorted interpolation theorem
This page was built for publication: Coinduction for preordered algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627121)