CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS (Q4959663)

scientific article; zbMATH DE number 7396323

Language	Label	Description	Also known as
English	CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS	scientific article; zbMATH DE number 7396323

Statements

instance of

scholarly article

0 references

title

CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS (English)

0 references

zbMATH Open document ID

0 references

0 references

0 references

The Bulletin of Symbolic Logic

0 references

publication date

17 September 2021

0 references

full work available at URL

https://arxiv.org/abs/2009.04887

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Gödel's first incompleteness theorem

0 references

Gödel's second incompleteness theorem

0 references

concrete incompleteness

0 references

interpretation

0 references

intensionality

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Existentially closed structures and Gödel's second incompleteness theorem

0 references

Derivability conditions on Rosser's provability predicates

0 references

ON THE CLASSIFICATION OF PROPOSITIONAL PROVABILITY LOGICS

0 references

Q5494229

0 references

Gödel incompleteness theorems and the limits of their applicability. I

0 references

Some abstract versions of G\"odel's second incompleteness theorem based on non-classical logics

0 references

Model theory and arithmetic. Comptes rendus d'une action thematique programmee du C.N.R.S. sur la theorie des modeles et l'arithmetique, Paris, France, 1979/80

0 references

Gödel's Second incompleteness theorem for Q

0 references

Q4523482

0 references

Q4397069

0 references

Q3656422

0 references

The scope of Gödel's first incompleteness theorem

0 references

Q3794177

0 references

Q4215631

0 references

Information-Theoretic Limitations of Formal Systems

0 references

Gödel’s second incompleteness theorem for Σn-definable theories

0 references

Incompleteness for Higher-Order Arithmetic

0 references

FINDING THE LIMIT OF INCOMPLETENESS I

0 references

HARRINGTON’S PRINCIPLE IN HIGHER ORDER ARITHMETIC

0 references

Heterologicality and Incompleteness

0 references

Gödelizing the Yablo sequence

0 references

Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic

0 references

INCOMPLETENESS VIA PARADOX AND COMPLETENESS

0 references

Q2703808

0 references

Q3582626

0 references

Arithmetization of metamathematics in a general setting

0 references

Transfinite recursive progressions of axiomatic theories

0 references

Q5478000

0 references

Interpretability in Robinson's Q

0 references

Q5290924

0 references

On the necessary use of abstract set theory

0 references

Finite functions and the necessary use of large cardinals

0 references

Slow consistency

0 references

Arithmetic on semigroups

0 references

Phase transitions of iterated Higman-style well-partial-orderings

0 references

ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS

0 references

Undecidability without arithmetization

0 references

Q3509164

0 references

Partially Conservative Extensions of Arithmetic

0 references

Rosser sentences

0 references

Q3140636

0 references

Combinatorial principles concerning approximations of functions

0 references

Q5273442

0 references

SELF-REFERENCE IN ARITHMETIC I

0 references

SELF-REFERENCE IN ARITHMETIC II

0 references

A Relationship Among Gentzen's Proof-Reduction, Kirby-Paris' Hydra Game and Buchholz's Hydra Game

0 references

Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)

0 references

Q5772177

0 references

Q3764122

0 references

Necessary and Sufficient Conditions for Undecidability of the Gödel Sentence and its Truth

0 references

On Godel's Second Incompleteness Theorem

0 references

Recursive functions and existentially closed structures

0 references

On Gödel incompleteness and finite combinatorics

0 references

On Models Constructed by Means of the Arithmetized Completeness Theorem

0 references

A Note on Boolos' Proof of the Incompleteness Theorem

0 references

Kolmogorov complexity and the second incompleteness theorem

0 references

GENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑n-DEFINABLE THEORIES OF ARITHMETIC

0 references

UNIVERSAL ROSSER PREDICATES

0 references

On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos

0 references

On formalization of model-theoretic proofs of Gödel's theorems

0 references

Flipping properties in arithmetic

0 references

Q5796642

0 references

On the incompleteness theorems

0 references

Other Proofs of Old Results

0 references

The incompleteness theorems after 70 years

0 references

Note on arithmetic models for consistent formulae of the predicate calculus

0 references

On weak completeness of intuitionistic predicate logic

0 references

A survey of proof theory

0 references

The Surprise Examination Paradox and the Second Incompleteness Theorem

0 references

Yablifying the Rosser sentence

0 references

Rosser-type undecidable sentences based on Yablo's paradox

0 references

Arithmetical completeness theorem for modal logic \(\mathsf{K}\)

0 references

Arithmetical soundness and completeness for \(\Sigma_{2}\) numerations

0 references

A NOTE ON DERIVABILITY CONDITIONS

0 references

Q4385509

0 references

Q4354788

0 references

Solution of a problem of Leon Henkin

0 references

Q3926596

0 references

Q4190631

0 references

A generalization of the incompleteness theorem

0 references

Q5523665

0 references

Recursive functions and metamathematics. Problems of completeness and decidability, Gödel's theorems

0 references

Q5700817

0 references

Classical recursion theory. The theory of functions and sets of natural numbers.

0 references

Model theory of algebra and arithmetic. Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic Held at Karpacz, Poland, September 1-7, 1979

0 references

Handbook of mathematical logic. With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis and A. S. Troelstra. Reprint

0 references

Accessible Independence Results for Peano Arithmetic

0 references

Deduction-preserving "Recursive Isomorphisms" between theories

0 references

Yablo's paradox

0 references

Cuts, consistency statements and interpretations

0 references

INCOMPLETENESS IN THE FINITE DOMAIN

0 references

On Languages Which are Based on Non-Standard Arithmetic

0 references

Gödel–Rosser's Incompleteness Theorem, generalized and optimized for definable theories

0 references

On constructivity and the Rosser property: a closer look at some Gödelean proofs

0 references

Harvey Friedman's research on the foundations of mathematics

0 references

Q3395521

0 references

Interlude: About the First Theorem

0 references

Q4003735

0 references

Q4309515

0 references

Provability interpretations of modal logic

0 references

Q5445176

0 references

Tarski's System of Geometry

0 references

Undecidable theories

0 references

Systems of Logic Based on Ordinals†

0 references

Q5567863

0 references

The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic

0 references

Growing commas. A study of sequentiality and concatenation

0 references

Can We Make the Second Incompleteness Theorem Coordinate Free?

0 references

Q3464615

0 references

On \(\mathsf{Q}\)

0 references

The Second Incompleteness Theorem: Reflections and Ruminations

0 references

The Interpretation Existence Lemma

0 references

From Tarski to Gödel—or how to derive the second incompleteness theorem from the undefinability of truth without self-reference

0 references

ANOTHER LOOK AT THE SECOND INCOMPLETENESS THEOREM

0 references

Q5536262

0 references

Undecidable sentences generated by semantic paradoxes

0 references

An application of graphical enumeration to PA *

0 references

A classification of rapidly growing Ramsey functions

0 references

Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results

0 references

Classifying the Provably Total Functions of PA

0 references

Phase transition thresholds for some Friedman-style independence results

0 references

Self-verifying axiom systems, the incompleteness theorem and related reflection principles

0 references

A generalization of the second incompleteness theorem and some exceptions to it

0 references

Paradox without Self-Reference

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4959663