The Medvedev lattice of computably closed sets
type: Item
instance of: scholarly article
title: The Medvedev lattice of computably closed sets
zbMATH Open document ID: 1090.03010
author: Sebastiaan A. Terwijn
published in: Archive for Mathematical Logic
publication date: 2006-03-21T00:00:00Z
Mathematics Subject Classification ID: 03D30
Mathematics Subject Classification ID: 03B55
zbMATH DE Number: 5013635
zbMATH Keywords: Medvedev reducibility
zbMATH Keywords: intuitionistic propositional logic
MaRDI profile type: Publication
full work available at URL: s00153-005-0278-y
OpenAlex ID: W1986089430
cites work: Q4083730
cites work: A splitting theorem for the Medvedev and Muchnik lattices
cites work: Embeddings into the Medvedev and Muchnik lattices of \(\Pi^0_1\) classes
cites work: Q4934277
cites work: Density of the Medvedev lattice of \(\Pi^0_1\) classes
cites work: Countable retracing functions and \(\Pi_2^0\) predicates
cites work: Degrees of members of \(\Pi_ 1^ 0\) classes
cites work: ∏ 0 1 Classes and Degrees of Theories
cites work: Classical recursion theory. The theory of functions and sets of natural numbers
cites work: Classical recursion theory. Vol. II
cites work: Q5573961
cites work: Q3794148
cites work: Some remarks on the algebraic structure of the Medvedev Lattice
cites work: Embedding Brouwer algebra in the Medvedev lattice
cites work: Some Quotient Lattices of the Medvedev Lattice
cites work: Q4863250
cites work: Q3418262
cites work: Constructive logic and the Medvedev lattice
DOI: 10.1007/S00153-005-0278-Y
description: scientific article; zbMATH DE number 5013635