Herbrand theorems in arbitrary institutions

DOI10.1016/J.IPL.2004.01.005MaRDI QIDQ2390213zbMATH OpenOpenAlexFDO

Authors Răzvan Diaconescu

Publication date 21 July 2009

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

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

zbMATH Keywords

formal methodsspecification languageslogic programmingauthorinstitutionsherbrand theorems

Mathematics Subject Classification ID

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

Recommendations

• Foundations of Logic Programming in Hybridised Logics
• Revisiting the Institutional Approach to Herbrand’s Theorem
• From conventional to institution-independent logic programming
• scientific article; zbMATH DE number 559187
• Foundations of logic programming in hybrid logics with user-defined sharing

Cites work

• scientific article; zbMATH DE number 4018380 (Why is no real title available?)
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 1189278 (Why is no real title available?)
• scientific article; zbMATH DE number 3769603 (Why is no real title available?)
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 1216133 (Why is no real title available?)
• scientific article; zbMATH DE number 1998330 (Why is no real title available?)
• scientific article; zbMATH DE number 1487499 (Why is no real title available?)
• scientific article; zbMATH DE number 1543338 (Why is no real title available?)
• scientific article; zbMATH DE number 3248792 (Why is no real title available?)
• A hidden Herbrand theorem: Combining the object and logic paradigms
• CASL: the Common Algebraic Specification Language.
• Category-based constraint logic
• Completeness of category-based equational deduction
• Computing in systems described by equations
• Conditional rewriting logic as a unified model of concurrency
• Equality, types, modules, and (why not?) generics for logic programming
• Institution morphisms
• Institutions for logic programming
• Institutions: abstract model theory for specification and programming
• Logical foundations of CafeOBJ
• On the existence of free models in abstract algebraic institutions
• Quasi-varieties in abstract algebraic institutions
• Specifications in an arbitrary institution

Cited in

(15)

• Institutions for SQL database schemas and datasets
• Foundations of logic programming in hybrid logics with user-defined sharing
• Functorial semantics of first-order views
• From conventional to institution-independent logic programming
• An institution-independent proof of the Robinson consistency theorem
• What is a logic translation?
• A hidden Herbrand theorem: Combining the object and logic paradigms
• Birkhoff style calculi for hybrid logics
• Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally
• Revisiting the Institutional Approach to Herbrand’s Theorem
• Interpolation for predefined types
• Service Specification and Matchmaking Using Description Logic
• On quasi-varieties of multiple valued logic models
• An institution-independent proof of the Beth definability theorem
• Structural induction in institutions

Describes a project that uses

Uses Software

• CASL

This page was built for publication: Herbrand theorems in arbitrary institutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390213)