Abstract First Order Computability. I

Cited in

(32)

Operational set theory and small large cardinals
Translatability of schemas over restricted interpretations
EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER
Computation over algebraic structures and a classification of undecidable problems
Monotone inductive definitions in a constructive theory of functions and classes
Inductive Definitions and Computability
Fixed points on the real numbers without the equality test
Hyperarithmetical Sets
Hierarchies of Effective Descriptive Set Theory
Feferman on computability
Ivan Soskov: a life in computability
Rice sequences of relations
Some applications of computable one-one numberings
Introduction to Turing categories
Computability by nondeterministic program and the Moschovakis search computability
Computational inductive definability
Enumeration reducibility and computable structure theory
A note on three-valued logic and Tarski theorem on truth definitions
Computability by means of effectively definable schemes and definability via enumerations
Inductive definitions over finite structures
Computing measure as a primitive operation in real number computation
scientific article; zbMATH DE number 3568670 (Why is no real title available?)
Exact effective enumerations of total functional structures
Parametrization over inductive relations of a bounded number of variables
Computation by `While' programs on topological partial algebras
scientific article; zbMATH DE number 7809184 (Why is no real title available?)
D. Skordev's hypothesis
scientific article; zbMATH DE number 3372032 (Why is no real title available?)
On Σ‐definability without equality over the real numbers
Floyd's principle, correctness theories and program equivalence
The Game Quantifier
The jump operation for structure degrees

This page was built for publication: Abstract First Order Computability. I

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