Sebastiaan A. Terwijn

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 24

Top Topics

Top Venues

Ann. Pure Appl. Log.

Publications

Sebastiaan A. Terwijn
Fixed Point Theorems in Computability Theory. Logics and Type Systems in Theory and Practice (2024)
Sebastiaan A. Terwijn
Fixed Point Theorems in Computability Theory. CoRR (2024)
Ekaterina B. Fokina, Sebastiaan A. Terwijn
Computable Structure Theory of Partial Combinatory Algebras. CiE (2024)
Sebastiaan A. Terwijn
The complexity of completions in partial combinatory algebra. CoRR (2023)
Sebastiaan A. Terwijn
Completions of Kleene's second model. CoRR (2023)
Klaus Ambos-Spies, Wolfgang Merkle, Sebastiaan A. Terwijn
Normalized information distance and the oscillation hierarchy. J. Comput. Syst. Sci. 124 (2022)
Anton Golov, Sebastiaan A. Terwijn
Fixpoints and relative precompleteness. Comput. 11 (2) (2022)
Henk Barendregt, Sebastiaan A. Terwijn
Partial combinatory algebra and generalized numberings. Theor. Comput. Sci. 925 (2022)
Anton Golov, Sebastiaan A. Terwijn
Embeddings between partial combinatory algebras. CoRR (2022)
Anton Golov, Sebastiaan A. Terwijn
Fixpoints and relative precompleteness. CoRR (2021)
Paul Shafer, Sebastiaan A. Terwijn
Ordinal Analysis of Partial Combinatory Algebras. J. Symb. Log. 86 (3) (2021)
Paul Shafer, Sebastiaan A. Terwijn
Ordinal analysis of partial combinatory algebras. CoRR (2020)
Sebastiaan A. Terwijn
Computability in Partial Combinatory Algebras. Bull. Symb. Log. 26 (3-4) (2020)
Sebastiaan A. Terwijn
The noneffectivity of Arslanov's completeness criterion and related theorems. Arch. Math. Log. 59 (5-6) (2020)
Henk Barendregt, Sebastiaan A. Terwijn
Fixed point theorems for precomplete numberings. Ann. Pure Appl. Log. 170 (10) (2019)
Hendrik Pieter Barendregt, Sebastiaan A. Terwijn
Partial combinatory algebra and generalized numberings. CoRR (2019)
Sebastiaan A. Terwijn
Computability in partial combinatory algebras. CoRR (2019)
Henk Barendregt, Sebastiaan A. Terwijn
Fixed point theorems for precomplete numberings. CoRR (2018)
Sebastiaan A. Terwijn
Generalizations of the Recursion Theorem. CoRR (2018)
Sebastiaan A. Terwijn
Generalizations of the Recursion Theorem. J. Symb. Log. 83 (4) (2018)
Bjørn Kjos-Hanssen, Frank Stephan, Sebastiaan A. Terwijn
Covering the recursive sets. Ann. Pure Appl. Log. 168 (4) (2017)
Klaus Ambos-Spies, Wolfgang Merkle, Sebastiaan A. Terwijn
Normalized Information Distance and the Oscillation Hierarchy. CoRR (2017)
Bjørn Kjos-Hanssen, Frank Stephan, Sebastiaan A. Terwijn
Covering the Recursive Sets. CiE (2015)
Andrea Sorbi, Sebastiaan A. Terwijn
Generalizations of the Weak Law of the Excluded Middle. Notre Dame J. Formal Log. 56 (2) (2015)
Rutger Kuyper, Sebastiaan A. Terwijn
Model Theory of Measure Spaces and Probability Logic. Rev. Symb. Log. 6 (3) (2013)
Bruno Bauwens, Sebastiaan A. Terwijn
Notes on Sum-Tests and Independence Tests. Theory Comput. Syst. 48 (2) (2011)
Sebastiaan A. Terwijn, Leen Torenvliet, Paul M. B. Vitányi
Nonapproximability of the normalized information distance. J. Comput. Syst. Sci. 77 (4) (2011)
Sebastiaan A. Terwijn
Constructive Logic and the Medvedev Lattice. Notre Dame J. Formal Log. 47 (1) (2006)