Pages that link to "Item:Q3245363"
From MaRDI portal
The following pages link to Decidability and essential undecidability (Q3245363):
Displaying 14 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)
- Facets of Synthesis: Revisiting Church’s Problem (Q3617717) (← links)
- Decision Problems of Finite Automata Design and Related Arithmetics (Q3848195) (← links)
- Bibliography of Hilary Putnam’s Writings in Logic and Mathematics (Q5214672) (← links)
- Minimal- und Primmodelle (Q5553265) (← links)
- Creativity and Effective Inseparability (Q5727660) (← links)
- A list of arithmetical structures complete with respect to the first-order definability (Q5941257) (← links)
- Essential hereditary undecidability (Q6565566) (← links)
