Model-theoretic forcing in transition algebra
From MaRDI portal
Cites work
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- An Institutional Version of Gödel’s Completeness Theorem
- Categoricity without equality
- Completeness by forcing
- Conditional rewriting logic: Deduction, models and concurrency
- Constructor-based logics
- Constructor-based observational logic
- Elements of finite model theory.
- Finite model theory and its applications.
- Finite-model theory -- A personal perspective
- Forcing and calculi for hybrid logics
- Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally
- Forcing, transition algebras, and calculi
- Foundations of algebraic specification and formal software development.
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 1007358 (Why is no real title available?)
- scientific article; zbMATH DE number 3335896 (Why is no real title available?)
- Institution-independent model theory
- Institutions: abstract model theory for specification and programming
- Interpolation in logics with constructors
- Logical foundations of CafeOBJ
- Model theory.
- Observational logic, constructor-based logic, and their duality.
- Omitting types theorem in hybrid dynamic first-order logic with rigid symbols
- THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS
This page was built for publication: Model-theoretic forcing in transition algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310228)
