Hyperarithmetical Sets (Q3305318)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Hyperarithmetical Sets	scientific article

Statements

scholarly article

Hyperarithmetical Sets (English)

Yiannis N. Moschovakis

Outstanding Contributions to Logic

publication date

6 August 2020

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1007/978-3-319-41842-1_5

Separation principles in the hierarchies of classical and effective descriptive set theory

A note on the hyperarithmetical hierarchy

Some applications of the notions of forcing and generic sets

General recursive functions of natural numbers

On notation for ordinal numbers

Recursive Predicates and Quantifiers

Arithmetical Predicates and Function Quantifiers

On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)

Hierarchies of number-theoretic predicates

Recursive Functionals and Quantifiers of Finite Types I

Constructive Versions of Ordinal Number Classes

Zur Theorie der konstruktiven Wohlordnungen

Many-one degrees of the predicates \(H_ a(x)\)

Abstract First Order Computability. I

Elementary induction on abstract structures

Classical descriptive set theory as a refinement of effective descriptive set theory

Kleene's Amazing Second Recursion Theorem

On definable sets of positive integers

Many-One Reducibility Within the Turning Degrees of the Hyperarithmetic Sets H a (x)

Recursively enumerable sets of positive integers and their decision problems

Recursive Unsolvability of a problem of Thue

Recursive well-orderings

On degrees of recursive unsolvability

Hyperarithmetical quantifiers

Forcing with tagged trees

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:3305318

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3305318&oldid=36605522"