SOME MODEL THEORY OF GUARDED NEGATION
From MaRDI portal
Publication:4647097
DOI10.1017/JSL.2018.64OpenAlexW2906231331MaRDI QIDQ4647097FDOQ4647097
Authors: Vince Bárány, Michael Benedikt, Balder ten Cate 
Publication date: 4 January 2019
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.06299
Recommendations
- A note on guarded theories
- Constructive predicate logic with strong negation and model theory
- A model of guarded recursion via generalised equilogical spaces
- Universal guards, relativization of quantifiers, and failure models in model checking modulo theories
- scientific article; zbMATH DE number 92602
- On guarded transformation in the modal \(\mu\)-calculus
- Introduction to Guarded Logics
- Back and forth between guarded and modal logics
- Guarded quantification in least fixed point logic
- Guards, bounds, and generalized semantics
Cites Work
- Title not available (Why is that?)
- Modal languages and bounded fragments of predicate logic
- Query evaluation via tree-decompositions
- Horn clauses and database dependencies
- Title not available (Why is that?)
- Querying the Guarded Fragment
- Data exchange: semantics and query answering
- Model theory.
- Title not available (Why is that?)
- Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
- Interpolation for extended modal languages
- Title not available (Why is that?)
- Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4--8, 2011. Proceedings, Part II
- Title not available (Why is that?)
- Homomorphism preservation theorems
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- On the Restraining Power of Guards
- Multi-dimensional modal logic
- Rewriting Guarded Negation Queries
- Expressive completeness through logically tractable models
- The freedoms of (guarded) bisimulation
- Modal logic over finite structures
- Modal and guarded characterisation theorems over finite transition systems
- Logic for programming and automated reasoning. 6th international conference, LPAR '99, Tbilisi, Georgia, September 6--10, 1999. Proceedings
- Guarded negation
- Effective interpolation and preservation in guarded logics
- The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable
- Unary negation
- Highly acyclic groups, hypergraph covers, and the guarded fragment
Cited In (14)
- Guarded negation
- Universal guards, relativization of quantifiers, and failure models in model checking modulo theories
- Rewriting Guarded Negation Queries
- Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory
- Back and forth between guarded and modal logics
- Effective interpolation and preservation in guarded logics
- Effective interpolation and preservation in guarded logics
- A comparative study of various model-theoretic treatments of negation: A history of formal negation
- Uniform guarded fragments
- TWO-VARIABLE LOGIC HAS WEAK, BUT NOT STRONG, BETH DEFINABILITY
- Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions
- Guarded negation
- A model of guarded recursion via generalised equilogical spaces
- Logical separability of labeled data examples under ontologies
This page was built for publication: SOME MODEL THEORY OF GUARDED NEGATION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647097)
