scientific article; zbMATH DE number 7561487
From MaRDI portal
Publication:5091142
DOI10.4230/LIPIcs.TYPES.2018.2MaRDI QIDQ5091142
Andrej Dudenhefner, Jakob Rehof
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
undecidabilitypropositional logicprovabilityCoqinhabitationformalizationsystem F\(\lambda\) calculus
Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (4)
The existential fragment of second-order propositional intuitionistic logic is undecidable ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Unnamed Item
- A syntactic embedding of predicate logic into second-order propositional logic
- Lectures on the Curry-Howard isomorphism
- Verification of PCP-related computational reductions in Coq
- Embedding first order predicate logic in fragments of intuitionistic logic
- Hilbert's Tenth Problem is Unsolvable
- On 2nd order intuitionistic propositional calculus with full comprehension
- Introduction to generalized type systems
This page was built for publication:
