Transfinite recursive progressions of axiomatic theories

Cites work

Einige Betrachtungen über die Begriffe der ω-Widerspruchsfreiheit und der ω-Vollständigkeit
Gödel Theorems for Non-Constructive Logics
Number theoretic concepts and recursive well-orderings
On the Forms of the Predicates in the Theory of Constructive Ordinals
On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)

Cited in

(71)

How to build a hypercomputer
Languages with self-reference. II: Knowledge, belief, and modality
Prolegomena to a theory of mechanized formal reasoning
On the set of 'meaningful' sentences of arithmetic
A sequence of theories for arithmetic whose union is complete
A note on applicability of the incompleteness theorem to human mind
Multilanguage hierarchical logics, or: How we can do without modal logics
On bimodal logics of provability
Consequences of an exotic definition for \(\text{P}=\text{NP}\).
Axiomatizing provable \(n\)-provability
The knower paradox in the light of provability interpretations of modal logic
Some problems of completeness of arithmetic
Mechanism, truth, and Penrose's new argument
Iterated local reflection versus iterated consistency
Transfinite induction within Peano arithmetic
Jean van Heijenoort's conception of modern logic, in historical perspective
The implicit commitment of arithmetical theories and its semantic core
Local reflection, definable elements and 1-provability
The scope of Gödel's first incompleteness theorem
On the metamathematics of the P vs. NP question
Truth, reflection and hierarchies
Some thoughts on hypercomputation
On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories
A metatheory of a mechanized object theory
Proof-producing reflection for HOL. With an application to model polymorphism
Classifications of Recursive Functions by Means of Hierarchies
Why post did [not] have Turing's thesis
Paraconsistent or paracomplete?
A fortuitous year with Leon Henkin
The paradox of the knower revisited
Incompleteness, Mechanism, and Optimism
A metalogic programming approach: language, semantics and applications
Intuitionism and the liar paradox
Classes and truths in set theory
IN MEMORIAM: SOLOMON FEFERMAN (1928–2016)
Proof theoretic analysis by iterated reflection
Transfinite Progressions: A Second Look at Completeness
Arithmetical interpretations and Kripke frames of predicate modal logic of provability
Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski
Current research on Gödel's incompleteness theorems
Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic
A note on fragments of uniform reflection in second order arithmetic
Gödelian sentences and semantic arguments
Adding Metalogic Features to Knowledge Representation Languages*
A new application for explanation-based generalisation within automated deduction
A deflationary account of the truth of the Gödel sentence \(\mathcal{G}\)
Unfolding schematic systems
Feferman and the Truth
AXIOMATIZATION OF PROVABLE n-PROVABILITY
La prédicativité
Reflection calculus and conservativity spectra
1 — Consistency and faithful interpretations
Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive -rule
An open formalism against incompleteness
Reducing ω-model reflection to iterated syntactic reflection
An implication of Gödel's incompleteness theorem. II: Not referring to the validity of oneself's assertion
A theory of implicit commitment
On the hierarchy of natural theories
Subsystems of true arithmetic and hierarchies of functions
Feferman's completeness theorem
Non-tightness in class theory and second-order arithmetic
Cognitive projects and the trustworthiness of positive truth
Another look at reflection
Automatic structures and the problem of natural well-orderings
Iterating reflection over intuitionistic arithmetic
Completeness of the primitive recursive \(\omega \)-rule
Logic of paradox revisited
Provability logics for natural Turing progressions of arithmetical theories
Informal versus formal mathematics
Inductive full satisfaction classes
Localizing the axioms

This page was built for publication: Transfinite recursive progressions of axiomatic theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5727661)