Pages that link to "Item:Q3669417"
From MaRDI portal
The following pages link to On the complexity of models of arithmetic (Q3669417):
Displaying 12 items.
- On Gödel incompleteness and finite combinatorics (Q581400) (← links)
- Diophantine induction (Q584258) (← links)
- A sharpened version of McAloon's theorem on initial segments of models of \(I\Delta_ 0\) (Q685068) (← links)
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension (Q948960) (← links)
- Models of arithmetic and categories with finiteness conditions (Q1097274) (← links)
- Bounded recursively enumerable sets and degrees (Q1338024) (← links)
- Toward the limits of the Tennenbaum phenomenon (Q1377555) (← links)
- Definability, decidability, complexity (Q1817073) (← links)
- Real closures of models of weak arithmetic (Q1935370) (← links)
- HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC (Q5024504) (← links)
- EVERY COUNTABLE MODEL OF SET THEORY EMBEDS INTO ITS OWN CONSTRUCTIBLE UNIVERSE (Q5401599) (← links)
- MARGINALIA ON A THEOREM OF WOODIN (Q5738208) (← links)
