Pages that link to "Item:Q5720192"
From MaRDI portal
The following pages link to Representability of recursively enumerable sets in formal theories (Q5720192):
Displayed 10 items.
- Hilbert's tenth problem for weak theories of arithmetic (Q685070) (← links)
- Computability of partial functions and enumerability of sets in Peano's arithmetic (Q1147131) (← links)
- Rosser and Mostowski sentences (Q1263586) (← links)
- An algebraic treatment of quantifier-free systems of arithmetic (Q1915125) (← links)
- Variants of Robinson's essentially undecidable theoryR (Q4749827) (← links)
- HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC (Q5024504) (← links)
- La théorie des fonctions récursives et ses applications. (Exposé d'information générale) (Q5536266) (← links)
- On Creative Sets and Indices of Partial Recursive Functions (Q5547580) (← links)
- Representability of Partial Recursive Functions in Formal Theories (Q5607995) (← links)
- Some observations on the FGH theorem (Q6057622) (← links)