Experimental logics and \(\Delta^0_2\)-theories

DOI10.1007/BF00262039zbMath0319.02024OpenAlexW2017019103MaRDI QIDQ1222647

Robert G. Jeroslow

Publication date: 1975

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00262039

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Hierarchies of computability and definability (03D55) Proof theory and constructive mathematics (03F99)

Related Items

Self-reference and incompleteness in a non-monotonic setting, A logic for trial and error classifiers, Logic and probabilistic systems, GENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑_n-DEFINABLE THEORIES OF ARITHMETIC, A topological characterization for closed sets under polar duality in \({\mathbb{Q}{}}^ n\), Epistemic entrenchment and arithmetical hierarchy, Empiricism, probability, and knowledge of arithmetic: a preliminary defense, Uniform density in Lindenbaum algebras, Experimental logics and Π₃⁰ theories, Representations of unbounded optimization problems as integer programs, On the complexity of models of arithmetic

Cites Work

• Linear programs dependent on a single parameter
• Su certe teorie non enumerabili. (Sulle limitazioni dei sistemi formali. I.)
• Arithmetization of metamathematics in a general setting
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Trial and error predicates and the solution to a problem of Mostowski
• Limiting recursion
• The completeness of the first-order functional calculus
• The consistency of arithmetics