Question

Deciding wether a language is regular, in the arithmetic hierarchy

score 104 · Answer 1 · 2018-01-28 12:49:50

104

Views

Deciding wether a language is regular, in the arithmetic hierarchy

Published on 28 Jan 2018 - 12:49

score 41 · Answer 2 · 2018-01-28 14:07:49

41

Views

SAT preserving conversion of statement to existential one

Published on 28 Jan 2018 - 14:07

score 149 · Answer 3 · 2018-02-01 03:38:56

149

Views

The elementary theory of finite commutative rings

Published on 01 Feb 2018 - 3:38

score 251 · Answer 4 · 2018-02-05 23:34:15

251

Views

Is the sign of a real number decidable?

Published on 05 Feb 2018 - 23:34

score 101 · Answer 5 · 2018-03-08 15:52:11

101

Views

Relation between the monadic and two-variable fragment of first order logic

Published on 08 Mar 2018 - 15:52

score 105 · Answer 6 · 2018-03-12 11:25:06

105

Views

Literature about decidable and undecidable theories

Published on 12 Mar 2018 - 11:25

score 498 · Answer 7 · 2018-03-15 03:52:04

498

Views

Flaw in self-referential proof that all languages are undecidable

Published on 15 Mar 2018 - 3:52

score 790 · Answer 8 · 2018-04-11 12:23:44

790

Views

A recursively enumerable theory without a decidable set of axioms.

Published on 11 Apr 2018 - 12:23

score 188 · Answer 9 · 2018-04-11 17:22:41

188

Views

Proving decidability of $(\mathbb N, +)$ with Quantifier elimination and evaluating basic formulas

Published on 11 Apr 2018 - 17:22

score 775 · Answer 10 · 2018-04-11 18:33:44

775

Views

Showing that Presburger arithmetic is decidable by deciding if $\mathbb N \models \varphi$, but does it give provability in the axioms?

Published on 11 Apr 2018 - 18:33

score 218 · Answer 11 · 2018-04-13 20:56:42

218

Views

Turing machine - Reducible

Published on 13 Apr 2018 - 20:56

score 98 · Answer 12 · 2018-04-17 20:54:46

98

Views

Decidability/undecidability of the feasibility of optimization problems

Published on 17 Apr 2018 - 20:54

score 1k · Answer 13 · 2018-04-18 22:32:15

1k

Views

Classify language as decidable, undecidable but recognisable or unrecognizable

Published on 18 Apr 2018 - 22:32

score 407 · Answer 14 · 2018-04-20 04:19:16

407

Views

Is First Order Logic + Arithmetic semi-decidable?

Published on 20 Apr 2018 - 4:19

score 66 · Answer 15 · 2018-04-23 19:05:57

66

Views

Can the question whether $x^a+y^b+z^c=n$ has a solution over the integers be undecidable?

Published on 23 Apr 2018 - 19:05

List Question

Deciding wether a language is regular, in the arithmetic hierarchy

SAT preserving conversion of statement to existential one

The elementary theory of finite commutative rings

Is the sign of a real number decidable?

Relation between the monadic and two-variable fragment of first order logic

Literature about decidable and undecidable theories

Flaw in self-referential proof that all languages are undecidable

A recursively enumerable theory without a decidable set of axioms.

Proving decidability of $(\mathbb N, +)$ with Quantifier elimination and evaluating basic formulas

Showing that Presburger arithmetic is decidable by deciding if $\mathbb N \models \varphi$, but does it give provability in the axioms?

Turing machine - Reducible

Decidability/undecidability of the feasibility of optimization problems

Classify language as decidable, undecidable but recognisable or unrecognizable

Is First Order Logic + Arithmetic semi-decidable?

Can the question whether $x^a+y^b+z^c=n$ has a solution over the integers be undecidable?

Trending Questions

Popular # Hahtags

Popular Questions