The following pages link to (Q5567863):
Displaying 20 items.
- A necessary condition for constructive negation in constraint logic programming (Q294756) (← links)
- Weak theories of concatenation and arithmetic (Q435240) (← links)
- Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\) (Q481870) (← links)
- The calculus of relations as a foundation for mathematics (Q877838) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- Nonconvergence, undecidability, and intractability in asymptotic problems (Q1095135) (← links)
- On the effective content of asymptotic verifications of Edgeworth's Conjecture (Q1181757) (← links)
- On \(\mathsf{Q}\) (Q1699730) (← links)
- Friedman-reflexivity (Q2159935) (← links)
- A universal algebraic set theory built on mereology with applications (Q2169135) (← links)
- The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
- On the decision problem for theories of finite models (Q2523202) (← links)
- Variants of Robinson's essentially undecidable theoryR (Q4749827) (← links)
- CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS (Q4959663) (← links)
- FINDING THE LIMIT OF INCOMPLETENESS I (Q4984861) (← links)
- Undecidability of Algebras of Binary Relations (Q5015973) (← links)
- HOW MUCH PROPOSITIONAL LOGIC SUFFICES FOR ROSSER’S ESSENTIAL UNDECIDABILITY THEOREM? (Q5078818) (← links)
- Constructive negation and constraint logic programming with sets (Q5945160) (← links)
- Essential hereditary undecidability (Q6565566) (← links)
- Pour-El's landscape (Q6670877) (← links)
