Pages that link to "Item:Q3372439"
From MaRDI portal
The following pages link to Reflection principles and provability algebras in formal arithmetic (Q3372439):
Displaying 46 items.
- On elementary theories of ordinal notation systems based on reflection principles (Q281010) (← links)
- Positive provability logic for uniform reflection principles (Q392274) (← links)
- The paradox of the knower revisited (Q392283) (← links)
- Provability and interpretability logics with restricted realizations (Q435232) (← links)
- On the complexity of the closed fragment of Japaridze's provability logic (Q482919) (← links)
- Turing-Taylor expansions for arithmetic theories (Q514512) (← links)
- Kripke semantics for provability logic GLP (Q636316) (← links)
- Principles for object-linguistic consequence: from logical to irreflexive (Q722029) (← links)
- Henkin sentences and local reflection principles for Rosser provability (Q892168) (← links)
- Transductions in arithmetic (Q904144) (← links)
- The logical strength of compositional principles (Q1704080) (← links)
- Minimalism and the generalisation problem: on Horwich's second solution (Q1709090) (← links)
- Axiomatizing provable \(n\)-provability (Q1732059) (← links)
- Parameter free induction and provably total computable functions (Q1960416) (← links)
- The implicit commitment of arithmetical theories and its semantic core (Q2051133) (← links)
- Unprovability results for clause set cycles (Q2084942) (← links)
- The number of axioms (Q2120967) (← links)
- Reflection algebras and conservation results for theories of iterated truth (Q2120976) (← links)
- Hyperarithmetical worm battles (Q2151396) (← links)
- The logic of Turing progressions (Q2176413) (← links)
- Local reflection, definable elements and 1-provability (Q2204378) (← links)
- On a strengthening of the non-isomorphism theorem for provability algebras (Q2246876) (← links)
- Uniform density in Lindenbaum algebras (Q2258545) (← links)
- On the reduction property for GLP-algebras (Q2358595) (← links)
- A simplified proof of arithmetical completeness theorem for provability logic GLP (Q2510758) (← links)
- Characterizations of ordinal analysis (Q2683775) (← links)
- CONSISTENCY AND THE THEORY OF TRUTH (Q3195585) (← links)
- The Henkin Sentence (Q3454817) (← links)
- GENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑<sub><i>n</i></sub>-DEFINABLE THEORIES OF ARITHMETIC (Q4600818) (← links)
- ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR (Q4628679) (← links)
- Derived topologies on ordinals and stationary reflection (Q4644955) (← links)
- GÖDEL’S SECOND INCOMPLETENESS THEOREM: HOW IT IS DERIVED AND WHAT IT DELIVERS (Q4984860) (← links)
- MÜNCHHAUSEN PROVABILITY (Q5015723) (← links)
- REFLECTION RANKS AND ORDINAL ANALYSIS (Q5021919) (← links)
- HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC (Q5024504) (← links)
- A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH (Q5046601) (← links)
- AXIOMATIZATION OF PROVABLE n-PROVABILITY (Q5222538) (← links)
- Topological Interpretations of Provability Logic (Q5255798) (← links)
- PREDICATIVITY THROUGH TRANSFINITE REFLECTION (Q5359565) (← links)
- Reflection calculus and conservativity spectra (Q5377088) (← links)
- Evitable iterates of the consistency operator (Q5880939) (← links)
- HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK? (Q6103456) (← links)
- MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE (Q6103462) (← links)
- ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS (Q6131232) (← links)
- Semi-honest subrecursive degrees and the collection rule in arithmetic (Q6137350) (← links)
- AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW (Q6140183) (← links)
