On a computability-theoretic approach to Boolean-valued models
From MaRDI portal
Cites work
- A proof of the independence of the continuum hypothesis
- Autostability of models
- Categoricity spectra of computable structures
- Classical recursion theory. The theory of functions and sets of natural numbers.
- Computable functors and effective interpretability
- Computable structure theory. A unified approach
- Computable structures and the hyperarithmetical hierarchy
- CONSTRUCTIVE ALGEBRAS I
- Decidable models
- Degree spectra and computable dimensions in algebraic structures
- scientific article; zbMATH DE number 2184445 (Why is no real title available?)
- scientific article; zbMATH DE number 3779289 (Why is no real title available?)
- scientific article; zbMATH DE number 42239 (Why is no real title available?)
- scientific article; zbMATH DE number 3458610 (Why is no real title available?)
- scientific article; zbMATH DE number 1269535 (Why is no real title available?)
- scientific article; zbMATH DE number 1302870 (Why is no real title available?)
- scientific article; zbMATH DE number 1450824 (Why is no real title available?)
- scientific article; zbMATH DE number 3259044 (Why is no real title available?)
- scientific article; zbMATH DE number 3411031 (Why is no real title available?)
- Interval fuzzy algebraic systems
- Problem of the number of non-self-equivalent constructivizations
- Recursive isomorphism types of recursive Boolean algebras
- Solvable cases of the decision problem
- Strong and weak constructivization and computable families
- Über Möglichkeiten im Relativkalkul.
This page was built for publication: On a computability-theoretic approach to Boolean-valued models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7290064)
