Pages that link to "Item:Q5727661"
From MaRDI portal
The following pages link to Transfinite recursive progressions of axiomatic theories (Q5727661):
Displayed 50 items.
- The paradox of the knower revisited (Q392283) (← links)
- Intuitionism and the liar paradox (Q448337) (← links)
- Classes and truths in set theory (Q450946) (← links)
- An implication of Gödel's incompleteness theorem. II: Not referring to the validity of oneself's assertion (Q662344) (← links)
- Subsystems of true arithmetic and hierarchies of functions (Q688433) (← links)
- Completeness of the primitive recursive \(\omega \)-rule (Q781515) (← links)
- Logic of paradox revisited (Q795814) (← links)
- Provability logics for natural Turing progressions of arithmetical theories (Q804564) (← links)
- Informal versus formal mathematics (Q885512) (← links)
- Inductive full satisfaction classes (Q920081) (← links)
- Localizing the axioms (Q982186) (← links)
- How to build a hypercomputer (Q1036529) (← links)
- Languages with self-reference. II: Knowledge, belief, and modality (Q1101099) (← links)
- Prolegomena to a theory of mechanized formal reasoning (Q1140436) (← links)
- On the set of 'meaningful' sentences of arithmetic (Q1256458) (← links)
- A sequence of theories for arithmetic whose union is complete (Q1259592) (← links)
- A note on applicability of the incompleteness theorem to human mind (Q1295425) (← links)
- Multilanguage hierarchical logics, or: How we can do without modal logics (Q1313954) (← links)
- On bimodal logics of provability (Q1332858) (← links)
- Consequences of an exotic definition for \(\text{P}=\text{NP}\). (Q1412482) (← links)
- Axiomatizing provable \(n\)-provability (Q1732059) (← links)
- The knower paradox in the light of provability interpretations of modal logic (Q1778104) (← links)
- Some problems of completeness of arithmetic (Q1846862) (← links)
- Mechanism, truth, and Penrose's new argument (Q1871136) (← links)
- Iterated local reflection versus iterated consistency (Q1899141) (← links)
- Transfinite induction within Peano arithmetic (Q1919522) (← links)
- Jean van Heijenoort's conception of modern logic, in historical perspective (Q1942093) (← links)
- The implicit commitment of arithmetical theories and its semantic core (Q2051133) (← links)
- Local reflection, definable elements and 1-provability (Q2204378) (← links)
- The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
- On the metamathematics of the P vs. NP question (Q2383632) (← links)
- Truth, reflection and hierarchies (Q2386109) (← links)
- Some thoughts on hypercomputation (Q2497877) (← links)
- On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories (Q2566065) (← links)
- A metatheory of a mechanized object theory (Q2676562) (← links)
- Proof-Producing Reflection for HOL (Q2945631) (← links)
- Classifications of Recursive Functions by Means of Hierarchies (Q3291527) (← links)
- Why Post Did [Not] Have Turing’s Thesis (Q3305321) (← links)
- Paraconsistent or Paracomplete? (Q3305660) (← links)
- A Fortuitous Year with Leon Henkin (Q3454802) (← links)
- Incompleteness, Mechanism, and Optimism (Q4227855) (← links)
- A metalogic programming approach: language, semantics and applications (Q4305334) (← links)
- IN MEMORIAM: SOLOMON FEFERMAN (1928–2016) (Q4602436) (← links)
- Proof Theoretic Analysis by Iterated Reflection (Q4637223) (← links)
- Transfinite Progressions: A Second Look at Completeness (Q4678945) (← links)
- ARITHMETICAL INTERPRETATIONS AND KRIPKE FRAMES OF PREDICATE MODAL LOGIC OF PROVABILITY (Q4918381) (← links)
- Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski (Q4953233) (← links)
- CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS (Q4959663) (← links)
- HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC (Q5024504) (← links)
- A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC (Q5044314) (← links)