scientific article; zbMATH DE number 3316918

Cited in

(27)

Countable algebra and set existence axioms
Degrees of autostability relative to strong constructivizations of graphs
On the strength of Ramsey's theorem
The degree of decidable categoricity of a model with infinite solutions for complete formulas
Connected components of graphs and reverse mathematics
Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\)
Effective categoricity for distributive lattices and Heyting algebras
The Baire category theorem in weak subsystems of second-order arithmetic
Proper and piecewise proper families of reals
On notions of computability-theoretic reduction between Π21 principles
Degrees of unsolvability: a tutorial
Propagation of partial randomness
Infinite dimensional proper subspaces of computable vector spaces
Representing Scott sets in algebraic settings
Degrees of bi-embeddable categoricity
THE CHARACTERIZATION OF WEIHRAUCH REDUCIBILITY IN SYSTEMS CONTAINING
Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic
Computable categoricity for algebraic fields with splitting algorithms
The prehistory of the subsystems of second-order arithmetic
Solovay's theorem cannot be simplified
Decidable categoricity spectra for almost prime models
The self-embedding theorem of \(\text{WKL}_ 0\) and a non-standard method
^0_4 conservation of Ramsey's theorem for pairs
Some notes on uncountable models of arithmetic
Mass problems associated with effectively closed sets
On categoricity spectra for locally finite graphs
A standard model of Peano arithmetic with no conservative elementary extension

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5596777)