Decidable Fragments of Many-Sorted Logic
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1809861 (Why is no real title available?)
- scientific article; zbMATH DE number 42431 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- A first order logic for specification of timed algorithms: Basic properties and a decidable class
- Automated Deduction – CADE-20
- Bounded model checking using satisfiability solving
- Decidable Fragments of Many-Sorted Logic
- Decidable verification for reducible timed automata specified in a first order logic with time
- On languages with two variables
- SPASS \& FLOTTER version 0.42
- The unsolvability of the Gödel class with identity
Cited in
(11)- Combinations of Theories for Decidable Fragments of First-Order Logic
- scientific article; zbMATH DE number 1507188 (Why is no real title available?)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
- Decidable Fragments of Many-Sorted Logic
- Lattice logic as a fragment of (2-sorted) residuated modal logic
- Decidable fragments of many-sorted logic
- scientific article; zbMATH DE number 7340151 (Why is no real title available?)
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
- Decidable fragments of field theories
- Decidability properties for fragments of CHR
This page was built for publication: Decidable Fragments of Many-Sorted Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498453)