The following pages link to Undecidable theories (Q2651342):
Displaying 50 items.
- Definability in the substructure ordering of simple graphs (Q259729) (← links)
- A comprehensive picture of the decidability of mereological theories (Q383563) (← links)
- On the possibility of inference to the best explanation (Q427229) (← links)
- Provability and interpretability logics with restricted realizations (Q435232) (← 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)
- Bounding essential arities of term operations in finitely decidable varieties (Q494631) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Models and the dynamics of theory-building in physics. I: Modeling strategies (Q643103) (← links)
- A generalized notion of weak interpretability and the corresponding modal logic (Q685075) (← links)
- Faith \& falsity (Q705533) (← links)
- Some new results on decidability for elementary algebra and geometry (Q714712) (← links)
- Some notes on truths and comprehension (Q722023) (← links)
- Principles for object-linguistic consequence: from logical to irreflexive (Q722029) (← links)
- Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem (Q731897) (← links)
- Mass problems associated with effectively closed sets (Q765664) (← links)
- A correspondence between commutative rings and Jordan loops (Q784468) (← links)
- Closure functions and general iterates as reflectors (Q808275) (← links)
- A portrait of Alfred Tarski (Q809989) (← links)
- Generalizing classical and effective model theory in theories of operations and classes (Q810008) (← links)
- Algorithmic undecidability of compatibility problem for equations in free groups: explicit equations with one commutator-type constraint (Q827048) (← links)
- The calculus of relations as a foundation for mathematics (Q877838) (← links)
- Passive induction and a solution to a Paris-Wilkie open question (Q882120) (← links)
- Pairs, sets and sequences in first-order theories (Q943342) (← links)
- Interpretability in PRA (Q1035648) (← links)
- A view of computability on term algebras (Q1051428) (← links)
- A mathematical characterization of interpretation between theories (Q1062672) (← links)
- Undecidability of free pseudo-complemented semilattices (Q1098833) (← links)
- On the number of steps in proofs (Q1119576) (← links)
- The definability of fields (Q1125121) (← links)
- Existentially complete lattice-ordered groups (Q1149459) (← links)
- Independence results in computer science? (Q1158957) (← links)
- The decision problem for database dependencies (Q1162832) (← links)
- Quantification for Peirce's preferred system of triadic logic (Q1167713) (← links)
- General iteration and unary functions (Q1182467) (← links)
- The logic of linear tolerance (Q1207342) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- Infinite coforcing in model theory (Q1220510) (← links)
- Lattice-theoretic decision problems in universal algebra (Q1223286) (← links)
- In memory of Andrzej Mostowski (Q1237769) (← links)
- Problemi di decidibilita in logica topologica (Q1255489) (← links)
- Independent axiomatizability of sets of sentences (Q1262853) (← links)
- Computably enumerable sets and quasi-reducibility (Q1295419) (← links)
- Uncertainty, predictability and decidability in chaotic dynamical systems (Q1346395) (← links)
- On a generalized modularization theorem (Q1607048) (← links)
- Intertheoretic reduction, confirmation, and Montague's syntax-semantics relation (Q1630947) (← links)
- On constructivity and the Rosser property: a closer look at some Gödelean proofs (Q1653263) (← links)
- On \(\mathsf{Q}\) (Q1699730) (← links)
- The logical strength of compositional principles (Q1704080) (← links)
- The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
