Omitting types theorem in hybrid dynamic first-order logic with rigid symbols
DOI10.1016/J.APAL.2022.103212OpenAlexW4309796581WikidataQ123349894 ScholiaQ123349894MaRDI QIDQ2111114FDOQ2111114
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
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
Modal logic (including the logic of norms) (03B45) Abstract model theory (03C95) Model-theoretic forcing (03C25) Model theory (03C99)
Cites Work
- Title not available (Why is that?)
- Constructor-Based Inductive Theorem Prover
- Institution-independent model theory
- Institutions: abstract model theory for specification and programming
- A propositional modal logic of time intervals
- Title not available (Why is that?)
- THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS
- Hybrid logics: Characterization, interpolation and complexity
- Hybrid logic and its proof-theory
- An essay in combinatory dynamic logic
- Algebra and coalgebra in computer science. 5th international conference, CALCO 2013, Warsaw, Poland, September 3--6, 2013. Proceedings
- Categoricity without equality
- Title not available (Why is that?)
- Representation, reasoning, and relational structures: a hybrid logic manifesto
- Title not available (Why is that?)
- CASL: the Common Algebraic Specification Language.
- Constructor-based observational logic
- Constructor-based logics
- Proof Systems for Institutional Logic
- Title not available (Why is that?)
- A generalization of the concept of ω-consistency
- An introduction to description logic
- Bringing them all together
- Repairing the interpolation theorem in quantified modal logic
- An Institutional Version of Gödel’s Completeness Theorem
- Completeness by forcing
- From conventional to institution-independent logic programming
- Title not available (Why is that?)
- On ω-consistency and related properties
- Birkhoff style calculi for hybrid logics
- Interpolation in logics with constructors
- Birkhoff completeness for hybrid-dynamic first-order logic
- Foundations of logic programming in hybrid logics with user-defined sharing
- Quasi-varieties and initial semantics for hybridized institutions
- Hybridization of institutions
- Implicit Kripke semantics and ultraproducts in stratified institutions
- Downward Löwenheim-Skolem theorem and interpolation in logics with constructors
- Forcing and calculi for hybrid logics
- Encoding hybridized institutions into first-order logic
- Title not available (Why is that?)
- Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally
- Rigid first-order hybrid logic
- Hybridisation at work
- Omitting uncountable types and extensions of Elementary logic
- Initial semantics in logics with constructors
- Hybridisation of Institutions in HETS (Tool Paper).
- Robinson consistency in many-sorted hybrid first-order logics
Cited In (1)
Uses Software
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)
