17
votes
1answer
725 views

Main open computational problems in quantifier elimination?

A language is said to have quantifier elimination if every first-order-logic sentence in the language can be shown to be equivalent to a quantifier-free sentence, i.e., a sentence without any ...
43
votes
2answers
944 views

Reasons to prefer one large prime over another to approximate characteristic zero

Background: In running algebraic geometry computations using software such as Macaulay2, it is often easier and faster to work over $\mathbb F_p = \mathbb Z / p\mathbb Z$ for a large prime $p$, rather ...
1
vote
3answers
357 views

the Richardson theorem and the base identities problem

In the fields related to school mathematics there is some acitivity on proving (or disproving) deducibility/decidability for some classes of school identities. In particular, 1) In logic they ...
21
votes
5answers
6k views

The unification of Mathematics via Topos Theory

When the paper The unification of Mathematics via Topos Theory by Olivia Caramello, says "one can generate a huge number of new results in any mathematical field without any creative effort." is this ...
7
votes
5answers
3k views

Finding minimal or canonical expressions for Boolean truth tables

This is not an urgent question, but something I've been curious about for quite some time. Consider a Boolean function in n inputs: the truth table for this function has 2n rows. There are uses of ...
9
votes
9answers
2k views

Is there a non self-referencing non-computable function?

I've seen in college that some functions are not computable. The proof for that was the case of Halt(x,y) function. The thing is, the proof used a very artificial (IMHO) case which is evaluating ...