scientific article; zbMATH DE number 1233702

Publication date: 17 December 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

prediction experiment reducibility automata theory probability completeness causality topology confirmation diagonalization computability Reliability observation relativism hypothesis assessment logic of inquiry

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Methodology of mathematics (00A35) Foundations of classical theories (including reverse mathematics) (03B30) Applications of computability and recursion theory (03D80) Other applications of logic (03B80)

Related Items (73)

Refuting learning revisited. ⋮ Learning power and language expressiveness. ⋮ Convergence to the truth without countable additivity ⋮ On the classification of computable languages ⋮ Question–answer games ⋮ Invariance Properties of Quantifiers and Multiagent Information Exchange ⋮ Computation as social agency: what, how and who ⋮ Ockham's razor, empirical complexity, and truth-finding efficiency ⋮ Induction: a logical analysis ⋮ Private announcements on topological spaces ⋮ MODES OF CONVERGENCE TO THE TRUTH: STEPS TOWARD A BETTER EPISTEMOLOGY OF INDUCTION ⋮ Epistemic justification: its subjective and its objective ways ⋮ Optimality justifications: new foundations for foundation-oriented epistemology ⋮ The logic of empirical theories revisited ⋮ The Topology of Statistical Verifiability ⋮ A topological approach to full belief ⋮ Degrees of riskiness, falsifiability, and truthlikeness. A neo-Popperian account applicable to probabilistic theories ⋮ On the possibility of inference to the best explanation ⋮ A continuum-valued logic of degrees of probability ⋮ Agency and Interaction What We Are and What We Do in Formal Epistemology ⋮ Learning Theory and Epistemology ⋮ Unnamed Item ⋮ The co-discovery of conservation laws and particle families ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Topological Properties of Concept Spaces ⋮ Inferring answers to queries ⋮ Assessing theories, Bayes style ⋮ Uncomputability: The problem of induction internalized ⋮ Don't ever do that! Long-term duties in \(PD_{e}L\) ⋮ Finite additivity, another lottery paradox and conditionalisation ⋮ On the epistemological analysis of modeling and computational error in the mathematical sciences ⋮ Group Knowledge in Interrogative Epistemology ⋮ Talking About Knowledge ⋮ The undecidability of propositional adaptive logic ⋮ Finitistic and frequentistic approximation of probability measures with or without \(\sigma\)-additivity ⋮ A Dynamic Logic of Interrogative Inquiry ⋮ Tracking Information ⋮ A geometric principle of indifference ⋮ Realism, rhetoric, and reliability ⋮ No Answer to Hume ⋮ On the justification of deduction and induction ⋮ Scientific discovery based on belief revision ⋮ What If the Principle of Induction Is Normative? Formal Learning Theory and Hume’s Problem ⋮ Toward a dynamic logic of questions ⋮ Topological properties of concept spaces (full version) ⋮ Scientific discovery on positive data via belief revision ⋮ A Grim semantics for logics of belief ⋮ TRIAL AND ERROR MATHEMATICS I: DIALECTICAL AND QUASIDIALECTICAL SYSTEMS ⋮ Theory choice, theory change, and inductive truth-conduciveness ⋮ Causal learning with Occam's razor ⋮ Modeling reasoning in a social setting ⋮ Mind change efficient learning ⋮ The many forms of hypercomputation ⋮ A dynamic logic for learning theory ⋮ Learning by Erasing in Dynamic Epistemic Logic ⋮ Bayesian convergence and the fair-balance paradox ⋮ Identification through Inductive Verification ⋮ Announcement as effort on topological spaces ⋮ Justified Belief and the Topology of Evidence ⋮ Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories ⋮ Dynamic logic for belief revision ⋮ Dynamic update with probabilities ⋮ Bridging learning theory and dynamic epistemic logic ⋮ Merging frameworks for interaction ⋮ Objectively reliable subjective probabilities ⋮ Belief revision in the service of scientific discovery ⋮ A Computational Learning Semantics for Inductive Empirical Knowledge ⋮ The logic of reliable and efficient inquiry ⋮ Induction by enumeration ⋮ Toward a theory of play: a logical perspective on games and interaction ⋮ Generalized logical consequence: Making room for induction in the logic of science ⋮ Unifying logic, topology and learning in parametric logic

This page was built for publication: