Pages that link to "Item:Q5764758"
From MaRDI portal
The following pages link to Extensions of some theorems of Gödel and Church (Q5764758):
Displaying 27 items.
- On decidability of the theory with the transitive closure operator (Q266242) (← links)
- Rosser-type undecidable sentences based on Yablo's paradox (Q484194) (← links)
- Malament-Hogarth machines and Tait's axiomatic conception of mathematics (Q488474) (← links)
- An implication of Gödel's incompleteness theorem. II: Not referring to the validity of oneself's assertion (Q662344) (← links)
- Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006 (Q873911) (← links)
- Formal axiomatic theories based on a three-valued logic (Q937906) (← links)
- Sixty years after Gödel (Q1178182) (← links)
- Rosser and Mostowski sentences (Q1263586) (← links)
- Representing the knowledge of Turing machines (Q1330015) (← links)
- Undecidability of equality for codata types (Q1798783) (← links)
- Definability, decidability, complexity (Q1817073) (← links)
- In defense of logical universalism: taking issue with Jean van Heijenoort (Q1942101) (← links)
- The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
- Uniform density in Lindenbaum algebras (Q2258545) (← links)
- Taming the incomputable, reconstructing the nonconstructive and deciding the undecidable in mathematical economics (Q2873496) (← links)
- On the foundations of mathematical economics (Q2873497) (← links)
- ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP (Q3386609) (← links)
- The Gödelian Inferences (Q3401359) (← links)
- GENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑<sub><i>n</i></sub>-DEFINABLE THEORIES OF ARITHMETIC (Q4600818) (← links)
- Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski (Q4953233) (← links)
- Robust and nonlinear control literature survey (No. 3) (Q5449735) (← links)
- Bemerkungen zum Begriff der inhaltlichen Widerspruchsfreiheit (Q5774803) (← links)
- Contributions to the reduction theory of the decision problem (Q5808412) (← links)
- Arithmetical problems and recursively enumerable predicates (Q5820550) (← links)
- Representations of calculi (Q5834325) (← links)
- Arithmetical completeness theorems for monotonic modal logics (Q6040616) (← links)
- An analysis of Tennenbaum's theorem in constructive type theory (Q6563042) (← links)