Linear Independence without Choice. - Douglas S. Bridges; Fred Richman; Peter Schuster 001 (Ann. Pure Appl. Log., 1999)

Elementary Choiceless Constructive Analysis. - Peter M. Schuster (CSL, 2000)

A Constructive Look at Generalised Cauchy Reals. - Peter M. Schuster (Math. Log. Q., 2000)

Apartness as a Relation Between Subsets. - Peter Schuster 001; Luminita Vîta; Douglas S. Bridges (DMTCS, 2001)

Compactness and Continuity, Constructively Revisited. - Douglas S. Bridges; Hajime Ishihara; Peter Schuster 001 (CSL, 2002)

Apartness, Topology, and Uniformity: a Constructive View. - Douglas S. Bridges; Peter Schuster 001; Luminita Vîta (Math. Log. Q., 2002)

Unique existence, approximate solutions, and countable choice. - Peter Schuster 001 (Theor. Comput. Sci., 2003)

Compactness under constructive scrutiny. - Hajime Ishihara; Peter Schuster 001 (Math. Log. Q., 2004)

Compactness in apartness spaces? - Douglas S. Bridges; Hajime Ishihara; Peter Schuster 001; Luminita Vîta (Spatial Representation, 2005)

A Nilregular Element Property. - Thierry Coquand; Henri Lombardi; Peter Schuster 001 (Mathematics, Algorithms, Proofs, 2005)

Strong continuity implies uniform sequential continuity. - Douglas S. Bridges; Hajime Ishihara; Peter Schuster 001; Luminita Vîta (Arch. Math. Log., 2005)

On constructing completions. - Laura Crosilla; Hajime Ishihara; Peter Schuster 001 (J. Symb. Log., 2005)

What is Continuity, Constructively? - Peter Schuster 001 (J. Univers. Comput. Sci., 2005)

Do Noetherian Modules Have Noetherian Basis Functions?. - Peter Schuster 001; Júlia Zappe (CiE, 2006)

Quasi-apartness and neighbourhood spaces. - Hajime Ishihara; Ray Mines; Peter Schuster 001; Luminita Vîta (Ann. Pure Appl. Log., 2006)

Formal Zariski topology: Positivity and points. - Peter Schuster 001 (Ann. Pure Appl. Log., 2006)

Ideals in constructive Banach algebra theory. - Douglas S. Bridges; Robin Havea; Peter Schuster 001 (J. Complex., 2006)

The fan theorem and unique existence of maxima. - Josef Berger; Douglas S. Bridges; Peter Schuster 001 (J. Symb. Log., 2006)

Unique solutions. - Peter Schuster 001 (Math. Log. Q., 2006)

Classifying Dini's Theorem. - Josef Berger; Peter Schuster 001 (Notre Dame J. Formal Log., 2006)

Binary Refinement Implies Discrete Exponentiation. - Peter Aczel; Laura Crosilla; Hajime Ishihara; Erik Palmgren; Peter Schuster 001 (Stud Logica, 2006)

Problems as Solutions. - Peter Schuster 001 (CiE, 2007)

Corrigendum to "Unique solutions". - Peter Schuster 001 (Math. Log. Q., 2007)

A continuity principle, a version of Baire's theorem and a boundedness principle. - Hajime Ishihara; Peter Schuster 001 (J. Symb. Log., 2008)

Editorial: Math. Log. Quart. 1/2008. - Josef Berger; Dirk Pattinson; Peter Schuster 001; Júlia Zappe (Math. Log. Q., 2008)

Apartness, compactness and nearness. - Douglas S. Bridges; Hajime Ishihara; Peter M. Schuster; Luminita Vîta (Theor. Comput. Sci., 2008)

The Zariski spectrum as a formal geometry. - Peter Schuster 001 (Theor. Comput. Sci., 2008)

Spectral schemes as ringed lattices. - Thierry Coquand; Henri Lombardi; Peter Schuster 001 (Ann. Math. Artif. Intell., 2009)

Problems, solutions, and completions. - Peter Schuster 001 (J. Log. Algebraic Methods Program., 2010)

On Choice Principles and Fan Theorems. - Hannes Diener; Peter Schuster 001 (J. Univers. Comput. Sci., 2010)

On the contrapositive of countable choice. - Hajime Ishihara; Peter Schuster 001 (Arch. Math. Log., 2011)

Unique paths as formal points. - Thierry Coquand; Peter Schuster 001 (J. Log. Anal., 2011)

Minima and best approximations in constructive analysis. - Matthew Hendtlass; Peter Schuster 001 (J. Log. Anal., 2011)

Uniqueness, continuity and the existence of implicit functions in constructive analysis. - Hannes Diener; Peter Schuster 001 (LMS J. Comput. Math., 2011)

Noetherian orders. - Hervé Perdry; Peter Schuster 001 (Math. Struct. Comput. Sci., 2011)

A Direct Proof of Wiener's Theorem. - Matthew Hendtlass; Peter Schuster 001 (CiE, 2012)

Preface. - Andrej Bauer; Thierry Coquand; Giovanni Sambin; Peter M. Schuster (Ann. Pure Appl. Log., 2012)

A predicative completion of a uniform space. - Josef Berger; Hajime Ishihara; Erik Palmgren; Peter Schuster 001 (Ann. Pure Appl. Log., 2012)

The Kripke schema in metric topology. - Robert S. Lubarsky; Fred Richman; Peter Schuster 001 (Math. Log. Q., 2012)

The Weak Koenig Lemma, Brouwer's Fan Theorem, De Morgan's Law, and Dependent Choice. - Josef Berger; Hajime Ishihara; Peter Schuster 001 (Reports Math. Log., 2012)

Induction in Algebra: a First Case Study. - Peter Schuster 001 (Log. Methods Comput. Sci., 2013)

A generalized cut characterization of the fullness axiom in CZF. - Laura Crosilla; Erik Palmgren; Peter Schuster 001 (Log. J. IGPL, 2013)

Are There Enough Injective Sets? - Peter Aczel; Benno van den Berg; Johan Georg Granström; Peter Schuster 001 (Stud Logica, 2013)

Approximating Beppo Levi's principio di Approssimazione. - Riccardo Bruni; Peter Schuster 001 (Bull. Symb. Log., 2014)

Constructing Gröbner bases for Noetherian rings. - Hervé Perdry; Peter Schuster 001 (Math. Struct. Comput. Sci., 2014)

Preface. - Thierry Coquand; Maria Emilia Maietti; Giovanni Sambin; Peter Schuster 001 (Ann. Pure Appl. Log., 2016)

Editorial. - Hannes Leitgeb; Iosif Petrakis; Peter Schuster 001; Helmut Schwichtenberg (FLAP, 2016)

Eliminating Disjunctions by Disjunction Elimination. - Davide Rinaldi; Peter Schuster 001; Daniel Misselbeck-Wessel (Bull. Symb. Log., 2017)

Suzumura Consistency, an Alternative Approach. - Peter Schuster 001; Daniel Misselbeck-Wessel (FLAP, 2018)

A General Extension Theorem for Directed-Complete Partial Orders. - Peter Schuster 001; Daniel Misselbeck-Wessel (Reports Math. Log., 2018)

An Algorithmic Approach to the Existence of Ideal Objects in Commutative Algebra. - Thomas Powell 001; Peter Schuster 001; Franziskus Wiesnet (WoLLIC, 2019)

Preface for the special issue of Proof, Structure, and Computation 2014. - Dirk Pattinson; Peter Schuster 001; Ana Sokolova (J. Log. Comput., 2019)

Some forms of excluded middle for linear orders. - Peter Schuster 001; Daniel Misselbeck-Wessel (Math. Log. Q., 2019)

Modal Logic for Induction. - Giulio Fellin; Sara Negri; Peter M. Schuster (AiML, 2020)

The Computational Significance of Hausdorff's Maximal Chain Principle. - Peter Schuster 001; Daniel Misselbeck-Wessel (CiE, 2020)

Resolving finite indeterminacy: A definitive constructive universal prime ideal theorem. - Peter Schuster 001; Daniel Misselbeck-Wessel (LICS, 2020)

On Scott's semantics for many-valued logic. - Satoru Niki; Peter Schuster 001 (J. Log. Comput., 2020)

A General Glivenko-Gödel Theorem for Nuclei. - Giulio Fellin; Peter M. Schuster (MFPS, 2021)

Geometric Logic, Constructivisation, and Automated Theorem Proving (Dagstuhl Seminar 21472). - Thierry Coquand; Hajime Ishihara; Sara Negri; Peter M. Schuster (Dagstuhl Reports, 2021)

Maximal Ideals in Countable Rings, Constructively. - Ingo Blechschmidt; Peter Schuster 001 (CiE, 2022)

The Jacobson radical of a Propositional Theory. - Giulio Fellin; Peter Schuster 001; Daniel Misselbeck-Wessel (Bull. Symb. Log., 2022)

The Jacobson radical for an inconsistency predicate. - Peter Schuster 001; Daniel Misselbeck-Wessel (Comput., 2022)

A universal algorithm for Krull's theorem. - Thomas Powell 001; Peter Schuster 001; Franziskus Wiesnet (Inf. Comput., 2022)

A Constructive Picture of Noetherian Conditions and Well Quasi-orders. - Gabriele Buriola; Peter Schuster 001; Ingo Blechschmidt (CiE, 2023)

Radical theory of Scott-open filters. - Daniel Misselbeck-Wessel; Peter Schuster 001 (Theor. Comput. Sci., 2023)

A General Constructive Form of Higman's Lemma. - Stefano Berardi; Gabriele Buriola; Peter Schuster 001 (CSL, 2024)

Reifying dynamical algebra: Maximal ideals in countable rings, constructively. - Ingo Blechschmidt; Peter Schuster 001 (Comput., 2024)

From Proofs to Computation in Geometric Logic and Generalizations (Dagstuhl Seminar 24021). - Ingo Blechschmidt; Hajime Ishihara; Peter M. Schuster; Gabriele Buriola (Dagstuhl Reports, 2024)

Conservation as Translation. - Giulio Fellin; Peter Schuster 001 (Rev. Symb. Log., 2025)