Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates |
scientific article; zbMATH DE number 7356976
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates |
scientific article; zbMATH DE number 7356976 |
Statements
Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (English)
0 references
9 June 2021
0 references
Bernays-Schönfinkel-Ramsey fragment
0 references
first-order arithmetic
0 references
linear rational arithmetic
0 references
difference constraints
0 references
combinations of theories
0 references
0 references
0 references
0 references
0 references
0 references
