# Intuitionistic completeness of first-order logic

@article{Constable2014IntuitionisticCO, title={Intuitionistic completeness of first-order logic}, author={Robert L. Constable and Mark Bickford}, journal={Ann. Pure Appl. Log.}, year={2014}, volume={165}, pages={164-198} }

Abstract We constructively prove completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable in iFOL if and only if it is uniformly valid in intuitionistic evidence semantics as defined in intuitionistic type theory extended with an intersection operator. Our completeness proof provides an effective procedure that converts any uniform evidence into a formal iFOL proof. Uniform evidence can involve arbitrary concepts from type theory such as ordinals, topological…

## 21 Citations

Intuitionistic Completeness of First-Order Logic – mPC Case

- 2015

We constructively prove in type theory the completeness of the minimal Propositional Calculus, showing that a formula is provable in mPC if and only if it is uniformly valid in constructive type…

Intuitionistic ancestral logic

- Computer Science, MathematicsJ. Log. Comput.
- 2019

It is shown that provable formulas in iAL are uniformly realizable, thus iAL is sound with respect to constructive type theory and serves as a natural programming logic for proving properties of program schemes.

Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory

- Computer Science, MathematicsLFCS
- 2020

A reusable Coq library for first-order logic containing all results covered in this paper is contributed and analysed the assumptions necessary for particular syntax fragments and discussed non-standard semantics admitting assumption-free completeness.

A nominal exploration of intuitionism

- Computer ScienceCPP
- 2016

This papers extends the Nuprl proof assistant with named exceptions and handlers, as well as a nominal fresh operator, to prove a version of Brouwer's Continuity Principle for numbers and provides a simpler proof of a weaker version of this principle that only uses diverging terms.

Virtual Evidence: A Constructive Semantics for Classical Logics

- Computer Science, MathematicsArXiv
- 2014

This article presents a computational semantics for classical logic using constructive type theory, and a new axiom creating virtual evidence fully retains the constructive meaning of the logical operators in classical contexts.

Intuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language

- Computer ScienceWoLLIC
- 2015

A careful examination of the various applications of logic in computer science reveals that FOL is insufficient for most of them, and that its most crucial shortcoming is its inability to provide inductive definitions in general, and the notion of the transitive closure in particular.

CS 6180 Lecture 26 – Automated Reasoning and Ultra-Intuitionism

- 2017

This lecture will briefly consider two topics. The main one is the relationship between automated reasoning, an AI topic, and constructive type theory. The other topic is a brief mention of a radical…

Higher order functions and Brouwer’s thesis

- Computer ScienceJournal of Functional Programming
- 2021

It is shown that Brouwer’s famous “mental constructions” of barhood constitute an invariant form of these dialogue trees in which queries to the oracle are made maximally and in order.

Validating Brouwer's continuity principle for numbers using named exceptions

- Mathematics, Computer ScienceMathematical Structures in Computer Science
- 2017

This paper extends the Nuprl proof assistant with named exceptions and handlers, as well as a nominal fresh operator, and proves a version of Brouwer's continuity principle for numbers and provides a simpler proof of this principle that only uses diverging terms.

Proof Assistants and the Dynamic Nature of Formal Theories

- Computer Science, MathematicsPxTP
- 2012

Both theory exploration and proof exchange illustrate the dynamic nature of applied formal theories built using modern proof assistants, dispel the false impression that formal theories are rigid and brittle artifacts that become less relevant over time in a fast moving eld like computer science.

## References

SHOWING 1-10 OF 101 REFERENCES

Completeness and incompleteness for intuitionistic logic

- Mathematics, Computer ScienceJournal of Symbolic Logic
- 2008

A variant of its proof yields a generalization of the Gödel-Kreisel Theorem linking weak completeness for intuitionistic predicate logic to Markov's Principle, which is corollaries of a single theorem.

An Abstract Notion of Realizability for Which Intuitionistic Predicate Calculus is Complete

- Mathematics
- 1970

Publisher Summary This chapter presents an abstract notion of realizabillty for which intuitionistic predicate calculus is complete. It is shown that A is derivable in Heyting's predicate calculus if…

Uniform provability realization of intuitionistic logic, modality and lambda-terms

- Computer Science, MathematicsElectron. Notes Theor. Comput. Sci.
- 1999

This tutorial talk presents a provability realization of Int and S4 that solves both the problem of finding an adequate formalization of the provability semantics and establishing the completeness of the intuitionistic logic Int.

Continuation-passing style models complete for intuitionistic logic

- Mathematics, Computer ScienceAnn. Pure Appl. Log.
- 2013

A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic, and a $\beta$-normalisation-by-evaluation program for simply typed lambda calculus with sum types.

Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and Läuchli Countermodels

- Mathematics, Computer ScienceAnn. Pure Appl. Log.
- 1996

It is argued in some detail that, in spite of a certain inherent inexactness of the analogy, every intuitively constructive truth is valid in Lauchli semantics, and therefore the Heyting Calculus is powerful enough to prove all constructive truths.

Undecidability and intuitionistic incompleteness

- Mathematics, Computer ScienceJ. Philos. Log.
- 1996

These results give extensions of the theorem of Gödel and Kreisel that completeness for pure intuitionistic predicate logic requires MP.

An Intuitionistically Plausible Interpretation of Intuitionistic Logic

- Mathematics, Computer ScienceJ. Symb. Log.
- 1977

To be able to settle the converse question: “if A is intuitively true, then ⊦ IPC A ”, one should make the notion of intuitionistic truth more easily amenable to mathematical treatment.

A framework for defining logics

- Computer ScienceJACM
- 1993

The Edinburgh Logical Framework provides a means to define (or present) logics through a general treatment of syntax, rules, and proofs by means of a typed λ-calculus with dependent types, whereby each judgment is identified with the type of its proofs.

Semantical Analysis of Intuitionistic Logic I

- Mathematics
- 1965

Publisher Summary The chapter discusses a semantical analysis of intuitionistic logic I. The chapter presents a semantical model theory for Heyting's intuitionist predicate logic and proves the…

An Intuitionistic Theory of Types: Predicative Part

- Mathematics
- 1975

Publisher Summary The theory of types is intended to be a full-scale system for formalizing intuitionistic mathematics as developed. The language of the theory is richer than the languages of…