Loading Open Internet
    What are the basic assumptions of type theory-based proof assistants compared to those of traditional mathematics (e.g. real analysis)?