A categorical study on the finiteness of specifications

DOI10.1016/j.ipl.2008.04.001zbMath1191.68410OpenAlexW2086215341MaRDI QIDQ975404

Răzvan Diaconescu

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.04.001

zbMATH Keywords

institutionsformal methodsspecifications

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally ⋮ Saturated models in institutions

Cites Work

• Saturated models in institutions
• Specifications in an arbitrary institution
• Some fundamental algebraic tools for the semantics of computation. III: Indexed categories
• Categorical abstract algebraic logic: Algebraizable institutions
• Institution-independent model theory
• Proof Systems for Institutional Logic
• Module algebra
• Institutions: abstract model theory for specification and programming
• Logic representation in LF
• The completeness of the first-order functional calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item