Enumeration

Results: 726



#Item
681Mathematical logic / Symbol / Logic / Computable function / Structure / Model theory / Busy beaver / Spinor / Theory of computation / Mathematics / Computability theory

Splitting and Nonsplitting in the Σ02 Enumeration Degrees∗ M. M. Arslanov1 , S. B. Cooper2 , I. Sh. Kalimullin1

Add to Reading List

Source URL: www.fmi.uni-sofia.bg

Language: English - Date: 2009-10-12 05:07:37
682Set theory / Logic / Ordinal numbers / Curry–Howard correspondence / Mathematics / Constructible universe / Enumeration

Genericity and Nonbounding in the Enumeration degrees Mariya Ivanova Soskova

Add to Reading List

Source URL: www.fmi.uni-sofia.bg

Language: English - Date: 2008-02-28 12:55:18
683Enumeration / Turing degree / Constructible universe / Ordinal number / Series / Forcing / Mathematics / Mathematical logic / Enumerative combinatorics

EMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE ENUMERATION DEGREES AND THE ω-ENUMERATION DEGREES

Add to Reading List

Source URL: www.fmi.uni-sofia.bg

Language: English - Date: 2009-11-24 09:48:56
684Turing degree / Recursively enumerable set / Turing reduction / Reduction / Structure / Order / Computability theory / Mathematics / Enumeration

DEFINABILITY VIA KALIMULLIN PAIRS IN THE STRUCTURE OF THE ENUMERATION DEGREES HRISTO A. GANCHEV† AND MARIYA I. SOSKOVA†‡

Add to Reading List

Source URL: www.fmi.uni-sofia.bg

Language: English - Date: 2013-01-04 08:54:41
685Philosophy of mathematics / Turing degree / Turing jump / Enumeration / Theodore Slaman / Arithmetical set / Computability theory / Mathematics / Logic

THE AUTOMORPHISM GROUP OF THE ENUMERATION DEGREES MARIYA I. SOSKOVA†

Add to Reading List

Source URL: www.fmi.uni-sofia.bg

Language: English - Date: 2013-11-11 20:26:54
686Theoretical physics / Orbifold / Symbol / Mathematics / Mathematical analysis

Total Degrees and Nonsplitting Properties of Σ20 Enumeration Degrees M. M. Arslanov† , S. B. Cooper‡ , I. Sh. Kalimullin† and M. I. Soskova‡

Add to Reading List

Source URL: www.fmi.uni-sofia.bg

Language: English - Date: 2008-02-28 12:31:24
687Enumerative combinatorics / Mathematical logic / Enumeration / Recursively enumerable set / Degree / Turing degree / Mathematics / Computability theory / Theory of computation

The Local Structure of the Enumeration Degrees

Add to Reading List

Source URL: www.fmi.uni-sofia.bg

Language: English - Date: 2008-07-19 09:57:30
688Enumerated type / Type theory / Enumeration / Census / Statistics / Genealogy / Mathematics

1930 Census Abstract Page 1 of 3

Add to Reading List

Source URL: www.genealogy.com

Language: English - Date: 2003-02-13 12:06:29
689Set theory / Z notation / Constructible universe / Deduction / Mathematical logic / Mathematics / S

How Enumeration Reducibility Yields Extended Harrington Non-splitting Mariya Ivanova Soskova and S. Barry Cooper

Add to Reading List

Source URL: www.fmi.uni-sofia.bg

Language: English - Date: 2007-07-11 12:11:54
690Mathematics / Turing degree / Turing reduction / Turing jump / Enumeration / Low / Recursively enumerable set / Arithmetical hierarchy / Halting problem / Computability theory / Theoretical computer science / Mathematical logic

The Turing universe in the context of enumeration reducibility Mariya I. Soskova Sofia University and University of California, Berkeley A fundamental goal of computability theory is to understand the way that

Add to Reading List

Source URL: www.fmi.uni-sofia.bg

Language: English - Date: 2013-11-11 20:32:42
UPDATE