Question

Formal systems in which $\forall x \in \mathbb{R}(x \neq 0 \rightarrow x^{-1} \neq 0)$ is true, but the contrapositive is disallowed.

score 173 · Answer 1 · 2016-06-13 17:19:21

173

Views

Formal systems in which $\forall x \in \mathbb{R}(x \neq 0 \rightarrow x^{-1} \neq 0)$ is true, but the contrapositive is disallowed.

Published on 13 Jun 2016 - 17:19

score 401 · Answer 2 · 2026-03-05 07:51:47

401

Views

The monadic second order theory with $<$ and Presburger arithmetic

Published on 05 Mar 2026 - 7:51

score 1k · Answer 3 · 2016-06-25 16:46:44

1k

Views

What does "consistency" mean if formal systems are inherently meaningless?

Published on 25 Jun 2016 - 16:46

score 54 · Answer 4 · 2016-06-25 18:49:34

54

Views

Which functions can be obtained by applying these syntactic rules?

Published on 25 Jun 2016 - 18:49

score 177 · Answer 5 · 2016-06-30 02:52:42

177

Views

Loops in Robinson arithmetic

Published on 30 Jun 2016 - 2:52

score 274 · Answer 6 · 2013-05-01 04:31:19

274

Views

A question about the analogy between formal systems and Turing machines

Published on 01 May 2013 - 4:31

score 1.1k · Answer 7 · 2013-06-21 21:46:24

1.1k

Views

How do we derive new inference rules?

Published on 21 Jun 2013 - 21:46

score 125 · Answer 8 · 2013-08-16 09:33:56

125

Views

In a string rewriting system, does rewriting consume the string?

Published on 16 Aug 2013 - 9:33

score 156 · Answer 9 · 2013-08-16 14:27:55

156

Views

From a foundational point of view, what's a good specification language for formal systems?

Published on 16 Aug 2013 - 14:27

score 106 · Answer 10 · 2013-10-06 19:39:59

106

Views

Is this $\beta$-reduction well defined?

Published on 06 Oct 2013 - 19:39

score 503 · Answer 11 · 2013-10-09 00:55:08

503

Views

$\beta$ - conversion and $\alpha$-reduction problem in $\lambda$-calculus

Published on 09 Oct 2013 - 0:55

score 585 · Answer 12 · 2013-12-26 12:55:15

585

Views

Textbook on Basics of Formal Systems

Published on 26 Dec 2013 - 12:55

score 71 · Answer 13 · 2014-02-06 13:50:28

71

Views

Certain sequents as inference rules

Published on 06 Feb 2014 - 13:50

score 81 · Answer 14 · 2014-03-08 16:34:32

81

Views

Prove the admissibility of $\Gamma, A \vdash_N B $, from $\Gamma \vdash_N B$

Published on 08 Mar 2014 - 16:34

score 138 · Answer 15 · 2017-04-10 17:45:31

138

Views

What are "non-trivial formal systems"?

Published on 10 Apr 2017 - 17:45

List Question

Formal systems in which $\forall x \in \mathbb{R}(x \neq 0 \rightarrow x^{-1} \neq 0)$ is true, but the contrapositive is disallowed.

The monadic second order theory with $<$ and Presburger arithmetic

What does "consistency" mean if formal systems are inherently meaningless?

Which functions can be obtained by applying these syntactic rules?

Loops in Robinson arithmetic

A question about the analogy between formal systems and Turing machines

How do we derive new inference rules?

In a string rewriting system, does rewriting consume the string?

From a foundational point of view, what's a good specification language for formal systems?

Is this $\beta$-reduction well defined?

$\beta$ - conversion and $\alpha$-reduction problem in $\lambda$-calculus

Textbook on Basics of Formal Systems

Certain sequents as inference rules

Prove the admissibility of $\Gamma, A \vdash_N B $, from $\Gamma \vdash_N B$

What are "non-trivial formal systems"?

Trending Questions

Popular # Hahtags

Popular Questions