Combined covers and Beth definability
From MaRDI portal
Publication:2096445
DOI10.1007/978-3-030-51074-9_11OpenAlexW3040652710MaRDI QIDQ2096445FDOQ2096445
Authors: Diego Calvanese, Silvio Ghilardi, Alessandro Gianola, Marco Montali, Andrey Rivkin 
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-51074-9_11
Recommendations
- Combination of uniform interpolants via Beth definability
- Cover Algorithms and Their Combination
- Interpolation, amalgamation and combination (the non-disjoint signatures case)
- Quantifier-free interpolation in combinations of equality interpolating theories
- Model completeness, uniform interpolants and superposition calculus. (With applications to verification of data-aware processes)
Cites Work
- Simplification by Cooperating Decision Procedures
- Title not available (Why is that?)
- Model theory.
- Automated Deduction – CADE-20
- Quantifier-free interpolation in combinations of equality interpolating theories
- MCMT: a model checker modulo theories
- Title not available (Why is that?)
- Model-theoretic methods in combined constraint satisfiability
- On an interpretation of second order quantification in first order intuitionistic propositional logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniform interpolation and propositional quantifiers in modal logics
- A sheaf representation and duality for finitely presented Heyting algebras
- An algebraic theory of normal forms
- Sheaves, games, and model completions. A categorical approach to nonclassical propositional logics
- Model completions and r-Heyting categories
- Undefinability of propositional quantifiers in the modal system S4
- Cover Algorithms and Their Combination
- On invariant synthesis for parametric systems
- Interpolation, amalgamation and combination (the non-disjoint signatures case)
- Uniform interpolation and coherence
- Uniform interpolation and compact congruences
- Modularity results for interpolation, amalgamation and superamalgamation
- From model completeness to verification of data aware processes
- Model completeness, covers and superposition
- SMT-based verification of data-aware processes: a model-theoretic approach
Cited In (5)
- Beth definability and the Stone-Weierstrass theorem
- Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions
- Craig interpolation for decidable first-order fragments
- Model completeness, uniform interpolants and superposition calculus. (With applications to verification of data-aware processes)
- Combination of uniform interpolants via Beth definability
Uses Software
This page was built for publication: Combined covers and Beth definability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096445)
