Logo Logo
Eine Ebene nach oben
Exportieren als [RSS feed] RSS 1.0 [RSS2 feed] RSS 2.0
Gruppiert nach: Dokumententyp | Veröffentlichungsdatum
Anzahl der Publikationen: 8

Zeitschriftenartikel

Petrakis, Iosif ORCID logoORCID: https://orcid.org/0000-0002-4121-7455 (2022): Proof-relevance in Bishop-style constructive mathematics. In: Mathematical Structures in Computer Science, Bd. 32, Nr. 1: S. 1-43 [PDF, 617kB]

Petrakis, Iosif (2021): DIRECT SPECTRA OF BISHOP SPACES AND THEIR LIMITS. In: Logical Methods in Computer Science, Bd. 17, Nr. 2, 4

Petrakis, Iosif (2020): Embeddings of Bishop spaces. In: Journal of Logic and Computation, Bd. 30, Nr. 1: S. 349-379

Petrakis, Iosif (2020): MCSHANE-WHITNEY EXTENSIONS IN CONSTRUCTIVE ANALYSIS. In: Logical Methods in Computer Science, Bd. 16, Nr. 1, 18

Petrakis, Iosif (2016): Limit spaces with approximations. In: Annals of Pure and Applied Logic, Bd. 167, Nr. 9: S. 737-752

Buchbeitrag

Petrakis, Iosif (2016): The Urysohn Extension Theorem for Bishop Spaces. In: Logical Foundations of Computer Science: International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings. Lecture Notes in Computer Science, Bd. 9537. Cham: Springer. S. 299-316

Petrakis, Iosif (2016): A Direct Constructive Proof of a Stone-Weierstrass Theorem for Metric Spaces. In: Beckmann, Arnold; Bienvenu, Laurent und Jonoska, Nataša (Hrsg.): Pursuit of the Universal. 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings. Theoretical Computer Science and General Issues, Bd. 9709. Cham: Springer. S. 364-374

Konferenzbeitrag

Petrakis, Iosif (2016): A constructive function-theoretic approach to topological compactness. 31st Annual ACM/IEEE Symposium on Logic in Computer Science LICS '16, New York, NY, USA, July 05 - 08, 2016. In: Proceedings of the 31St Annual Acm-Ieee Symposium On Logic in Computer Science (LICS 2016), New York: Association for Computing Machinery. S. 605-614

Diese Liste wurde am Sat Mar 23 19:30:24 2024 CET erstellt.