Pregled bibliografske jedinice broj: 864719
Maximal computability structures
Maximal computability structures // The bulletin of symbolic logic, 22 (2016), 4; 445-468 doi:10.1017/bsl.2016.26 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 864719 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Maximal computability structures
Autori
Iljazović, Zvonko ; Validžić, Lucija
Izvornik
The bulletin of symbolic logic (1079-8986) 22
(2016), 4;
445-468
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
computable metric space, separable computability structure, maximal computability structure
Sažetak
A computability structure on a metric space is a set of sequences which satisfy certain conditions. Of a particular interest are those computability structures which contain a dense sequence, so called separable computability structures. In this paper we observe maximal computability structures which are more general than separable computability structures and we examine their properties. In particular, we examine maximal computability structures on subspaces of Euclidean space, we give their characterization and we investigate conditions under which a maximal computability structure on such a space is unique. We also give a characterization of separable computability structures on a segment.
Izvorni jezik
Engleski
Znanstvena područja
Matematika, Računarstvo
POVEZANOST RADA
Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb,
Prirodoslovno-matematički fakultet, Zagreb
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
Uključenost u ostale bibliografske baze podataka::
- MathSciNet
- Zentrallblatt für Mathematik/Mathematical Abstracts