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 ...
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 ...
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 ...
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 ...
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 ...
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 ...