Quasi-varieties in abstract algebraic institutions
From MaRDI portal
Publication:1091132
DOI10.1016/0022-0000(86)90057-7zbMath0622.68033OpenAlexW2017041211MaRDI QIDQ1091132
Publication date: 1986
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(86)90057-7
quasi-varietiesimplicational classescontinuous algebrasabstract algebraic institutioninitial semantics
Related Items (25)
Foundations of logic programming in hybrid logics with user-defined sharing ⋮ On the existence of free models in abstract algebraic institutions ⋮ Toward formal development of programs from algebraic specifications: Implementations revisited ⋮ Ultraproducts and possible worlds semantics in institutions ⋮ Quasi-Boolean encodings and conditionals in algebraic specification ⋮ Logical systems. I: Internal calculi. ⋮ Category-based modularisation for equational logic programming ⋮ Herbrand theorems in arbitrary institutions ⋮ Specifications in an arbitrary institution ⋮ An institution-independent proof of the Robinson consistency theorem ⋮ Logic representation in LF ⋮ Birkhoff style calculi for hybrid logics ⋮ What is a logic translation? ⋮ Some general results about proof normalization ⋮ Preservation in many-valued truth institutions ⋮ Non-strict don't care algebras and specifications ⋮ On quasi-varieties of multiple valued logic models ⋮ Some fundamental algebraic tools for the semantics of computation. III: Indexed categories ⋮ Free objects and equational deduction for partial conditional specifications ⋮ Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally ⋮ Structural induction in institutions ⋮ Saturated models in institutions ⋮ An institution-independent proof of the Beth definability theorem ⋮ Abstract Beth definability in institutions ⋮ Behavioural satisfaction and equivalence in concrete model categories
Uses Software
Cites Work
- Algebraic and operational semantics of specifications allowing exceptions and errors
- Characterizing specification languages which admit initial semantics
- On hierarchies of abstract data types
- Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories
- The Birkhoff variety theorem for continuous algebras
- On the existence of free models in abstract algebraic institutions
- Varieties of chain-complete algebras
- Partial abstract types
- A theory of type polymorphism in programming
- Model theory
- Partial algebras-survey of a unifying approach towards a two-valued model theory for partial algebras
- Axioms for abstract model theory
- INJECTIVITY IN CATEGORIES TO REPRESENT ALL FIRST ORDER FORMULAS, I
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Quasi-varieties in abstract algebraic institutions