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

DOI10.1016/J.APAL.2022.103212MaRDI QIDQ2111114zbMATH OpenOpenAlexWikidataFDO

Authors Daniel Găină, Guillermo Badia, Tomasz Kowalski

Publication date 23 December 2022

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2203.08720

zbMATH Keywords

forcingdynamic logichybrid logicinstitutionomitting types theorem

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Abstract model theory (03C95) Model-theoretic forcing (03C25) Model theory (03C99)

Recommendations

• A note on omitting types in propositional logic.
• An omitting types theorem in finite schematizable algebraic logic
• Omitting types algebraically via cylindric algebras
• Omitting types for finite variable fragments of first order logic
• An Omitting Types Theorem for first order logic with infinitary relation symbols

Cites work

• scientific article; zbMATH DE number 3161202 (Why is no real title available?)
• scientific article; zbMATH DE number 517385 (Why is no real title available?)
• scientific article; zbMATH DE number 976409 (Why is no real title available?)
• scientific article; zbMATH DE number 1998330 (Why is no real title available?)
• scientific article; zbMATH DE number 3271460 (Why is no real title available?)
• scientific article; zbMATH DE number 3360158 (Why is no real title available?)
• scientific article; zbMATH DE number 3382339 (Why is no real title available?)
• A generalization of the concept of ω-consistency
• A propositional modal logic of time intervals
• Algebra and coalgebra in computer science. 5th international conference, CALCO 2013, Warsaw, Poland, September 3--6, 2013. Proceedings
• An Institutional Version of Gödel’s Completeness Theorem
• An essay in combinatory dynamic logic
• An introduction to description logic
• Birkhoff completeness for hybrid-dynamic first-order logic
• Birkhoff style calculi for hybrid logics
• Bringing them all together
• CASL: the Common Algebraic Specification Language.
• Categoricity without equality
• Completeness by forcing
• Constructor-Based Inductive Theorem Prover
• Constructor-based logics
• Constructor-based observational logic
• Downward Löwenheim-Skolem theorem and interpolation in logics with constructors
• Encoding hybridized institutions into first-order logic
• Forcing and calculi for hybrid logics
• Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally
• Foundations of logic programming in hybrid logics with user-defined sharing
• From conventional to institution-independent logic programming
• Hybrid logic and its proof-theory
• Hybrid logics: Characterization, interpolation and complexity
• Hybridisation at work
• Hybridisation of Institutions in HETS (Tool Paper).
• Hybridization of institutions
• Implicit Kripke semantics and ultraproducts in stratified institutions
• Initial semantics in logics with constructors
• Institution-independent model theory
• Institutions: abstract model theory for specification and programming
• Interpolation in logics with constructors
• Omitting uncountable types and extensions of Elementary logic
• On ω-consistency and related properties
• Proof Systems for Institutional Logic
• Quasi-varieties and initial semantics for hybridized institutions
• Repairing the interpolation theorem in quantified modal logic
• Representation, reasoning, and relational structures: a hybrid logic manifesto
• Rigid first-order hybrid logic
• Robinson consistency in many-sorted hybrid first-order logics
• THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS

Cited in

(4)

• A modular bisimulation characterisation for fragments of hybrid logic
• Forcing, transition algebras, and calculi
• Omitting Types Theorem in hybrid-dynamic first-order logic with rigid symbols
• Hybrid-dynamic Ehrenfeucht-Fraïssé games

Describes a project that uses

Uses Software

• CITP
• CASL
• LARCH

This page was built for publication: Omitting types theorem in hybrid dynamic first-order logic with rigid symbols

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