2003•Theoretical Computer ScienceOpen access

Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic

Karim Nour, Christophe Raffalli

Open full text 4 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Second-order logic, Gödel's completeness theorem, Completeness (order theory), Mathematics, Simple (philosophy), Intuitionistic logic, Higher-order logic, Order (exchange)

Back to paper search Browse research topics Original source

Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic — Research Paper | ScholarLens