Many-sorted equivalence of shiny and strongly polite theories
DOI10.1007/S10817-017-9411-YzbMATH Open1425.68370OpenAlexW2593951067MaRDI QIDQ682380FDOQ682380
Authors: Filipe Casal, João Rasga 
Publication date: 2 February 2018
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-017-9411-y
Recommendations
- Morita equivalence for many-sorted enriched theories
- Morita equivalence of many-sorted algebraic theories
- Automated Deduction – CADE-20
- Connecting many-sorted theories
- scientific article; zbMATH DE number 3970817
- A many-sorted variant of Japaridze's polymodal provability logic
- A note on interpretations of many-sorted theories
- scientific article; zbMATH DE number 4049131
- scientific article; zbMATH DE number 3241262
- First-order theories as many-sorted algebras
first-order logicmany-sorted logiccombination of satisfiability proceduresNelson-Oppen methodpolite theoriesshiny theoriesstrongly polite theories
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mechanization of proofs and logical operations (03B35)
Cites Work
- Complexity, convexity and combinations of theories
- A mathematical introduction to logic.
- Simplification by Cooperating Decision Procedures
- Title not available (Why is that?)
- Combining nonstably infinite theories
- Sorting and selection in posets
- Combinations of Theories for Decidable Fragments of First-Order Logic
- Title not available (Why is that?)
- Frontiers of Combining Systems
- Revisiting the equivalence of shininess and politeness
- Combining theories: the Ackerman and guarded fragments
- A gentle non-disjoint combination of satisfiability procedures
- Polite theories revisited
Cited In (7)
- Revisiting the equivalence of shininess and politeness
- Politeness and combination methods for theories with bridging functions
- Combining stable infiniteness and (strong) politeness
- Politeness and stable infiniteness: stronger together
- Politeness for the theory of algebraic datatypes
- Combining Finite Combination Properties: Finite Models and Busy Beavers
- Polite combination of algebraic datatypes
Uses Software
This page was built for publication: Many-sorted equivalence of shiny and strongly polite theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q682380)
