Structural induction in institutions
From MaRDI portal
Publication:719243
DOI10.1016/j.ic.2011.06.002zbMath1241.03073OpenAlexW2090789875MaRDI QIDQ719243
Publication date: 10 October 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2011.06.002
Related Items
Principles of proof scores in CafeOBJ, Preservation in many-valued truth institutions, Graded consequence: an institution theoretic study
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Residuated lattices. An algebraic glimpse at substructural logics
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- On the existence of free models in abstract algebraic institutions
- Quasi-varieties in abstract algebraic institutions
- Specifications in an arbitrary institution
- Some fundamental algebraic tools for the semantics of computation. III: Indexed categories
- Conditional rewriting logic as a unified model of concurrency
- Metamathematics of fuzzy logic
- Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
- CASL: the Common Algebraic Specification Language.
- Herbrand theorems in arbitrary institutions
- Institution-independent model theory
- On Standard Completeness for Non-commutative Many-Valued Logics
- On quasi-varieties of multiple valued logic models
- Interpolation for predefined types
- Institutions: abstract model theory for specification and programming
- An Oxford survey of order sorted algebra
- Category-based constraint logic
- Combination of constraint solving techniques: An algebraic point of view
- Proving Properties of Programs by Structural Induction
- Residuated Lattices
