Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally

DOI10.1007/s11787-013-0090-0zbMath1338.03056MaRDI QIDQ2254574

Daniel Găină

Publication date: 5 February 2015

Published in: Logica Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11787-013-0090-0

zbMATH Keywords

omitting types theorem; downward Löwenheim-Skolem theorem; institution; model theoretic forcing

Mathematics Subject Classification ID

03G30: Categorical logic, topoi

03C25: Model-theoretic forcing

03C95: Abstract model theory

Related Items

Omitting types theorem in hybrid dynamic first-order logic with rigid symbols

Uses Software

• CASL
• CafeOBJ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Institution morphisms
• An institution-independent proof of the Robinson consistency theorem
• A categorical study on the finiteness of specifications
• Birkhoff completeness in institutions
• On the existence of free models in abstract algebraic institutions
• Quasi-varieties in abstract algebraic institutions
• Model theory.
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Logical foundations of CafeOBJ
• Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
• CASL: the Common Algebraic Specification Language.
• Relating CASL with other specification languages: the institution level.
• An institution-independent proof of Craig interpolation theorem
• Herbrand theorems in arbitrary institutions
• Institution-independent model theory
• Completeness by Forcing
• On ω-consistency and related properties
• Abstract Beth definability in institutions
• An Institution-independent Generalization of Tarski's Elementary Chain Theorem
• An Institutional Version of Gödel’s Completeness Theorem
• Omitting types for algebraizable extensions of first order logic
• Institutions: abstract model theory for specification and programming
• An Oxford survey of order sorted algebra
• Category-based constraint logic
• Elementary Diagrams in Institutions
• Omitting types for finite variable fragments and complete representations of algebras
• An Omitting Types Theorem for first order logic with infinitary relation symbols
• THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS
• Completeness in the theory of types
• A generalization of the concept of ω-consistency