Levels of uniformity

DOI10.1215/00294527-2018-0024zbMath1441.03028arXiv1505.03675OpenAlexW3098439316MaRDI QIDQ2418784

Rutger Kuyper

Publication date: 29 May 2019

Published in: Notre Dame Journal of Formal Logic, Mathematical Logic Quarterly (Search for Journal in Brave)

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

zbMATH Keywords

decidabilityalgorithmic randomnessMuchnik degreescomplexity of satisfiabilityMedvedev degrees\(\varepsilon\)-logic0-logic

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Logical aspects of lattices and related structures (03G10) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30) Subsystems of classical logic (including intuitionistic logic) (03B20) Paraconsistent logics (03B53) Algorithmic randomness and dimension (03D32)

Related Items (1)

Computability of validity and satisfiability in probability logics over finite and countable models

Cites Work

• Classical recursion theory. The theory of functions and sets of natural numbers
• Probability logic
• MODEL THEORY OF MEASURE SPACES AND PROBABILITY LOGIC
• Probabilistic Logic and Induction
• Robust logics

This page was built for publication: Levels of uniformity