Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
From MaRDI portal
Cited in
(62)- Positive provability logic for uniform reflection principles
- The paradox of the knower revisited
- Too naturalist and not naturalist enough: Reply to Horsten
- A survey of proof theory
- Mathematical developments of the incompleteness theorems
- On the complexity of arithmetical interpretations of modal formulae
- MÜNCHHAUSEN PROVABILITY
- Semi-honest subrecursive degrees and the collection rule in arithmetic
- Remarks on Herbrand normal forms and Herbrand realizations
- Axiomatizing provable \(n\)-provability
- Induction rules, reflection principles, and provably recursive functions
- Bar Induction and Π11-CA
- Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\)
- Reflection calculus and conservativity spectra
- On interpreting Chaitin's incompleteness theorem
- Paris-Harrington principles, reflection principles and transfinite induction up to \(\epsilon _ 0\)
- Bimodal logics for extensions of arithmetical theories
- Truth, reflection and hierarchies
- AXIOMATIZATION OF PROVABLE n-PROVABILITY
- Remarks on weak notions of saturation in models of Peano arithmetic
- Proof theoretic analysis by iterated reflection
- Gentzen reduction revisited
- Slow reflection
- Set-theoretic reflection is equivalent to induction over well-founded classes
- On the No-Counterexample Interpretation
- Levy and set theory
- The ω-consistency of number theory via Herbrand's theorem
- Reflection of formal tactics in a deductive reflection framework
- Reflection algebras and conservation results for theories of iterated truth
- Generalizations of Gödel's incompleteness theorems for \(\Sigma_n\)-definable theories of arithmetic
- A note on applicability of the incompleteness theorem to human mind
- Natural constructive proofs of A via A B, proof paradoxes, and impredicativity
- A simple dynamic logic
- Cognitive projects and the trustworthiness of positive truth
- Set existence property for intuitionistic theories with dependent choice
- Henkin sentences and local reflection principles for Rosser provability
- PREDICATIVITY THROUGH TRANSFINITE REFLECTION
- Iterated reflection principles and the ω-rule
- Experimental logics and ^0_2-theories
- Feferman and the Truth
- The implicit commitment of arithmetical theories and its semantic core
- On the conservation results for local reflection principles
- Provability: The emergence of a mathematical modality
- A note on iterated consistency and infinite proofs
- Subsystems of true arithmetic and hierarchies of functions
- Iterated local reflection versus iterated consistency
- Quantifier-free and one-quantifier systems
- Herbrand-Analysen zweier Beweise des Satzes von Roth: Polynomiale Anzahlschranken
- Mechanizing \(\omega\)-order type theory through unification
- Reflection ranks and ordinal analysis
- Extended normal form theorems for logical proofs from axioms
- Characterizations of ordinal analysis
- On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
- Local reflection, definable elements and 1-provability
- Reducing ω-model reflection to iterated syntactic reflection
- Parameter free induction and provably total computable functions
- Disquotation and infinite conjunctions
- Some results on cut-elimination, provable well-orderings, induction and reflection
- A note on fragments of uniform reflection in second order arithmetic
- Self-reference in arithmetic. II
- The relation of A to Prov ˹A˺ in the Lindenbaum sentence algebra
- A mathematical commitment without computational strength
This page was built for publication: Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5552747)
