Pages that link to "Item:Q3245363"

The following pages link to Decidability and essential undecidability (Q3245363):

Displaying 7 items.

• A note on definability in fragments of arithmetic with free unary predicates (Q365661) (← links)
• Positive existential definability of multiplication from addition and the range of a polynomial (Q503237) (← links)
• Undecidability of the first-order arithmetic \(A[P(x),2x,x+1]\) (Q599047) (← links)
• The reachability problem for Petri nets and decision problems for Skolem arithmetic (Q1148890) (← links)
• Refuting learning revisited. (Q1874232) (← links)
• Learning power and language expressiveness. (Q1874277) (← links)
• Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)