Omitting types theorem in hybrid dynamic first-order logic with rigid symbols
From MaRDI portal
Publication:2111114
DOI10.1016/j.apal.2022.103212OpenAlexW4309796581WikidataQ123349894 ScholiaQ123349894MaRDI QIDQ2111114
Guillermo Badia, Tomasz Kowalski, Daniel Găină
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
Modal logic (including the logic of norms) (03B45) Model theory (03C99) Model-theoretic forcing (03C25) Abstract model theory (03C95)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebra and coalgebra in computer science. 5th international conference, CALCO 2013, Warsaw, Poland, September 3--6, 2013. Proceedings
- An essay in combinatory dynamic logic
- Repairing the interpolation theorem in quantified modal logic
- Birkhoff style calculi for hybrid logics
- CASL: the Common Algebraic Specification Language.
- Interpolation in logics with constructors
- Birkhoff completeness for hybrid-dynamic first-order logic
- Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally
- Rigid first-order hybrid logic
- Foundations of logic programming in hybrid logics with user-defined sharing
- Constructor-based observational logic
- Institution-independent model theory
- Hybrid logics: characterization, interpolation and complexity
- Bringing them all Together
- Categoricity without equality
- Quasi-varieties and initial semantics for hybridized institutions
- Constructor-Based Inductive Theorem Prover
- Hybridisation at Work
- An Introduction to Description Logic
- Completeness by Forcing
- Hybridization of Institutions
- Implicit Kripke semantics and ultraproducts in stratified institutions
- Combinatorics of $\lambda$-terms: a natural approach
- On ω-consistency and related properties
- Proof Systems for Institutional Logic
- An Institutional Version of Gödel’s Completeness Theorem
- Omitting uncountable types and extensions of Elementary logic
- Institutions: abstract model theory for specification and programming
- A propositional modal logic of time intervals
- Representation, reasoning, and relational structures: a hybrid logic manifesto
- Forcing and Calculi for Hybrid Logics
- Initial semantics in logics with constructors
- THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS
- Encoding hybridized institutions into first-order logic
- A generalization of the concept of ω-consistency
- Hybridisation of Institutions in HETS (Tool Paper).
- Hybrid logic and its proof-theory
This page was built for publication: Omitting types theorem in hybrid dynamic first-order logic with rigid symbols
