Trial and error predicates and the solution to a problem of Mostowski
From MaRDI portal
Publication:5588612
DOI10.2307/2270581zbMath0193.30102OpenAlexW2087237939MaRDI QIDQ5588612
Publication date: 1965
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2270581
Related Items
Elementary theories and structural properties of d-c.e. and n-c.e. degrees, Self-reference and incompleteness in a non-monotonic setting, On cardinality of semilattices of enumerations of nondiscrete families, A logic for trial and error classifiers, On the danger of half-truths, Is Gold-Putnam diagonalization complete?, What is the Church-Turing Thesis?, Minimal numerations of positively computable families, There exists a maximal 3-c.e. enumeration degree, Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism, Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy, Ockham's razor, empirical complexity, and truth-finding efficiency, Infinitary self-reference in learning theory, Bounded query classes and the difference hierarchy, MODES OF CONVERGENCE TO THE TRUTH: STEPS TOWARD A BETTER EPISTEMOLOGY OF INDUCTION, Logic and probabilistic systems, Interpolating \(d\)-r.e. and REA degrees between r.e. degrees, Convergence of preference functions, A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE, Models of noncontradictory formulas and the Ershov hierarchy, Discrete Transfinite Computation, Fixed-parameter decidability: Extending parameterized complexity analysis, A classification of low c.e. sets and the Ershov hierarchy, On the quantifier of limiting realizability, Computation as an unbounded process, The Kleene Hierarchy Classification of Recursively Random Sequences, Learning algebraic structures with the help of Borel equivalence relations, Satisfying Predicates: Kleene's Proof of the Hilbert–Bernays Theorem, INTERLEAVING LOGIC AND COUNTING, On the possibility of inference to the best explanation, INCOMPLETENESS VIA PARADOX AND COMPLETENESS, Extending and interpreting Post's programme, A Survey of Results on the d-c.e. and n-c.e. Degrees, Nondensity of Double Bubbles in the D.C.E. Degrees, Learning Theory and Epistemology, Unnamed Item, Unnamed Item, Generalization of Shapiro's theorem to higher arities and noninjective notations, The co-discovery of conservation laws and particle families, Toward a theory of intelligence, Experience, generations, and limits in machine learning, The modal argument for hypercomputing minds, The concept of computability, Uncomputability: The problem of induction internalized, Hypercomputation: Philosophical issues, Bounded queries to SAT and the Boolean hierarchy, The d.r.e. degrees are not dense, The undecidability of propositional adaptive logic, Fine hierarchies and m-reducibilities in theoretical computer science, Realism, rhetoric, and reliability, Infima in the d.r.e. degrees, Epistemic entrenchment and arithmetical hierarchy, How to reason defeasibly, Computable categoricity and the Ershov hierarchy, HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT, Finitely Bounded Effective Computability, Revising Type-2 Computation and Degrees of Discontinuity, RECOGNIZING STRONG RANDOM REALS, Uniform density in Lindenbaum algebras, TRIAL AND ERROR MATHEMATICS I: DIALECTICAL AND QUASIDIALECTICAL SYSTEMS, Theory choice, theory change, and inductive truth-conduciveness, Causal learning with Occam's razor, A survey of results on the d.c.e. and \(n\)-c.e. degrees, Significato e verita nell'aritmetica peaniana, Experimental logics and \(\Delta^0_2\)-theories, On frequency-enumerable sets, A new Gödelian argument for hypercomputing minds based on the busy beaver problem, The case for hypercomputation, The many forms of hypercomputation, Zeno machines and hypercomputation, Turing computability: structural theory, A Natural Axiomatization of Computability and Proof of Church's Thesis, Putnam’s Theorem on the Complexity of Models, The Interpretation Existence Lemma, Positive enumerations, Model-theoretic properties of Turing degrees in the Ershov difference hierarchy, Difference randomness, Comments on some theories of fuzzy computation, Homogeneous \(0'\)-elements in structural partial orderings, Turing oracle machines, online computing, and three displacements in computability theory, THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION', Mind change optimal learning of Bayes net structure from dependency and independency data, Notes on naive semantics, On TAE machines and their computational power, The logic of reliable and efficient inquiry, Calculating the mind change complexity of learning algebraic structures, Limiting characterizations of low level space complexity classes, Unnamed Item
Cites Work
