Pages that link to "Item:Q5665188"
From MaRDI portal
The following pages link to DIOPHANTINE REPRESENTATION OF ENUMERABLE PREDICATES (Q5665188):
Displaying 9 items.
- Embedding Boolean expressions into logic programming (Q1100935) (← links)
- Robinson forcing is not absolute (Q1245825) (← links)
- Bi-interpretability of some monoids with the arithmetic and applications (Q2003186) (← links)
- On a theorem of Matiyasevich (Q2210378) (← links)
- Using computability to measure complexity of algebraic structures and classes of structures (Q2263109) (← links)
- A normal form theorem for first order formulas and its application to Gaifman's splitting theorem (Q3705447) (← links)
- Rewriting, and equational unification: the higher-order cases (Q5055746) (← links)
- (Q5155664) (← links)
- Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank (Q6085106) (← links)
