An intuitionistic completeness theorem for classical predicate logic (Q708927)

From MaRDI portal
Revision as of 01:22, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
An intuitionistic completeness theorem for classical predicate logic
scientific article

    Statements

    An intuitionistic completeness theorem for classical predicate logic (English)
    0 references
    0 references
    15 October 2010
    0 references
    The completeness of intuitionistic first-order logic with respect to the corresponding class of structures can be proved via a purely intuitionistic argument establishing a connection between Beth forcing and intuitionistic validity. The author shows that a similar argument leads to an intuitionistic version of Gödel's completeness theorem for classical first-order logic.
    0 references
    classical predicate logic
    0 references
    Gödel completeness theorem
    0 references
    intuitionistic completeness proof
    0 references

    Identifiers