Record link: 
http://hdl.handle.net/20.500.12708/209836
-
Title: 
Computable Structure Theory of Partial Combinatory Algebras
en
Citation: 
Fokina, E. B., & Terwijn, S. (2024). Computable Structure Theory of Partial Combinatory Algebras. In Twenty Years of Theoretical and Practical Synergies : 20th Conference on Computability in Europe, CiE 2024, Amsterdam, The Netherlands, July 8–12, 2024, Proceedings (pp. 265–276). Springer Cham. https://doi.org/10.1007/978-3-031-64309-5_21
-
Publisher DOI: 
10.1007/978-3-031-64309-5_21
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Language: 
English
-
Authors: 
Fokina, Ekaterina B. 
Terwijn, Sebastiaan 
-
Organisational Unit: 
E104-02 - Forschungsbereich Computational Logic 
-
Published in: 
Twenty Years of Theoretical and Practical Synergies : 20th Conference on Computability in Europe, CiE 2024, Amsterdam, The Netherlands, July 8–12, 2024, Proceedings 
-
ISBN: 
978-3-031-64309-5
-
Volume: 
14773
-
DOI of the book: 
10.1007/978-3-031-64309-5
-
Date (published): 
2024
-
Event name: 
20th Conference on Computability in Europe, CiE 2024 
en
Event date: 
8-Jul-2024 - 12-Jul-2024
-
Event place: 
Amsterdam, Netherlands (the)
-
Number of Pages: 
12
-
Publisher: 
Springer Cham
-
Peer reviewed: 
Yes
-
Keywords: 
computably enumerable structures; index set; isomorphism problem; partial combinatory algebra; partial structures
en
Abstract: 
We discuss the complexity of the class of countable partial combinatory algebras, coded as c.e. sets. We prove a completeness result, and also discuss the complexity of the isomorphism problem.
en
Project title: 
Strukturen durch Lernen Klassifizieren: P 36781-N (FWF - Österr. Wissenschaftsfonds) 
-
Research Areas: 
Fundamental Mathematics Research: 100%
-
Science Branch: 
1020 - Informatik: 5%
1010 - Mathematik: 95%
-
Appears in Collections:
Conference Paper

Show full item record

Google ScholarTM

Check