Questions tagged [foundations]
Use this tag for questions about mathematical or logical foundations of proof assistants. Questions should be related in some way to proof assistants. Possible topics might include mathematical modelling, consistency and computability, universes, etc.
25
questions
7
votes
3
answers
195
views
Why is $\Bbb Z = \Bbb N$ independent of Lean?
In this answer, it is noted
For a silly example, in ZFC with the usual encoding, $\mathbb{Z} \neq \mathbb{N}$, but in Lean it is well-known that this is independent. Of course in both ZFC or Lean, ...
6
votes
2
answers
305
views
Lean and inaccessible cardinals
It seems well known that Lean's type theory is equiconsistent with ZFC + the existence of $n$ inaccessible cardinals for every $n>0$.
Suppose I want to ensure that my lean proofs depend only on ZFC,...
0
votes
0
answers
119
views
MLTT with first-order reasoning and equality-reasoning information preservation
Terms in Extensional MLTT don't contain equality-reasoning information (implicit transports), effectively meaning data is lost, which is bad. But at the same time, higher-order reasoning (reasoning ...
8
votes
1
answer
208
views
Feferman's universes for proof assistants?
I asked this question on MathOverflow a few months ago, but received no answers.
There are some mathematicians who are comfortable with ZFC but uneasy with large cardinals. For them, it may be ...
0
votes
2
answers
175
views
Does a proof assistant have to be interactive?
I have thought of systems like Coq & Isabelle as programming languages specialised for writing proofs.
A programming language might or might not have a REPL making it interactive but the REPL is ...
3
votes
0
answers
128
views
Uniform notions of pattern matching at dependent types with impredicative proof strength
I am looking for axioms/inference rules that satisfy the following 3 conditions:
can be added to predicative intensional Martin-Löf type theory, so $\Pi$, $\Sigma$, equality type, with W-types, ...
5
votes
0
answers
229
views
Proof-theoretic strength of HOL compared to predicative dependent types
By HOL I mean something like inference rules of HOL Light with the 3 axioms of infinity, extensionality and choice ($\varepsilon$ operator).
By predicative dependent types, I am thinking of MLTT + W-...
1
vote
2
answers
173
views
Does quantification over functions (STLC) increase strength beyond first order logic?
Does quantification over functions (STLC) increase strength beyond first order logic?
I want to add support for binders in my little constructive first order logic formalism I'm working on but I'm ...
9
votes
2
answers
820
views
Construction of inductive types "the hard way"
Most theorem provers simply axiomize inductive types (or equivalently W types) in the abstract which is fine.
But I'm curious about explicit constructions of inductive types within the theory.
I ...
16
votes
3
answers
1k
views
Do you need a Hilbert style Epsilon operator for definitions in set theory?
I've started to play with mechanizing some set theory stuff. I'm not sure if I want a constructive flavor or not yet.
Anyhow you can do stuff like axiomize the empty set
$$ \top \vdash \exists P. \...
13
votes
0
answers
369
views
Unintentionally proven false theorem with type-in-type outside logic and foundations?
We are all familiar with Russell's paradox, and it is known that Per Martin-Löf proved that type-in-type is normalizing and consistent (which is false), by accidentally using an assumption in his meta-...
11
votes
1
answer
614
views
What is the role of impredicativity in program extraction?
Is impredicativity useful for program extraction in Coq? For example is there some kind of realizability argument that depends on impredicativity?
Of course it doesn't seem to be necessary for program ...
21
votes
1
answer
1k
views
Proof-theoretic comparison table?
I read this CSTheory SE post, which suggests that it is often not clear what variant of MLTT or CIC is being referred to. But I would like to know the proof-theoretic strengths of the various ...
9
votes
1
answer
181
views
Generating valid statements without a proof goal
Given some initial list of assumptions, I'd like to generate some true statements which follow from them without seeking a specific proof goal. I only need a small number of consequences from those ...
18
votes
2
answers
573
views
What is the trade-off to accepting impredicative propositions?
Impredicativity greatly increases the logical strength of a formal system, and impredicative propositions are also a consequence of various axioms including LEM and Zorn's Lemma. An impredicative sort ...