2019
DOI: 10.22028/d291-28428
|View full text |Cite
|
Sign up to set email alerts
|

Decidable fragments of first-order logic and of first-order linear arithmetic with uninterpreted predicates

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(16 citation statements)
references
References 0 publications
0
16
0
Order By: Relevance
“…The proof of this result can be found in [69] (Theorem 3.1.5). It is based on techniques described by Behmann [8] in the context of second-order quantifier elimination for the monadic second-order fragment -see [70], Section 13.2, for a modern account.…”
Section: Additional Notationmentioning
confidence: 91%
See 4 more Smart Citations
“…The proof of this result can be found in [69] (Theorem 3.1.5). It is based on techniques described by Behmann [8] in the context of second-order quantifier elimination for the monadic second-order fragment -see [70], Section 13.2, for a modern account.…”
Section: Additional Notationmentioning
confidence: 91%
“…It is worth noting that [68] uses a much more fine-grained measure than the number of ∀∃ alternations. Even more details can be found in [69], Section 3.2.…”
Section: Translation Of Sf Into Bsr: Upper and Lower Boundsmentioning
confidence: 99%
See 3 more Smart Citations