Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
From MaRDI portal
Publication:5552747
DOI10.1002/malq.19680140702zbMath0167.01302OpenAlexW2093435953MaRDI QIDQ5552747
Publication date: 1968
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19680140702
Related Items
Reflection algebras and conservation results for theories of iterated truth, Iterated reflection principles and the ω-rule, Paris-Harrington principles, reflection principles and transfinite induction up to \(\epsilon _ 0\), A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC, A simple dynamic logic, A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH, A survey of proof theory, Bar Induction and Π11-CA, Iterated local reflection versus iterated consistency, Truth, reflection and hierarchies, Induction rules, reflection principles, and provably recursive functions, Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\), Slow reflection, Remarks on weak notions of saturation in models of Peano arithmetic, Positive provability logic for uniform reflection principles, The paradox of the knower revisited, Reducing ω-model reflection to iterated syntactic reflection, Henkin sentences and local reflection principles for Rosser provability, Gentzen reduction revisited, Characterizations of ordinal analysis, Semi-honest subrecursive degrees and the collection rule in arithmetic, PREDICATIVITY THROUGH TRANSFINITE REFLECTION, GENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑n-DEFINABLE THEORIES OF ARITHMETIC, Set-theoretic reflection is equivalent to induction over well-founded classes, Local reflection, definable elements and 1-provability, Reflection calculus and conservativity spectra, Parameter free induction and provably total computable functions, Bimodal logics for extensions of arithmetical theories, On axiom schemes for \(T\)-provably \(\Delta_1\) formulas, Provability: The emergence of a mathematical modality, The ω-consistency of number theory via Herbrand's theorem, Axiomatizing provable \(n\)-provability, A note on iterated consistency and infinite proofs, Proof Theoretic Analysis by Iterated Reflection, Herbrand-Analysen zweier Beweise des Satzes von Roth: Polynomiale Anzahlschranken, Reflection of formal tactics in a deductive reflection framework, Disquotation and infinite conjunctions, Too naturalist and not naturalist enough: Reply to Horsten, Subsystems of true arithmetic and hierarchies of functions, On the complexity of arithmetical interpretations of modal formulae, SELF-REFERENCE IN ARITHMETIC II, The relation of A to Prov ˹A˺ in the Lindenbaum sentence algebra, Levy and set theory, Experimental logics and \(\Delta^0_2\)-theories, Mechanizing \(\omega\)-order type theory through unification, On the No-Counterexample Interpretation, Feferman and the Truth, The implicit commitment of arithmetical theories and its semantic core, Remarks on Herbrand normal forms and Herbrand realizations, AXIOMATIZATION OF PROVABLE n-PROVABILITY, On interpreting Chaitin's incompleteness theorem, Quantifier-free and one-quantifier systems, Extended normal form theorems for logical proofs from axioms, Some results on cut-elimination, provable well-orderings, induction and reflection, A note on applicability of the incompleteness theorem to human mind, Set existence property for intuitionistic theories with dependent choice, MÜNCHHAUSEN PROVABILITY, REFLECTION RANKS AND ORDINAL ANALYSIS
