Mass problems and intuitionistic higher-order logic

DOI10.3233/COM-150041MaRDI QIDQ2799749

Stephen G. Simpson, Sankha S. Basu

Publication date: 13 April 2016

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.2763

zbMATH Keywords

higher-order logicsheavestopos theorycomputable analysissheaf theoryintuitionismMuchnik degreesmass problemsdegrees of unsolvabilityKolmogorov

Mathematics Subject Classification ID

Categorical logic, topoi (03G30) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

First-order logic in the Medvedev lattice

Cites Work

• Unnamed Item
• Natural factors of the Muchnik lattice capturing IPC
• Basic subtoposes of the effective topos
• Intuitionistic logic and Muchnik degrees
• Mass problems associated with effectively closed sets
• Mass problems and intuitionism
• Zur Deutung der intuitionistischen Logik
• Five observations concerning the intended meaning of the intuitionistic logical constants
• Axiom of Choice and Complementation
• On the interpretation of intuitionistic number theory
• Realizability: a historical essay

This page was built for publication: Mass problems and intuitionistic higher-order logic