Question

Converting formula to a closed form with only existential quantifiers

score 99 · Answer 1 · 2018-08-18 19:52:44

99

Views

Converting formula to a closed form with only existential quantifiers

Published on 18 Aug 2018 - 19:52

score 233 · Answer 2 · 2018-08-19 18:49:12

233

Views

Algorithm to decide the universality / functional completeness of a set of logic gates?

Published on 19 Aug 2018 - 18:49

score 207 · Answer 3 · 2018-08-30 21:27:25

207

Views

Large Cardinals and Diophantine Equations (Penelope Maddy)

Published on 30 Aug 2018 - 21:27

score 664 · Answer 4 · 2018-09-06 20:50:13

664

Views

Why is the set of all tautologies in propositional logic recursively enumerable?

Published on 06 Sep 2018 - 20:50

score 402 · Answer 5 · 2018-09-12 10:16:49

402

Views

Are soundness and completeness necessary for decidability?

Published on 12 Sep 2018 - 10:16

score 46 · Answer 6 · 2018-09-13 22:13:05

46

Views

Decidability context-sensitiv and context-free grammars

Published on 13 Sep 2018 - 22:13

score 84 · Answer 7 · 2018-09-28 16:13:03

84

Views

Proof in constructive mathematics using decidability.

Published on 28 Sep 2018 - 16:13

score 859 · Answer 8 · 2018-10-15 18:42:40

859

Views

Why is ZFC recursively axiomatizable?

Published on 15 Oct 2018 - 18:42

score 119 · Answer 9 · 2018-11-11 00:06:25

119

Views

The (un)decidability of the Tits Alternative for any given (suitably defined) set of groups.

Published on 11 Nov 2018 - 0:06

score 112 · Answer 10 · 2018-11-17 20:31:34

112

Views

Recursion Theory/Incompleteness Theorems: Computability of sets of formulas in first order logic

Published on 17 Nov 2018 - 20:31

score 1.2k · Answer 11 · 2018-11-19 00:43:31

1.2k

Views

Gödel's completeness theorem and the undecidability of first-order logic

Published on 19 Nov 2018 - 0:43

score 95 · Answer 12 · 2018-11-23 22:31:00

95

Views

Proving the diagonalization of $U \subset \mathbb{N} \times \mathbb{N}$ that is an universal set for all enumerable sets of naturals is undecidable

Published on 23 Nov 2018 - 22:31

score 2.5k · Answer 13 · 2018-11-28 14:27:53

2.5k

Views

Example of incomplete, but decidable theory, and of complete and undecidable theory, question

Published on 28 Nov 2018 - 14:27

score 93 · Answer 14 · 2018-11-30 10:11:00

93

Views

Undecidability of: $|w \in L| \geq 1, L=\{w \in \{0,1\}^*|a_0·\#_0(w)+a_1·\#_1(w)- a_1a_0=0\}$

Published on 30 Nov 2018 - 10:11

score 216 · Answer 15 · 2018-12-26 02:03:09

216

Views

proof that specific disjoint sets are recursively enumerable, but don't lie in a decidable set and its complement

Published on 26 Dec 2018 - 2:03

List Question

Converting formula to a closed form with only existential quantifiers

Algorithm to decide the universality / functional completeness of a set of logic gates?

Large Cardinals and Diophantine Equations (Penelope Maddy)

Why is the set of all tautologies in propositional logic recursively enumerable?

Are soundness and completeness necessary for decidability?

Decidability context-sensitiv and context-free grammars

Proof in constructive mathematics using decidability.

Why is ZFC recursively axiomatizable?

The (un)decidability of the Tits Alternative for any given (suitably defined) set of groups.

Recursion Theory/Incompleteness Theorems: Computability of sets of formulas in first order logic

Gödel's completeness theorem and the undecidability of first-order logic

Proving the diagonalization of $U \subset \mathbb{N} \times \mathbb{N}$ that is an universal set for all enumerable sets of naturals is undecidable

Example of incomplete, but decidable theory, and of complete and undecidable theory, question

Undecidability of: $|w \in L| \geq 1, L=\{w \in \{0,1\}^*|a_0·\#_0(w)+a_1·\#_1(w)- a_1a_0=0\}$

proof that specific disjoint sets are recursively enumerable, but don't lie in a decidable set and its complement

Trending Questions

Popular # Hahtags

Popular Questions