The following pages link to (Q4286756):
Displayed 18 items.
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- Diophantine equations and the generalized Riemann hypothesis (Q548056) (← links)
- Authentication schemes from actions on graphs, groups, or rings (Q638486) (← links)
- \(\text{NP}\not={co}\)-NP and models of arithmetic (Q672454) (← links)
- P, NP, Co-NP and weak systems of arithmetic (Q672742) (← links)
- Uncomputability and undecidability in economic theory (Q1036534) (← links)
- Diophantine undecidability of holomorphy rings of function fields of characteristic 0 (Q1041275) (← links)
- Metafinite model theory (Q1383163) (← links)
- On the computability of Nash equilibria (Q1391660) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- Liouville closed \(H\)-fields (Q1772249) (← links)
- Normal forms for second-order logic over finite structures, and classification of NP optimization problems (Q1919763) (← links)
- Definability and decidability in infinite algebraic extensions (Q2349099) (← links)
- Extendability of continuous maps is undecidable (Q2441584) (← links)
- Diophantine sets of representations (Q2445923) (← links)
- Isomorphisms of scattered automatic linear orders (Q2446106) (← links)
- Theories of orders on the set of words (Q3374756) (← links)
- Tree Automata for Non-linear Arithmetic (Q3522025) (← links)