The following pages link to Lars Kristiansen (Q207724):
Displayed 38 items.
- Streamlined subrecursive degree theory (Q408165) (← links)
- Non-determinism in Gödel's system \(T\) (Q693050) (← links)
- Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\) (Q1015376) (← links)
- Complexity classes and fragments of C (Q1029017) (← links)
- A jump operator on honest subrecursive degrees (Q1128175) (← links)
- Decidable and undecidable fragments of first-order concatenation theory (Q1670748) (← links)
- Neat function algebraic characterizations of LOGSPACE and LINSPACE (Q1781116) (← links)
- Reversible programming languages capturing complexity classes (Q2039892) (← links)
- On interpretability between some weak essentially undecidable theories (Q2106592) (← links)
- On the complexity of conversion between classic real number representations (Q2106593) (← links)
- On subrecursive representation of irrational numbers: contractors and Baire sequences (Q2117793) (← links)
- First-order concatenation theory with bounded quantifiers (Q2219089) (← links)
- Higher Types, Finite Domains and Resource-bounded Turing Machines (Q2882561) (← links)
- Degrees of Total Algorithms versus Degrees of Honest Functions (Q2904437) (← links)
- A flow calculus of <i>mwp</i> -bounds for complexity analysis (Q2946585) (← links)
- Search for good examples of Hall’s conjecture (Q3177724) (← links)
- (Q3370734) (← links)
- The Structure of Detour Degrees (Q3502641) (← links)
- Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time (Q3507419) (← links)
- Recursion in Higher Types and Resource Bounded Turing Machines (Q3507448) (← links)
- (Q4221237) (← links)
- (Q4503966) (← links)
- On subrecursive representability of irrational numbers (Q4593495) (← links)
- (Q4893148) (← links)
- ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS (Q4923290) (← links)
- On subrecursive representability of irrational numbers, part II (Q5240584) (← links)
- Computer Science Logic (Q5292648) (← links)
- (Q5487726) (← links)
- New Computational Paradigms (Q5717048) (← links)
- New Computational Paradigms (Q5717049) (← links)
- Static Complexity Analysis of Higher Order Programs (Q5747632) (← links)
- Logical Approaches to Computational Barriers (Q5898826) (← links)
- Theory and Applications of Models of Computation (Q5898918) (← links)
- Subrecursive degrees and fragments of Peano arithmetic (Q5945568) (← links)
- A Preliminary Report on Search for Good Examples of Hall's Conjecture (Q6248205) (← links)
- Subrecursive Approximations of Irrational Numbers by Variable Base Sums (Q6300361) (← links)
- Notes on Fragments of First-Order Concatenation Theory (Q6300473) (← links)
- On representations of real numbers and the computational complexity of converting between such representations (Q6433118) (← links)