Herbrand theorems in arbitrary institutions
From MaRDI portal
Publication:2390213
DOI10.1016/J.IPL.2004.01.005zbMATH Open1178.68132OpenAlexW2020621772MaRDI QIDQ2390213FDOQ2390213
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
Recommendations
Logic programming (68N17) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Institutions: abstract model theory for specification and programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quasi-varieties in abstract algebraic institutions
- Institution morphisms
- Conditional rewriting logic as a unified model of concurrency
- Title not available (Why is that?)
- Specifications in an arbitrary institution
- On the existence of free models in abstract algebraic institutions
- Logical foundations of CafeOBJ
- CASL: the Common Algebraic Specification Language.
- Computing in systems described by equations
- Title not available (Why is that?)
- Equality, types, modules, and (why not?) generics for logic programming
- Title not available (Why is that?)
- Category-based constraint logic
- Title not available (Why is that?)
- Completeness of category-based equational deduction
- Institutions for logic programming
- A hidden Herbrand theorem: Combining the object and logic paradigms
Cited In (14)
- A hidden Herbrand theorem: Combining the object and logic paradigms
- Structural induction in institutions
- Service Specification and Matchmaking Using Description Logic
- An institution-independent proof of the Robinson consistency theorem
- Revisiting the Institutional Approach to Herbrand’s Theorem
- On quasi-varieties of multiple valued logic models
- Functorial semantics of first-order views
- Birkhoff style calculi for hybrid logics
- What is a logic translation?
- Institutions for SQL database schemas and datasets
- An institution-independent proof of the Beth definability theorem
- Interpolation for predefined types
- Foundations of logic programming in hybrid logics with user-defined sharing
- Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally
Uses Software
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)