Sebastiaan A. Terwijn

29 papers C 2Journal 26Unranked 1

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