Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version (Q6156642)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version |
scientific article; zbMATH DE number 7695716
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version |
scientific article; zbMATH DE number 7695716 |
Statements
Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version (English)
0 references
14 June 2023
0 references
undecidability
0 references
synthetic computability
0 references
first-order logic
0 references
incompleteness
0 references
Peano arithmetic
0 references
ZF set theory
0 references
constructive type theory
0 references
Coq
0 references
