default search action
Peter Schuster 0001
Person information
- affiliation: University of Verona, Italy
- affiliation (former): University of Leeds, Department of Pure Mathematics, UK
- affiliation (former): University of Munich, Germany
Other persons with the same name
- Peter Schuster — disambiguation page
- Peter Schuster 0002 — University of Vienna, Department of Theoretical Chemistry, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c16]Stefano Berardi, Gabriele Buriola, Peter Schuster:
A General Constructive Form of Higman's Lemma. CSL 2024: 16:1-16:17 - [i5]Ingo Blechschmidt, Hajime Ishihara, Peter M. Schuster, Gabriele Buriola:
From Proofs to Computation in Geometric Logic and Generalizations (Dagstuhl Seminar 24021). Dagstuhl Reports 14(1): 1-24 (2024) - 2023
- [j49]Daniel Misselbeck-Wessel
, Peter Schuster:
Radical theory of Scott-open filters. Theor. Comput. Sci. 945: 113677 (2023) - [c15]Gabriele Buriola
A Constructive Picture of Noetherian Conditions and Well Quasi-orders. CiE 2023: 50-62 - 2022
- [j48]Giulio Fellin, Peter Schuster, Daniel Misselbeck-Wessel
The Jacobson radical of a Propositional Theory. Bull. Symb. Log. 28(2): 163-181 (2022) - [j47]Peter Schuster, Daniel Misselbeck-Wessel:
The Jacobson radical for an inconsistency predicate. Comput. 11(2): 147-162 (2022) - [j46]Thomas Powell
A universal algorithm for Krull's theorem. Inf. Comput. 287: 104761 (2022) - [c14]Ingo Blechschmidt, Peter Schuster:
Maximal Ideals in Countable Rings, Constructively. CiE 2022: 24-38 - 2021
- [c13]Giulio Fellin, Peter M. Schuster:
A General Glivenko-Gödel Theorem for Nuclei. MFPS 2021: 51-66 - [i4]Thierry Coquand, Hajime Ishihara, Sara Negri, Peter M. Schuster:
Geometric Logic, Constructivisation, and Automated Theorem Proving (Dagstuhl Seminar 21472). Dagstuhl Reports 11(10): 151-172 (2021) - 2020
- [j45]Satoru Niki, Peter Schuster:
On Scott's semantics for many-valued logic. J. Log. Comput. 30(6): 1291-1302 (2020) - [c12]Giulio Fellin, Sara Negri, Peter M. Schuster:
Modal Logic for Induction. AiML 2020: 209-227 - [c11]Peter Schuster
The Computational Significance of Hausdorff's Maximal Chain Principle. CiE 2020: 239-250 - [c10]Peter Schuster, Daniel Misselbeck-Wessel
Resolving finite indeterminacy: A definitive constructive universal prime ideal theorem. LICS 2020: 820-830
2010 – 2019
- 2019
- [j44]Dirk Pattinson, Peter Schuster, Ana Sokolova
Preface for the special issue of Proof, Structure, and Computation 2014. J. Log. Comput. 29(4): 417-418 (2019) - [j43]Peter Schuster, Daniel Misselbeck-Wessel
Some forms of excluded middle for linear orders. Math. Log. Q. 65(1): 105-107 (2019) - [c9]Thomas Powell
An Algorithmic Approach to the Existence of Ideal Objects in Commutative Algebra. WoLLIC 2019: 533-549 - [i3]Thomas Powell, Peter M. Schuster, Franziskus Wiesnet:
An algorithmic approach to the existence of ideal objects in commutative algebra. CoRR abs/1903.03070 (2019) - 2018
- [j42]Peter Schuster, Daniel Misselbeck-Wessel:
Suzumura Consistency, an Alternative Approach. FLAP 5(1): 263-286 (2018) - [j41]Peter Schuster, Daniel Misselbeck-Wessel:
A General Extension Theorem for Directed-Complete Partial Orders. Reports Math. Log. 53: 79-96 (2018) - 2017
- [j40]Davide Rinaldi, Peter Schuster, Daniel Misselbeck-Wessel
Eliminating Disjunctions by Disjunction Elimination. Bull. Symb. Log. 23(2): 181-200 (2017) - 2016
- [j39]Thierry Coquand, Maria Emilia Maietti, Giovanni Sambin, Peter Schuster:
Preface. Ann. Pure Appl. Log. 167(9): 725 (2016) - [j38]Hannes Leitgeb, Iosif Petrakis, Peter Schuster, Helmut Schwichtenberg:
Editorial. FLAP 3(4): 513-516 (2016) - 2014
- [j37]Riccardo Bruni
Approximating Beppo Levi's principio di Approssimazione. Bull. Symb. Log. 20(2): 141-169 (2014) - [j36]Hervé Perdry, Peter Schuster
Constructing Gröbner bases for Noetherian rings. Math. Struct. Comput. Sci. 24(2) (2014) - 2013
- [j35]Peter Schuster
Induction in Algebra: a First Case Study. Log. Methods Comput. Sci. 9(3) (2013) - [j34]Laura Crosilla
A generalized cut characterization of the fullness axiom in CZF. Log. J. IGPL 21(1): 63-76 (2013) - [j33]Peter Aczel, Benno van den Berg, Johan Georg Granström, Peter Schuster
Are There Enough Injective Sets? Stud Logica 101(3): 467-482 (2013) - 2012
- [j32]Andrej Bauer, Thierry Coquand, Giovanni Sambin, Peter M. Schuster
Preface. Ann. Pure Appl. Log. 163(2): 85-86 (2012) - [j31]Josef Berger, Hajime Ishihara, Erik Palmgren, Peter Schuster
A predicative completion of a uniform space. Ann. Pure Appl. Log. 163(8): 975-980 (2012) - [j30]Robert S. Lubarsky, Fred Richman, Peter Schuster
The Kripke schema in metric topology. Math. Log. Q. 58(6): 498-501 (2012) - [j29]Josef Berger, Hajime Ishihara, Peter Schuster:
The Weak Koenig Lemma, Brouwer's Fan Theorem, De Morgan's Law, and Dependent Choice. Reports Math. Log. 47: 63-86 (2012) - [c8]Matthew Hendtlass, Peter Schuster
A Direct Proof of Wiener's Theorem. CiE 2012: 293-302 - [c7]Peter Schuster
Induction in Algebra: A First Case Study. LICS 2012: 581-585 - 2011
- [j28]Hajime Ishihara, Peter Schuster
On the contrapositive of countable choice. Arch. Math. Log. 50(1-2): 137-143 (2011) - [j27]Thierry Coquand, Peter Schuster:
Unique paths as formal points. J. Log. Anal. 3 (2011) - [j26]Matthew Hendtlass, Peter Schuster:
Minima and best approximations in constructive analysis. J. Log. Anal. 3 (2011) - [j25]Hannes Diener
Uniqueness, continuity and the existence of implicit functions in constructive analysis. LMS J. Comput. Math. 14: 127-136 (2011) - [j24]Hervé Perdry, Peter Schuster
Noetherian orders. Math. Struct. Comput. Sci. 21(1): 111-124 (2011) - 2010
- [j23]Peter Schuster
Problems, solutions, and completions. J. Log. Algebraic Methods Program. 79(1): 84-91 (2010) - [j22]Hannes Diener, Peter Schuster:
On Choice Principles and Fan Theorems. J. Univers. Comput. Sci. 16(18): 2556-2562 (2010)
2000 – 2009
- 2009
- [j21]Thierry Coquand, Henri Lombardi, Peter Schuster
Spectral schemes as ringed lattices. Ann. Math. Artif. Intell. 56(3-4): 339-360 (2009) - [c6]Hannes Diener, Peter Schuster:
Uniqueness, Continuity, and Existence of Implicit Functions in Constructive Analysis. CCA 2009 - 2008
- [j20]Hajime Ishihara, Peter Schuster
A continuity principle, a version of Baire's theorem and a boundedness principle. J. Symb. Log. 73(4): 1354-1360 (2008) - [j19]Josef Berger, Dirk Pattinson, Peter Schuster
Editorial: Math. Log. Quart. 1/2008. Math. Log. Q. 54(1): 4 (2008) - [j18]Douglas S. Bridges, Hajime Ishihara, Peter M. Schuster
Apartness, compactness and nearness. Theor. Comput. Sci. 405(1-2): 3-10 (2008) - [j17]Peter Schuster
The Zariski spectrum as a formal geometry. Theor. Comput. Sci. 405(1-2): 101-115 (2008) - 2007
- [j16]Peter Schuster
Corrigendum to "Unique solutions". Math. Log. Q. 53(2): 214 (2007) - [c5]Peter Schuster
Problems as Solutions. CiE 2007: 676-684 - 2006
- [j15]Peter Schuster
Formal Zariski topology: Positivity and points. Ann. Pure Appl. Log. 137(1-3): 317-359 (2006) - [j14]Hajime Ishihara, Ray Mines, Peter Schuster
Quasi-apartness and neighbourhood spaces. Ann. Pure Appl. Log. 141(1-2): 296-306 (2006) - [j13]Douglas S. Bridges, Robin Havea, Peter Schuster
Ideals in constructive Banach algebra theory. J. Complex. 22(6): 729-737 (2006) - [j12]Josef Berger, Douglas S. Bridges, Peter Schuster
The fan theorem and unique existence of maxima. J. Symb. Log. 71(2): 713-720 (2006) - [j11]Peter Schuster
Unique solutions. Math. Log. Q. 52(6): 534-539 (2006) - [j10]Josef Berger, Peter Schuster
Classifying Dini's Theorem. Notre Dame J. Formal Log. 47(2): 253-262 (2006) - [j9]Peter Aczel, Laura Crosilla
Binary Refinement Implies Discrete Exponentiation. Stud Logica 84(3): 361-368 (2006) - [c4]Peter Schuster
Do Noetherian Modules Have Noetherian Basis Functions?. CiE 2006: 481-489 - 2005
- [j8]Douglas S. Bridges, Hajime Ishihara, Peter Schuster
Strong continuity implies uniform sequential continuity. Arch. Math. Log. 44(7): 887-895 (2005) - [j7]Laura Crosilla
On constructing completions. J. Symb. Log. 70(3): 969-978 (2005) - [j6]Peter Schuster:
What is Continuity, Constructively? J. Univers. Comput. Sci. 11(12): 2076-2085 (2005) - [c3]Douglas S. Bridges, Robin Havea, Peter Schuster:
Ideals in Constructive Banach Algebra Theory. CCA 2005: 65-75 - [e1]Laura Crosilla, Peter M. Schuster:
From sets and types to topology and analysis - Towards practicable foundations for constructive mathematics. Oxford logic guides 48, Oxford University Press 2005, ISBN 978-0-19-856651-9 [contents] - [i2]Douglas S. Bridges, Hajime Ishihara, Peter Schuster, Luminita Vîta:
Compactness in apartness spaces? Spatial Representation 2005 - [i1]Thierry Coquand, Henri Lombardi, Peter Schuster:
A Nilregular Element Property. Mathematics, Algorithms, Proofs 2005 - 2004
- [j5]Hajime Ishihara, Peter Schuster
Compactness under constructive scrutiny. Math. Log. Q. 50(6): 540-550 (2004) - 2003
- [j4]Peter Schuster
Unique existence, approximate solutions, and countable choice. Theor. Comput. Sci. 305(1-3): 433-455 (2003) - 2002
- [j3]Douglas S. Bridges, Peter Schuster, Luminita Vîta:
Apartness, Topology, and Uniformity: a Constructive View. Math. Log. Q. 48(S1): 16-28 (2002) - [c2]Douglas S. Bridges, Hajime Ishihara, Peter Schuster:
Compactness and Continuity, Constructively Revisited. CSL 2002: 89-102 - 2001
- [c1]Peter Schuster, Luminita Vîta, Douglas S. Bridges:
Apartness as a Relation Between Subsets. DMTCS 2001: 203-214 - 2000
- [j2]Peter M. Schuster:
A Constructive Look at Generalised Cauchy Reals. Math. Log. Q. 46(1): 125-134 (2000)
1990 – 1999
- 1999
- [j1]Douglas S. Bridges, Fred Richman, Peter Schuster:
Linear Independence without Choice. Ann. Pure Appl. Log. 101(1): 95-10 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-01 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: