scientific article; zbMATH DE number 1062120

From MaRDI portal
Revision as of 22:50, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4354788

zbMath0882.03054MaRDI QIDQ4354788

No author found.

Publication date: 17 September 1997


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (25)

VARIANTS OF KREISEL’S CONJECTURE ON A NEW NOTION OF PROVABILITYA MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTHHOW MUCH PROPOSITIONAL LOGIC SUFFICES FOR ROSSER’S ESSENTIAL UNDECIDABILITY THEOREM?Slow reflectionOn predicate provability logics and binumerations of fragments of Peano arithmeticHenkin sentences and local reflection principles for Rosser provabilityStreamlined subrecursive degree theoryAXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEWTWO-SORTED FREGE ARITHMETIC IS NOT CONSERVATIVEGENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑n-DEFINABLE THEORIES OF ARITHMETICINCOMPLETENESS VIA PARADOX AND COMPLETENESSWeak theories of concatenation and arithmeticILLUSORY MODELS OF PEANO ARITHMETICYablifying the Rosser sentenceRosser-type undecidable sentences based on Yablo's paradoxHILBERT, DUALITY, AND THE GEOMETRICAL ROOTS OF MODEL THEORYOn Relating Theories: Proof-Theoretical ReductionMARGINALIA ON A THEOREM OF WOODINFaith \& falsityCURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMSThe implicit commitment of arithmetical theories and its semantic coreFINDING THE LIMIT OF INCOMPLETENESS ITHE CHARACTERIZATION OF WEIHRAUCH REDUCIBILITY IN SYSTEMS CONTAININGA new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\)REFLECTION RANKS AND ORDINAL ANALYSIS







This page was built for publication: