Pages that link to "Item:Q392280"
From MaRDI portal
The following pages link to Intuitionistic completeness of first-order logic (Q392280):
Displaying 17 items.
- Trace-based verification of imperative programs with I/O (Q617977) (← links)
- An intuitionistic completeness theorem for classical predicate logic (Q708927) (← links)
- Innovations in computational type theory using Nuprl (Q865639) (← links)
- Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic (Q1884882) (← links)
- Semantical completeness of first-order predicate logic and the weak fan theorem (Q2350974) (← links)
- Failure of completeness in proof-theoretic semantics (Q2516584) (← links)
- Intuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language (Q2947456) (← links)
- Lindenbaum’s Lemma via Open Induction (Q3305552) (← links)
- (Q3367332) (← links)
- UNIFICATION IN INTERMEDIATE LOGICS (Q3450801) (← links)
- Intuitionistic completeness for first order classical logic (Q4254637) (← links)
- Validating Brouwer's continuity principle for numbers using named exceptions (Q4640313) (← links)
- (Q4731165) (← links)
- (Q4805940) (← links)
- (Q4806272) (← links)
- Higher order functions and Brouwer’s thesis (Q5016215) (← links)
- (Q5419867) (← links)