Pages that link to "Item:Q5622176"
From MaRDI portal
The following pages link to Abstract Computability and Invariant Definability (Q5622176):
Displaying 17 items.
- Computational inductive definability (Q598276) (← links)
- Some applications of computable one-one numberings (Q750430) (← links)
- Inductive definability in formal language theory (Q1245578) (← links)
- Computability by means of effectively definable schemes and definability via enumerations (Q1263579) (← links)
- Definability and invariance (Q2454641) (← links)
- Enumeration Reducibility and Computable Structure Theory (Q2970965) (← links)
- (Q3483274) (← links)
- (Q4460832) (← links)
- (Q4636282) (← links)
- Generalizing Computability Theory to Abstract Algebras (Q4637219) (← links)
- (Q4993791) (← links)
- (Q5079729) (← links)
- Inductive Definitions and Computability (Q5628117) (← links)
- The Game Quantifier (Q5654033) (← links)
- Logical Approaches to Computational Barriers (Q5898798) (← links)
- Numerical invariants via abstract machines (Q6041166) (← links)
- Ivan Soskov: a life in computability (Q6599282) (← links)