According to our database
1,
Peter Schuster
authored at least 65 papers
between 1999 and 2024.
Collaborative distances:
2024
A General Constructive Form of Higman's Lemma.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024
2023
Radical theory of Scott-open filters.
Theor. Comput. Sci., February, 2023
A Constructive Picture of Noetherian Conditions and Well Quasi-orders.
Proceedings of the Unity of Logic and Computation, 2023
2022
A universal algorithm for Krull's theorem.
Inf. Comput., 2022
The Jacobson radical for an inconsistency predicate.
Comput., 2022
The Jacobson radical of a Propositional Theory.
Bull. Symb. Log., 2022
Maximal Ideals in Countable Rings, Constructively.
Proceedings of the Revolutions and Revelations in Computability, 2022
2021
Geometric Logic, Constructivisation, and Automated Theorem Proving (Dagstuhl Seminar 21472).
Dagstuhl Reports, 2021
A General Glivenko-Gödel Theorem for Nuclei.
Proceedings of the Proceedings 37th Conference on Mathematical Foundations of Programming Semantics, 2021
2020
On Scott's semantics for many-valued logic.
J. Log. Comput., 2020
Resolving finite indeterminacy: A definitive constructive universal prime ideal theorem.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020
The Computational Significance of Hausdorff's Maximal Chain Principle.
Proceedings of the Beyond the Horizon of Computability, 2020
Modal Logic for Induction.
Proceedings of the 13th Conference on Advances in Modal Logic, 2020
2019
Some forms of excluded middle for linear orders.
Math. Log. Q., 2019
Preface for the special issue of Proof, Structure, and Computation 2014.
J. Log. Comput., 2019
An Algorithmic Approach to the Existence of Ideal Objects in Commutative Algebra.
Proceedings of the Logic, Language, Information, and Computation, 2019
2018
A General Extension Theorem for Directed-Complete Partial Orders.
Reports Math. Log., 2018
Suzumura Consistency, an Alternative Approach.
FLAP, 2018
2017
Eliminating Disjunctions by Disjunction Elimination.
Bull. Symb. Log., 2017
2016
Ann. Pure Appl. Log., 2016
2014
Constructing Gröbner bases for Noetherian rings.
Math. Struct. Comput. Sci., 2014
Approximating Beppo Levi's principio di Approssimazione.
Bull. Symb. Log., 2014
2013
Are There Enough Injective Sets?
Stud Logica, 2013
A generalized cut characterization of the fullness axiom in CZF.
Log. J. IGPL, 2013
Induction in Algebra: a First Case Study.
Log. Methods Comput. Sci., 2013
2012
The Weak Koenig Lemma, Brouwer's Fan Theorem, De Morgan's Law, and Dependent Choice.
Reports Math. Log., 2012
The Kripke schema in metric topology.
Math. Log. Q., 2012
A predicative completion of a uniform space.
Ann. Pure Appl. Log., 2012
Ann. Pure Appl. Log., 2012
A Direct Proof of Wiener's Theorem.
Proceedings of the How the World Computes, 2012
2011
Math. Struct. Comput. Sci., 2011
Uniqueness, continuity and the existence of implicit functions in constructive analysis.
LMS J. Comput. Math., 2011
Minima and best approximations in constructive analysis.
J. Log. Anal., 2011
Unique paths as formal points.
J. Log. Anal., 2011
On the contrapositive of countable choice.
Arch. Math. Log., 2011
2010
On Choice Principles and Fan Theorems.
J. Univers. Comput. Sci., 2010
Problems, solutions, and completions.
J. Log. Algebraic Methods Program., 2010
2009
Spectral schemes as ringed lattices.
Ann. Math. Artif. Intell., 2009
2008
The Zariski spectrum as a formal geometry.
Theor. Comput. Sci., 2008
Apartness, compactness and nearness.
Theor. Comput. Sci., 2008
Editorial: Math. Log. Quart. 1/2008.
Math. Log. Q., 2008
A continuity principle, a version of Baire's theorem and a boundedness principle.
J. Symb. Log., 2008
2007
Corrigendum to "Unique solutions".
Math. Log. Q., 2007
Proceedings of the Computation and Logic in the Real World, 2007
2006
Binary Refinement Implies Discrete Exponentiation.
Stud Logica, 2006
Classifying Dini's Theorem.
Notre Dame J. Formal Log., 2006
The fan theorem and unique existence of maxima.
J. Symb. Log., 2006
Ideals in constructive Banach algebra theory.
J. Complex., 2006
Formal Zariski topology: Positivity and points.
Ann. Pure Appl. Log., 2006
Quasi-apartness and neighbourhood spaces.
Ann. Pure Appl. Log., 2006
Do Noetherian Modules Have Noetherian Basis Functions?.
Proceedings of the Logical Approaches to Computational Barriers, 2006
2005
What is Continuity, Constructively?
J. Univers. Comput. Sci., 2005
On constructing completions.
J. Symb. Log., 2005
Strong continuity implies uniform sequential continuity.
Arch. Math. Log., 2005
A Nilregular Element Property.
Proceedings of the Mathematics, Algorithms, Proofs, 9.-14. January 2005, 2005
Compactness in apartness spaces?
Proceedings of the Spatial Representation: Discrete vs. Continuous Computational Models, 2005
2004
Compactness under constructive scrutiny.
Math. Log. Q., 2004
2003
Unique existence, approximate solutions, and countable choice.
Theor. Comput. Sci., 2003
2002
Apartness, Topology, and Uniformity: a Constructive View.
Math. Log. Q., 2002
Compactness and Continuity, Constructively Revisited.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002
2001
Apartness as a Relation Between Subsets.
Proceedings of the Combinatorics, 2001
2000
A Constructive Look at Generalised Cauchy Reals.
Math. Log. Q., 2000
1999
Linear Independence without Choice.
Ann. Pure Appl. Log., 1999
