Transfinite recursive progressions of axiomatic theories

DOI10.2307/2964649zbMath0117.25402OpenAlexW2005337919MaRDI QIDQ5727661

Publication date: 1963

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

Full work available at URL: https://doi.org/10.2307/2964649

zbMATH Keywords

mathematical logic

Related Items

On bimodal logics of provability, A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC, A Fortuitous Year with Leon Henkin, Gödelian sentences and semantic arguments, On the metamathematics of the P vs. NP question, Languages with self-reference. II: Knowledge, belief, and modality, Iterated local reflection versus iterated consistency, Truth, reflection and hierarchies, Transfinite induction within Peano arithmetic, A metalogic programming approach: language, semantics and applications, La prédicativité, Proof-Producing Reflection for HOL, Informal versus formal mathematics, The paradox of the knower revisited, Reducing ω-model reflection to iterated syntactic reflection, A metatheory of a mechanized object theory, Prolegomena to a theory of mechanized formal reasoning, Jean van Heijenoort's conception of modern logic, in historical perspective, IN MEMORIAM: SOLOMON FEFERMAN (1928–2016), Local reflection, definable elements and 1-provability, Consequences of an exotic definition for $\text{P}=\text{NP}$., Intuitionism and the liar paradox, Classes and truths in set theory, Reflection calculus and conservativity spectra, Inductive full satisfaction classes, An implication of Gödel's incompleteness theorem. II: Not referring to the validity of oneself's assertion, Axiomatizing provable $n$-provability, Proof Theoretic Analysis by Iterated Reflection, Why Post Did [Not Have Turing’s Thesis], Paraconsistent or Paracomplete?, Adding Metalogic Features to Knowledge Representation Languages*, Subsystems of true arithmetic and hierarchies of functions, ARITHMETICAL INTERPRETATIONS AND KRIPKE FRAMES OF PREDICATE MODAL LOGIC OF PROVABILITY, The scope of Gödel's first incompleteness theorem, 1 — Consistency and faithful interpretations, Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive $\omega$-rule, An open formalism against incompleteness, Localizing the axioms, Some thoughts on hypercomputation, Transfinite Progressions: A Second Look at Completeness, The knower paradox in the light of provability interpretations of modal logic, 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, A new application for explanation-based generalisation within automated deduction, On the set of 'meaningful' sentences of arithmetic, A Deflationary Account of the Truth of the Gödel Sentence $$\mathcal{G}$$, Unfolding Schematic Systems, Feferman and the Truth, A sequence of theories for arithmetic whose union is complete, The implicit commitment of arithmetical theories and its semantic core, AXIOMATIZATION OF PROVABLE n-PROVABILITY, How to build a hypercomputer, Completeness of the primitive recursive $\omega $-rule, On the limit existence principles in elementary arithmetic and $\varSigma_{n}^{0}$-consequences of theories, A note on applicability of the incompleteness theorem to human mind, Some problems of completeness of arithmetic, Logic of paradox revisited, Classifications of Recursive Functions by Means of Hierarchies, Incompleteness, Mechanism, and Optimism, Multilanguage hierarchical logics, or: How we can do without modal logics, Provability logics for natural Turing progressions of arithmetical theories, HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC, Mechanism, truth, and Penrose's new argument

Cites Work