The following pages link to Per Lindström (Q185577):
Displayed 28 items.
- On \(\Sigma _ 1\) and \(\Pi _ 1\) sentences and degrees of interpretability (Q685078) (← links)
- On certain lattices of degrees of interpretability (Q800922) (← links)
- Partially generic formulas in arithmetic (Q1105594) (← links)
- A parallel interval method implementation for global optimization using dynamic load balancing (Q1899458) (← links)
- Note on some fixed point constructions in provability logic (Q2499296) (← links)
- Remarks on Penrose's ``new argument'' (Q2499297) (← links)
- A theorem on partial conservativity in arithmetic (Q3083142) (← links)
- On characterizability in Lω1ω0 (Q3113044) (← links)
- On Relations between Structures (Q3113045) (← links)
- (Q3113046) (← links)
- A new linesearch algorithm for nonlinear least squares problems (Q3337958) (← links)
- On Partially Conservative Sentences and Interpretability (Q3698795) (← links)
- (Q3726109) (← links)
- (Q3726110) (← links)
- Omitting uncountable types and extensions of Elementary logic (Q3877662) (← links)
- (Q3960690) (← links)
- Regularization tools for training large feed-forward neural networks using automatic differentiation<sup>∗</sup> (Q4227926) (← links)
- (Q4354788) (← links)
- Provability logic—a short introduction (Q4378052) (← links)
- (Q4395554) (← links)
- (Q4437331) (← links)
- On Characterizing Elementary Logic (Q4777248) (← links)
- (Q4967702) (← links)
- THE ∀∃ THEORY OF PEANO Σ<sub>1</sub> SENTENCES (Q5305060) (← links)
- (Q5416160) (← links)
- Remarks on some theorems of Keisler (Q5571692) (← links)
- On Extensions of Elementary Logic (Q5606559) (← links)
- Penrose's new argument (Q5935793) (← links)