Pages that link to "Item:Q3611729"
From MaRDI portal
The following pages link to Undecidability in Some Structures Related to Computation Theory (Q3611729):
Displaying 22 items.
- On the strongly generic undecidability of the halting problem (Q884482) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- On the Wadge reducibility of \(k\)-partitions (Q1044675) (← links)
- An undecidable fragment of the theory of set constraints (Q1274577) (← links)
- Undecidable goals for completed acyclic programs (Q1326578) (← links)
- A codicity undecidable problem in the plane. (Q1401375) (← links)
- Elementary theories and hereditary undecidability for semilattices of numberings (Q1734277) (← links)
- Undecidability and intuitionistic incompleteness (Q1815411) (← links)
- Undecidable fragments of elementary theories (Q1906521) (← links)
- Undecidability of elementary theories of Rogers semilattices of analytical hierarchies (Q2630488) (← links)
- (Q3342548) (← links)
- Undecidability over Continuous Time (Q3424115) (← links)
- (Q3772198) (← links)
- (Q3773856) (← links)
- (Q4249223) (← links)
- (Q4281498) (← links)
- Hereditary undecidability of some theories of finite structures (Q4323040) (← links)
- (Q4830809) (← links)
- (Q4896519) (← links)
- UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES (Q5177872) (← links)
- Grid structures and undecidable constraint theories (Q5941204) (← links)
- On the main scientific achievements of Victor Selivanov (Q6146819) (← links)