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

DOI10.1007/S11787-013-0090-0MaRDI QIDQ2254574zbMATH OpenOpenAlexFDO

Authors 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

downward Löwenheim-Skolem theoreminstitutionmodel theoretic forcingomitting types theorem

Mathematics Subject Classification ID

Model-theoretic forcing (03C25) Abstract model theory (03C95) Categorical logic, topoi (03G30)

Recommendations

• Forcing and the Omitting Types Theorem For Lt
• A note on forcing and type theory
• Omitting types in -minimal theories
• A computational interpretation of forcing in type theory
• Mathias-Prikry and Laver-Prikry type forcing
• Forcing in stable models of untyped -calculus
• scientific article; zbMATH DE number 32143
• An omitting types theorem in finite schematizable algebraic logic
• scientific article; zbMATH DE number 67682

Cites work

• A categorical study on the finiteness of specifications
• A generalization of the concept of ω-consistency
• Abstract Beth definability in institutions
• An Institution-independent Generalization of Tarski's Elementary Chain Theorem
• An institution-independent proof of Craig interpolation theorem
• An institution-independent proof of the Robinson consistency theorem
• An Institutional Version of Gödel’s Completeness Theorem
• An Omitting Types Theorem for first order logic with infinitary relation symbols
• An Oxford survey of order sorted algebra
• Birkhoff completeness in institutions
• CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
• CASL: the Common Algebraic Specification Language.
• Category-based constraint logic
• Completeness by forcing
• Completeness in the theory of types
• Elementary Diagrams in Institutions
• Herbrand theorems in arbitrary institutions
• scientific article; zbMATH DE number 4130339 (Why is no real title available?)
• scientific article; zbMATH DE number 4037182 (Why is no real title available?)
• scientific article; zbMATH DE number 4078770 (Why is no real title available?)
• scientific article; zbMATH DE number 1216133 (Why is no real title available?)
• scientific article; zbMATH DE number 575948 (Why is no real title available?)
• scientific article; zbMATH DE number 1998330 (Why is no real title available?)
• scientific article; zbMATH DE number 2172803 (Why is no real title available?)
• scientific article; zbMATH DE number 3335896 (Why is no real title available?)
• Institution morphisms
• Institution-independent model theory
• Institutions: abstract model theory for specification and programming
• Logical foundations of CafeOBJ
• Model theory.
• Omitting types for algebraizable extensions of first order logic
• Omitting types for finite variable fragments and complete representations of algebras
• On ω-consistency and related properties
• On the existence of free models in abstract algebraic institutions
• Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Quasi-varieties in abstract algebraic institutions
• Relating CASL with other specification languages: the institution level.
• THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS

Cited in

(5)

• Omitting types theorem in hybrid dynamic first-order logic with rigid symbols
• Downward Löwenheim-Skolem theorem and interpolation in logics with constructors
• Forcing and the Omitting Types Theorem For Lt
• Forcing, transition algebras, and calculi
• Model-theoretic forcing in transition algebra

Describes a project that uses

Uses Software

• CafeOBJ
• CASL

This page was built for publication: Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally

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