scientific article; zbMATH DE number 3285224
From MaRDI portal
Publication:5567863
Cited in
(22)- Nonconvergence, undecidability, and intractability in asymptotic problems
- On the effective content of asymptotic verifications of Edgeworth's Conjecture
- On \(\mathsf{Q}\)
- Friedman-reflexivity
- A universal algebraic set theory built on mereology with applications
- The scope of Gödel's first incompleteness theorem
- On the decision problem for theories of finite models
- A necessary condition for constructive negation in constraint logic programming
- Weak theories of concatenation and arithmetic
- Variants of Robinson's essentially undecidable theoryR
- Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
- Current research on Gödel's incompleteness theorems
- Finding the limit of incompleteness. I
- Undecidability of Algebras of Binary Relations
- How much propositional logic suffices for Rosser's essential undecidability theorem?
- Constructive negation and constraint logic programming with sets
- Essential hereditary undecidability
- Pour-El's landscape
- Certified _1-sentences
- Mathematical developments of the incompleteness theorems
- The calculus of relations as a foundation for mathematics
- A uniform method for proving lower bounds on the computational complexity of logical theories
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5567863)
