Skip to main menu
Scroll to content
PL
|
EN
Full-text resources of PSJD and other databases are now available in the new Library of Science.
Visit
https://bibliotekanauki.pl
Search
Browse
About
test
PL
EN
BibTeX
PN-ISO 690:2012
Chicago
Chicago (Author-Date)
Harvard
ACS
ACS (no art. title)
IEEE
Preferences
Polski
English
Language
enabled
[disable]
Abstract
10
20
50
100
Number of results
Tools
PL
EN
BibTeX
PN-ISO 690:2012
Chicago
Chicago (Author-Date)
Harvard
ACS
ACS (no art. title)
IEEE
Link to site
Copy
Journal
Reports on Mathematical Logic
2014
|
49
|
Article title
RECURSIVELY ENUMERABLE SETS AND WELL-ORDERING OF THEIR ENUMERATIONS
Authors
Jerzy Mycka
Content
Full texts:
Download
Title variants
Languages of publication
PL
Abstracts
PL
We will introduce the special kind of the order relations into recursively enumerable sets and prove that they can be used to distinguish (albeit in a non-constructive way) between recursive and non-recursive sets.
Keywords
PL
Publisher
[unknown2]
Journal
Reports on Mathematical Logic
Year
2014
Volume
49
Physical description
Dates
published
2014
online
07 - 07 - 2015
Contributors
author
Jerzy Mycka
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.ojs-issn-2084-2589-year-2014-volume-49-article-2921
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.