Pages that link to "Item:Q3655205"
From MaRDI portal
The following pages link to Combinations of Theories for Decidable Fragments of First-Order Logic (Q3655205):
Displaying 13 items.
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- Many-sorted equivalence of shiny and strongly polite theories (Q682380) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- Politeness and stable infiniteness: stronger together (Q2055852) (← links)
- Polite combination of algebraic datatypes (Q2090130) (← links)
- Politeness for the theory of algebraic datatypes (Q2096449) (← links)
- On interpolation in automated theorem proving (Q2352502) (← links)
- A Rewriting Approach to the Combination of Data Structures with Bridging Theories (Q2964468) (← links)
- Combining Theories: The Ackerman and Guarded Fragments (Q3172881) (← links)
- Combinations of Theories for Decidable Fragments of First-Order Logic (Q3655205) (← links)
- Combining Theories with Shared Set Operations (Q3655212) (← links)
- Combining stable infiniteness and (strong) politeness (Q6053847) (← links)
- Semantically-guided goal-sensitive reasoning: decision procedures and the Koala prover (Q6156634) (← links)
