Pages that link to "Item:Q5729294"
From MaRDI portal
The following pages link to Representability op recursively enumerable sets in formal theories (Q5729294):
Displaying 10 items.
- Computability of partial functions and enumerability of sets in Peano's arithmetic (Q1147131) (← links)
- Interpretability suprema in Peano arithmetic (Q2402961) (← links)
- Variants of Robinson's essentially undecidable theoryR (Q4749827) (← links)
- HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC (Q5024504) (← links)
- On Creative Sets and Indices of Partial Recursive Functions (Q5547580) (← links)
- Representability of Partial Recursive Functions in Formal Theories (Q5607995) (← links)
- Representability of recursively enumerable sets in formal theories (Q5720192) (← links)
- Exact Separation of Recursively Enumerable Sets Within Theories (Q5729296) (← links)
- 1 — Consistency and faithful interpretations (Q5734415) (← links)
- Some observations on the FGH theorem (Q6057622) (← links)